Bounds on approximate steepest descent for likelihood maximization in exponential families
Authors:
- N. Cesa-BianchiNCN. Cesa-Bianchi
- A. KroghAKA. Krogh
- M.K. WarmuthMWM.K. Warmuth
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (4) , 1215-1218
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximation of Density Functions by Sequences of Exponential FamiliesThe Annals of Statistics, 1991
- On-line learning of linear functions1991
- Exponential Models, Maximum Likelihood Estimation, and the Haar ConditionJournal of the American Statistical Association, 1976
- $I$-Divergence Geometry of Probability Distributions and Minimization ProblemsThe Annals of Probability, 1975