scispace - formally typeset
Search or ask a question
Topic

Linear function

About: Linear function is a research topic. Over the lifetime, 910 publications have been published within this topic receiving 19614 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors consider the problem of providing incentives over time for an agent with constant absolute risk aversion, and find that the optimal compensation scheme is a linear function of a vector of accounts which count the number of times that each of the N kinds of observable events occurs.
Abstract: We consider the problem of providing incentives over time for an agent with constant absolute risk aversion. The optimal compensation scheme is found to be a linear function of a vector of N accounts which count the number of times that each of the N kinds of observable events occurs. The number N is independent of the number of time periods, so the accounts may entail substantial aggregation. In a continuous time version of the problem, the agent controls the drift rate of a vector of accounts that is subject to frequent, small random fluctuations. The solution is as if the problem were the static one in which the agent controls only the mean of a multivariate normal distribution and the principal is constrained to use a linear compensation rule. If the principal can observe only coarser linear aggregates, such as revenues, costs, or profits, the optimal compensation scheme is then a linear function of those aggregates. The combination of exponential utility, normal distributions, and linear compensation schemes makes computations and comparative statics easy to do, as we illustrate. We interpret our linearity results as deriving in part from the richness of the agent's strategy space, which makes it possible for the agent to undermine and exploit complicated, nonlinear functions of the accounting aggregates.

2,843 citations

Book ChapterDOI
01 Jan 1992
TL;DR: The earliest method of estimation of statistical parameters is the method of least squares due to Mark off as discussed by the authors, where a set of observations whose expectations are linear functions of a number of unknown parameters being given, the problem which Markoff posed for solution is to find out a linear function of observations, whose expectation is an assigned linear function for the unknown parameters and whose variance is a minimum.
Abstract: The earliest method of estimation of statistical parameters is the method of least squares due to Mark off. A set of observations whose expectations are linear functions of a number of unknown parameters being given, the problem which Markoff posed for solution is to find out a linear function of observations whose expectation is an assigned linear function of the unknown parameters and whose variance is a minimum. There is no assumption about the distribution of the observations except that each has a finite variance.

1,900 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present a probit, ordered probit model and a multinomial pro... model for estimating a linear function and a normal error in a small-sample linear regression model.
Abstract: At the heart of many econometric models are a linear function and a normal error. Examples include the classical small-sample linear regression model and the probit, ordered probit, multinomial pro...

871 citations

Journal ArticleDOI
TL;DR: In this article, the authors provide a systematic and explicit description of the interaction between two rigid spheres that are relevant in a calculation of the mean stress in a suspension of spherical particles subjected to bulk deformation.
Abstract: Two rigid spheres of radii a and b are immersed in infinite fluid whose velocity at infinity is a linear function of position. No external force or couple acts on the spheres, and the effect of inertia forces on the motion of the fluid and the spheres is neglected. The purpose of the paper is to provide a systematic and explicit description of those aspects of the interaction between the two spheres that are relevant in a calculation of the mean stress in a suspension of spherical particles subjected to bulk deformation. The most relevant aspects are the relative velocity of the two sphere centres (V) and the force dipole strengths of the two spheres (S′ij, S″ij), as functions of the vector r separating the two centres.It is shown that V, S′ij and S″ij depend linearly on the rate of strain at infinity and can be represented in terms of several scalar parameters which are functions of r/a and b/a alone. These scalar functions provide a framework for the expression of the many results previously obtained for particular linear ambient flows or for particular values of r/a or of b/a. Some new results are established for the asymptotic forms of the functions both for r/(a + b) [Gt ] 1 and for values of r − (a + b) small compared with a and b. A reasonably complete numerical description of the interaction of two rigid spheres of equal size is assembled, the main deficiency being accurate values of the scalar functions describing the force dipole strength of a sphere in the intermediate range of sphere separations.In the case of steady simple shearing motion at infinity, some of the trajectories of one sphere centre relative to another are closed, a fact which has consequences for the rheological problem. These closed forms are described analytically, and also numerically in the case b/a = 1.

697 citations

Proceedings ArticleDOI
14 Jun 2009
TL;DR: In this paper, the authors introduced two new related algorithms with better convergence rates: linear TD with gradient correction (TDC) and TDC with zero term update rule, which can be used for off-policy TD.
Abstract: Sutton, Szepesvari and Maei (2009) recently introduced the first temporal-difference learning algorithm compatible with both linear function approximation and off-policy training, and whose complexity scales only linearly in the size of the function approximator. Although their gradient temporal difference (GTD) algorithm converges reliably, it can be very slow compared to conventional linear TD (on on-policy problems where TD is convergent), calling into question its practical utility. In this paper we introduce two new related algorithms with better convergence rates. The first algorithm, GTD2, is derived and proved convergent just as GTD was, but uses a different objective function and converges significantly faster (but still not as fast as conventional TD). The second new algorithm, linear TD with gradient correction, or TDC, uses the same update rule as conventional TD except for an additional term which is initially zero. In our experiments on small test problems and in a Computer Go application with a million features, the learning rate of this algorithm was comparable to that of conventional TD. This algorithm appears to extend linear TD to off-policy learning with no penalty in performance while only doubling computational requirements.

605 citations


Network Information
Related Topics (5)
Matrix (mathematics)
105.5K papers, 1.9M citations
87% related
Nonlinear system
208.1K papers, 4M citations
84% related
Differential equation
88K papers, 2M citations
84% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Robustness (computer science)
94.7K papers, 1.6M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20221
202133
202050
201960
201839
201732