arXiv Machine Learning June 2, 2026 By Pu Wang, Yao-Xiang Ding

Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling Bandits

Read the original on arXiv Machine Learning →

arXiv:2606. 01799v1 Announce Type: new Abstract: We study $N$-armed stochastic dueling bandits under the Condorcet-winner assumption, where three widely adopted objectives are considered: best-arm identification (BAI), weak regret, and strong regret.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 16

Best Arm Identification with Minimal Regret

arXiv:2409. 18909v2 Announce Type: replace Abstract: Motivated by real-world applications that necessitate responsible experimentation, we introduce the problem of best arm identification (BAI) with minimal regret.

By Junwen Yang, Vincent Y. F. Tan, Tianyuan Jin

agents reinforcement-learning

arXiv Machine Learning

Jun 9

Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees

arXiv:2606. 09002v1 Announce Type: cross Abstract: We study a stochastic multi-armed bandit problem in which the set of available arms expands over time.

By Deqi Zheng, Xiaoyang Xu, Yuhong Yang

reinforcement-learning benchmarks

arXiv Machine Learning

2d ago

Rising Multi-Armed Bandits with Known Horizons

arXiv:2602.10727v3 Announce Type: replace Abstract: Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such proble...

By Seockbean Song, Chenyu Gan, Youngsik Yoon, Siwei Wang, Wei Chen, Jungseul Ok

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 16

Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare

arXiv:2605. 01961v2 Announce Type: replace Abstract: Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents.

By Maheed H. Ahmed, Mahsa Ghasemi

llms agents reinforcement-learning fine-tuning safety

arXiv Machine Learning

Jul 13

Optimal Top-$k$ Identification from Pairwise Comparisons

arXiv:2607. 08979v1 Announce Type: new Abstract: We study the active learning problem of fixed-confidence top-$k$ identification from noisy pairwise comparisons.

By Motti Goldberger, Nils Rudi

reinforcement-learning

arXiv Machine Learning

Jun 29

Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits

arXiv:2602. 09456v2 Announce Type: replace Abstract: We propose an algorithmic framework, Offline Estimation to Decisions (OE2D), that efficiently reduces contextual bandit learning with general reward function approximation to offline regression.

By Hao Qin, Chicheng Zhang

reinforcement-learning

One email a morning, machine-written

Related stories

Best Arm Identification with Minimal Regret

Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees

Rising Multi-Armed Bandits with Known Horizons

Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare

Optimal Top-$k$ Identification from Pairwise Comparisons

Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits