Research map / Optimization / Nonconvex and smooth optimization
Statistical and Computational Guarantees for the Baum-Welch Algorithm
Fanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| lower the signal-to-noise ratio of the two-state Gaussian HMM | Baum-Welch · Simulated two-state Gaussian HMM (d=10, n=1000) | convergence rate of estimation error | Hurt |
| use different random initializations around the true mean | Baum-Welch · Simulated two-state Gaussian HMM (SNR 1.5, zeta 0.2) | final estimate and distance to true parameter | No clear effect |
Closest papers by meaning
- Frontiers to the learning of nonparametric hidden Markov models (JMLR 2025 · similarity 0.87)
- A Spectral Algorithm for Inference in Hidden semi-Markov Models (JMLR 2017 · similarity 0.87)
- Minimax Adaptive Estimation of Nonparametric Hidden Markov Models (JMLR 2016 · similarity 0.86)
- Determine the Number of States in Hidden Markov Models via Marginal Likelihood (JMLR 2025 · similarity 0.86)
- Sampling from Binary Quadratic Distributions via Stochastic Localization (ICML 2025 · similarity 0.85)
- Near-Optimality of Contrastive Divergence Algorithms (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
