AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of MDPs

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 TrailBlazer (adaptive tree-based sampling that refines only a few paths and forgets extra samples after MAX-node choice) instead of uniform/UCT-style samplingMonte-Carlo planning with generative model · MDPs with finite N next statessample complexity exponent of 1/epsilonHelped
Use TrailBlazer in MDPs with infinite next states (N = ∞) when the problem-difficulty measure d is zero (non-vanishing action gaps)TrailBlazer · MDPs with N = ∞sample complexity order in 1/epsilonHelped
Apply TrailBlazer in the evaluation case without control (K = 1)TrailBlazer · MDPs with K = 1 (Monte-Carlo evaluation)sample complexity orderNo clear effect
Replace the sampled-node history with only the first m samples (forgetting extra AVG samples drawn due to MAX nodes)TrailBlazer AVG nodes · theoretical designsample complexityHelped

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