Hugging Face Trending Papers June 1, 2026

Two-Fidelity Best-Action Identification for Stochastic Minimax Tree

Read the original on Hugging Face Trending Papers →

We study fixed-confidence best-action identification (BAI) in stochastic minimax trees. This problem is increasingly relevant in modern AI planning, where deep minimax search and Monte Carlo Tree Search (MCTS) with language model long rollouts face a fundamental tradeoff: heuristic evaluations are cheap but biased, while accurate rollouts are reliable but prohibitively expensive.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv AI

Jun 2

Two-Fidelity Best-Action Identification for Stochastic Minimax Tree

arXiv:2606. 01708v1 Announce Type: cross Abstract: We study fixed-confidence best-action identification (BAI) in stochastic minimax trees.

By Peter Chen, Xi Chen

llms reinforcement-learning

arXiv AI

Aug 5

In-Context Pure Exploration in Continuous Decision Spaces

arXiv:2602. 17976v2 Announce Type: replace-cross Abstract: In active sequential testing, also termed pure exploration, a learner is tasked with the goal to adaptively acquire information so as to identify an unknown ground-truth hypothesis with as few queries as possible.

By Alessio Russo, Yin-Ching Lee, Ryan Welch, Aldo Pacchiano

reinforcement-learning

arXiv Machine Learning

Jun 2

Off-Policy Learning in Large Action Spaces: Optimization Matters More Than Estimation

arXiv:2509. 03456v2 Announce Type: replace-cross Abstract: Off-policy evaluation (OPE) and off-policy learning (OPL) are foundational for decision-making in offline contextual bandits.

By Imad Aouali, Otmane Sakhi

arXiv Machine Learning

Jul 31

On-Policy and Off-Policy Learning for Large Action Spaces

arXiv:2607. 28408v1 Announce Type: new Abstract: This thesis studies policy learning in interactive systems where an agent observes a context, selects an action from a very large set, and receives partial feedback.

By Imad Aouali

agents diffusion safety

arXiv AI

Jun 10

3SPO: State-Score-Supervised Policy Optimization for LLM Agents

arXiv:2606. 09961v1 Announce Type: cross Abstract: Training large language models (LLMs) as autonomous agents via reinforcement learning (RL) has enabled frontier models to achieve superhuman performance in long-horizon tasks.

By Yu Han, Kailing Li, Yang Jiao, Yulin Dai, Yuqian Fu, Linhai Zhuo, Tianwen Qian

llms agents reinforcement-learning

arXiv Machine Learning

Jun 2

Bandit Simulation for Average Reward Inference

arXiv:2606. 00913v1 Announce Type: cross Abstract: Multi-arm bandit algorithms are increasingly used in online platforms, clinical trials, and social science experiments, but valid statistical inference on their performance remains an open challenge.

By Samya Praharaj, Chih-Yu Chang, Koulik Khamaru, Kelly W. Zhang

reinforcement-learning

Related stories

Two-Fidelity Best-Action Identification for Stochastic Minimax Tree

In-Context Pure Exploration in Continuous Decision Spaces

Off-Policy Learning in Large Action Spaces: Optimization Matters More Than Estimation

On-Policy and Off-Policy Learning for Large Action Spaces

3SPO: State-Score-Supervised Policy Optimization for LLM Agents

Bandit Simulation for Average Reward Inference