Research map / Learning theory and algorithms / Sample complexity
Learning Multiple Markov Chains via Adaptive Allocation
Mohammad Sadegh Talebi, Odalric-Ambrym Maillard
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 |
|---|---|---|---|
| Use optimistic index-based adaptive allocation | BAMC · Multiple ergodic Markov chains, asymptotic regime | n times loss: \limsup_{n\to\infty} nL_n(\mathcal{A}) = \Lambda | Improved |
Closest papers by meaning
- On Learning Markov Chains (NeurIPS 2018 · similarity 0.90)
- Infinity Learning: Learning Markov Chains from Aggregate Steady-State Observations (AAAI 2020 · similarity 0.90)
- Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms (NeurIPS 2024 · similarity 0.86)
- Online Markov Decision Processes Configuration with Continuous Decision Space (AAAI 2024 · similarity 0.86)
- Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups (ICML 2025 · similarity 0.86)
- Optimal Sample Complexity for Average Reward Markov Decision Processes (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.
