Research map / Probabilistic and scientific modeling / Variational and generative sampling
On Learning Markov Chains
Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati
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 |
|---|---|---|---|
| Use add-√N_i/k smoothing instead of add-one smoothing | L2 transition-matrix estimation · Simulated Markov chains; varying sample size n | L2 estimation loss | Improved |
| Use add-√N_i/k smoothing instead of add-constant smoothing with constants 2 to 10 | L2 transition-matrix estimation · Simulated Markov chains | L2 estimation loss | Improved |
Closest papers by meaning
- Learning Multiple Markov Chains via Adaptive Allocation (NeurIPS 2019 · similarity 0.90)
- Optimal prediction of Markov chains with and without spectral gap (NeurIPS 2021 · similarity 0.89)
- Estimation of Markov Chain via Rank-Constrained Likelihood (ICML 2018 · similarity 0.88)
- Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood (NeurIPS 2024 · similarity 0.85)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.85)
- Chain of Log-Concave Markov Chains (ICLR 2024 · similarity 0.85)
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.
