Asymptotically efficient recursive estimation for incomplete data models using the observed information.
From MaRDI portal
Publication:5953726
DOI10.1007/BF02742868zbMath1093.62523MaRDI QIDQ5953726
Publication date: 29 January 2002
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/176757
Related Items (2)
On recursive estimation for hidden Markov models ⋮ On Recursive Estimation in Incomplete Data Models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The local asymptotic minimax adaptive property of a recursive estimate
- Almost sure approximations to the Robbins-Monro and Kiefer-Wolfowitz processes with dependent noise
- On asymptotically efficient recursive estimation
- Stochastic approximation methods for constrained and unconstrained systems
- Strong convergence of a stochastic approximation algorithm
- Strong representation of an adaptive stochastic approximation procedure
- Some examples and results in the theory of mixing and random-sum central limit theorems
- Recursive estimation of quantitles using recursive kernel density estimators
- Estimation of mixing probabilities in multiclass finite mixtures
- Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure
- Asymptotically efficient estimation of prior probabilities in multiclass finite mixtures
- Recursive estimation in mixture models with Markov regime
- Acceleration of Stochastic Approximation by Averaging
- Recursive estimation of prior probabilities using a mixture
- On the efficiency of on-line density estimators
- A Sharper Form of the Borel-Cantelli Lemma and the Strong Law
- Information matrix for a mixture of two normal distributions
- A limit theorem for the Robbins-Monro approximation
This page was built for publication: Asymptotically efficient recursive estimation for incomplete data models using the observed information.
