Skip to main content
Technical Reports
Navigation
Technical Reports
UCSC-CRL-92-38: BOUNDS ON APPROXIMATE STEEPEST DESCENT FOR LIKELIHOOD MAXIMIZATION IN EXPONENTIAL FAMILIES
« Previous
Next »
Authors
Published On
10/01/1992 09:00 AM
Department
Computer Science
Abstract
An approximate steepest descent strategy converging, in families of regular exponential densities, to maximum likelihood estimates of density functions is described. These density estimates are also obtained by an application of the principle of minimum relative entropy subject to empirical constraints. We prove tight bounds on the increase of the log-likelihood at each iteration of our strategy for families of exponential densities whose log-densities are spanned by a set of bounded basis functions.
Download
UCSC-CRL-92-38
Error | Technical Reports
Technical Reports
Error
The website encountered an unexpected error. Please try again later.