:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Nameki, Shoma, Nakamura, Atsuyoshi, Komiyama, Junpei, Tabata, Koji
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2601.22600
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
by: Komiyama, Junpei
Published: (2022)

High-dimensional Contextual Bandit Problem without Sparsity
by: Komiyama, Junpei, et al.
Published: (2023)

Multiple Wasserstein Gradient Descent Algorithm for Multi-Objective Distributional Optimization
by: Nguyen, Dai Hai, et al.
Published: (2025)

Rate-optimal Design for Anytime Best Arm Identification
by: Komiyama, Junpei, et al.
Published: (2025)

Fixed Confidence Best Arm Identification in the Bayesian Setting
by: Jang, Kyoungseok, et al.
Published: (2024)

High-dimensional Nonparametric Contextual Bandit Problem
by: Iwazaki, Shogo, et al.
Published: (2025)

Best-of-$\infty$ -- Asymptotic Performance of Test-Time LLM Ensembling
by: Komiyama, Junpei, et al.
Published: (2025)

Finite-Time Regret Analysis of Retry-Aware Bandits
by: Tong, Bingkui, et al.
Published: (2026)

Replicability is Asymptotically Free in Multi-armed Bandits
by: Komiyama, Junpei, et al.
Published: (2024)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Long-term Detection System for Six Kinds of Abnormal Behavior of the Elderly Living Alone
by: Tanaka, Kai, et al.
Published: (2024)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

Reliable Chain-of-Thought via Prefix Consistency
by: Iwase, Naoto, et al.
Published: (2026)

Accelerated Multiple Wasserstein Gradient Flows for Multi-objective Distributional Optimization
by: Nguyen, Dai Hai, et al.
Published: (2026)

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

CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency
by: Ota, Hirofumi, et al.
Published: (2026)

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search
by: Kim, Sungyoon, et al.
Published: (2025)

Searching Efficient Deep Architectures for Radar Target Detection using Monte-Carlo Tree Search
by: Lallouet, Noé, et al.
Published: (2025)

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

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

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)

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

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

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)

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

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

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

Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization
by: Schramm, Liam, et al.
Published: (2024)

Continuous Monte Carlo Graph Search
by: Kujanpää, Kalle, et al.
Published: (2022)

$\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search
by: Li, Yinan, et al.
Published: (2026)

High-Order Langevin Monte Carlo Algorithms
by: Dang, Thanh, et al.
Published: (2025)

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

NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search
by: Tang, Sizhe, et al.
Published: (2026)

PMCTS: Particle Monte Carlo Tree Search for Principled Parallelized Inference Time Scaling
by: Oren, Yaniv, et al.
Published: (2026)

Optimizing Prompt Sequences using Monte Carlo Tree Search for LLM-Based Optimization
by: Yu, Fei Xu, et al.
Published: (2025)

Regime-Switching Langevin Monte Carlo Algorithms
by: Wang, Xiaoyu, et al.
Published: (2025)