$\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Yinan, Nguyen, Tuan, Jun, Kwang-Sung
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
by: Balagopalan, Kapilan, et al.
Published: (2026)

HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search
by: Nguyen, Tuan Ngo, et al.
Published: (2024)

Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
by: Balagopalan, Kapilan, et al.
Published: (2024)

Second-Order Bounds for [0,1]-Valued Regression via Betting Loss
by: Li, Yinan, et al.
Published: (2025)

Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
by: Nguyen, Nicolas, et al.
Published: (2024)

Bandit Pareto Set Identification: the Fixed Budget Setting
by: Kone, Cyrille, et al.
Published: (2023)

Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence
by: Nonaga, Shunta, et al.
Published: (2025)

Fixed-Budget Constrained Best Arm Identification in Grouped Bandits
by: Mukherjee, Raunak, et al.
Published: (2026)

UCB Exploration for Fixed-Budget Bayesian Best Arm Identification
by: Zhu, Rong J. B., et al.
Published: (2024)

An Algorithm for Fixed Budget Best Arm Identification with Combinatorial Exploration
by: Parupudi, Siddhartha, et al.
Published: (2025)

Fixed-Budget Change Point Identification in Piecewise Constant Bandits
by: Lazzaro, Joseph, et al.
Published: (2025)

Efficient Monte Carlo Tree Search via On-the-Fly State-Conditioned Action Abstraction
by: Kwak, Yunhyeok, et al.
Published: (2024)

Best Arm Identification with Fixed Budget: A Large Deviation Perspective
by: Wang, Po-An, et al.
Published: (2023)

Epistemic Monte Carlo Tree Search
by: Oren, Yaniv, et al.
Published: (2022)

UNSAT Solver Synthesis via Monte Carlo Forest Search
by: Cameron, Chris, et al.
Published: (2022)

Entropic Risk-Aware Monte Carlo Tree Search
by: Santos, Pedro P., et al.
Published: (2026)

An Efficient Algorithm for Thresholding Monte Carlo Tree Search
by: Nameki, Shoma, et al.
Published: (2026)

Improving Monte Carlo Tree Search for Symbolic Regression
by: Huang, Zhengyao, et al.
Published: (2025)

Pure Exploration for Constrained Best Mixed Arm Identification with a Fixed Budget
by: Tang, Dengwang, et al.
Published: (2024)

Twice Sequential Monte Carlo for Tree Search
by: Oren, Yaniv, et al.
Published: (2025)

Monte Carlo Tree Search with Boltzmann Exploration
by: Painter, Michael, et al.
Published: (2024)

Doubly Robust Monte Carlo Tree Search
by: Liu, Manqing, et al.
Published: (2025)

Nearly Optimal Active Preference Learning and Its Application to LLM Alignment
by: Zhao, Yao, et al.
Published: (2026)

Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
by: Balagopalan, Kapilan, et al.
Published: (2024)

Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization
by: Jun, Kwang-Sung, et al.
Published: (2024)

What Are Good Positional Encodings for Directed Graphs?
by: Huang, Yinan, et al.
Published: (2024)

Fixed-Budget Differentially Private Best Arm Identification
by: Chen, Zhirui, et al.
Published: (2024)

On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits
by: Maiti, Arnab, et al.
Published: (2026)

Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
by: Miyamoto, Sora, et al.
Published: (2026)

Anytime Sequential Halving in Monte-Carlo Tree Search
by: Sagers, Dominic, et al.
Published: (2024)

Monte Carlo Tree Search in the Presence of Transition Uncertainty
by: Kohankhaki, Farnaz, et al.
Published: (2023)

Improving GFlowNets with Monte Carlo Tree Search
by: Morozov, Nikita, et al.
Published: (2024)

Monte Carlo Permutation Search
by: Cazenave, Tristan
Published: (2025)

Enhancing Bayesian Network Structural Learning with Monte Carlo Tree Search
by: Laborda, Jorge D., et al.
Published: (2025)

Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
by: Bian, Jie, et al.
Published: (2025)

C-MCTS: Safe Planning with Monte Carlo Tree Search
by: Parthasarathy, Dinesh, et al.
Published: (2023)

Variance-Aware Prior-Based Tree Policies for Monte Carlo Tree Search
by: Weichart, Maximilian
Published: (2025)

Enhancing Reasoning through Process Supervision with Monte Carlo Tree Search
by: Li, Shuangtao, et al.
Published: (2025)

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
by: Jang, Kyoungseok, et al.
Published: (2024)

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
by: Qin, Hao, et al.
Published: (2023)