Almost sure convergence of Titterington's recursive estimator for mixture models
From MaRDI portal
Publication:866603
DOI10.1016/j.spl.2006.05.017zbMath1104.62022OpenAlexW1991363287MaRDI QIDQ866603
Publication date: 14 February 2007
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2006.05.017
stochastic approximationincomplete dataalmost sure convergencemixture modelrecursive estimationregular exponential family
Asymptotic properties of parametric estimators (62F12) Strong limit theorems (60F15) Sequential estimation (62L12)
Related Items
On-Line Expectation–Maximization Algorithm for latent Data Models, Recursive estimators with Markovian jumps, Robust identification of linear ARX models with recursive EM algorithm based on Student's t-distribution, Fast online graph clustering via Erdős-Rényi mixture, Posterior Weighted Reinforcement Learning with State Uncertainty, On-line EM variants for multivariate normal mixture model in background learning and moving foreground detection, Recursive online EM estimation of mixture autoregressions, Strategies for online inference of model-based clustering in large and growing networks, Online identification of time‐delay jump Markov autoregressive exogenous systems with recursive expectation‐maximization algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of stochastic-approximation procedures in the case of regression equation with several roots
- On asymptotically efficient recursive estimation
- Stochastic approximation methods for constrained and unconstrained systems
- Sequential methods in pattern recognition and machine learning
- Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure
- General results on the convergence of stochastic algorithms
- A Stochastic Approximation Method