AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Multiple Markov Chains via Adaptive Allocation

Mohammad Sadegh Talebi, Odalric-Ambrym Maillard

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of MDPs · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use optimistic index-based adaptive allocationBAMC · Multiple ergodic Markov chains, asymptotic regimen times loss: \limsup_{n\to\infty} nL_n(\mathcal{A}) = \LambdaImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy