Bounds on approximate steepest descent for likelihood maximization in exponential families.
Nicolò Cesa-BianchiAnders KroghManfred K. WarmuthPublished in: IEEE Trans. Inf. Theory (1994)
Keyphrases
- exponential family
- likelihood maximization
- em algorithm
- expectation maximization
- maximum likelihood
- graphical models
- mixture model
- chain graphs
- log likelihood
- upper bound
- lower bound
- density estimation
- closed form
- missing values
- statistical models
- probability density function
- bayesian networks
- computer vision
- hidden variables
- markov networks
- probabilistic model
- belief propagation
- bayesian framework
- optic flow
- generative model
- order statistics
- k means