Research map / Learning theory and algorithms / Sample complexity
Optimal prediction of Markov chains with and without spectral gap
Yanjun Han, Soham Jana, Yihong Wu
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 |
|---|---|---|---|
| Increase the binary-chain absolute spectral-gap lower bound | Binary-chain prediction · Binary chains with prescribed absolute spectral gap | minimax prediction risk (KL): (1/n) max{1, log log(min{n, 1/γ0})} | Improved |
Closest papers by meaning
- Conformal Predictions under Markovian Data (ICML 2024 · similarity 0.86)
- Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups (ICML 2025 · similarity 0.85)
- The Power of Second Order Methods for Sequence Preconditioning (NeurIPS 2026 · similarity 0.85)
- Universal Sequence Preconditioning (NeurIPS 2025 · similarity 0.85)
- Two-timescale Derivative Free Optimization for Performative Prediction with Markovian Data (ICML 2024 · similarity 0.84)
- Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood (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.
