AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Feedback-Based Tree Search for Reinforcement Learning

ICML 2018 · Reinforcement learning › MDPs and planning · approach: Average-reward and regularized MDPs · 8 citations (OpenAlex)

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 feedback-based tree search instead of direct policy iterationKing of Glory 1v1 · Six marksman opponentsframes to defeatHelped
Use feedback-based tree search instead of approximate value iterationKing of Glory 1v1 · Six marksman opponentsframes to defeatHelped
Use feedback-based tree search instead of supervised learning on human gameplayKing of Glory 1v1 · Six marksman opponentsframes to defeatHelped
Use feedback-based tree search instead of the internal DiRenJie AIKing of Glory 1v1 · Six marksman opponentsframes to defeatHelped
Add partial policy rollouts to tree-search leaf evaluation (ablation)FBTS · King of Glory 1v1, common opponentsframes to defeatHelped
Use feedback-based tree search instead of no-rollout tree searchKing of Glory 1v1 · Head-to-head against four baselinesgold ratio: 1.25 to 1.75Helped

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