AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Monte-Carlo Tree Search in Continuous Action Spaces with Value Gradients

Jongmin Lee, Wonseok Jeon, Geon-Hyeong Kim, Kee-Eung Kim

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Monte Carlo tree search · 21 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
add value-gradient ascent fine-tuning of action particles to UCT (ablation)UCT with progressive widening · Pendulum, Acrobot, Reacher, Pusher (stochastic)cumulative rewardImproved
add value-gradient ascent to KR-UCT (ablation)KR-UCT · continuous control benchmarkscumulative rewardImproved
add kernel regression information sharing (KR-UCT) to UCTUCT · continuous control benchmarkscumulative rewardNo clear effect
use VG-UCT instead of UCT as policy improvement operator for policy networkMCTS-guided policy learning · four control taskscumulative rewardImproved
combine UCT global search with gradient ascent vs gradient-only (Grad-MPC) from random actionsGrad-MPC · 2D illustrative examplereaching goalImproved
central difference instead of forward difference for value gradient (ablation)VG-UCT · footnotecumulative rewardNo clear effect

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