:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Peter, Chen, Xi
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence
Online Access:	https://arxiv.org/abs/2606.01708
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Neyman Allocation for Locally Minimax Optimal Best-Arm Identification
by: Kato, Masahiro
Published: (2024)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
by: Hou, Yunlong, et al.
Published: (2024)

Best-Arm Identification in Unimodal Bandits
by: Poiani, Riccardo, et al.
Published: (2024)

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

Fair Best Arm Identification with Fixed Confidence
by: Russo, Alessio, et al.
Published: (2024)

Constrained Best Arm Identification with Tests for Feasibility
by: Cai, Ting, et al.
Published: (2025)

Efficient Prompt Optimization Through the Lens of Best Arm Identification
by: Shi, Chengshuai, et al.
Published: (2024)

Optimal Multi-Objective Best Arm Identification with Fixed Confidence
by: Chen, Zhirui, et al.
Published: (2025)

Minimax Rates and Spectral Distillation for Tree Ensembles
by: Vu, Binh Duc, et al.
Published: (2026)

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

Best Arm Identification with Possibly Biased Offline Data
by: Yang, Le, et al.
Published: (2025)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)

Refining Minimax Regret for Unsupervised Environment Design
by: Beukman, Michael, et al.
Published: (2024)

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

Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition
by: Wang, Zichen, et al.
Published: (2025)

Fidelity-Aware Recommendation Explanations via Stochastic Path Integration
by: Barkan, Oren, et al.
Published: (2025)

CarBoN: Calibrated Best-of-N Sampling Improves Test-time Reasoning
by: Tang, Yung-Chen, et al.
Published: (2025)

Best-of-Tails: Bridging Optimism and Pessimism in Inference-Time Alignment
by: Hsu, Hsiang, et al.
Published: (2026)

On the Stability and Generalization of First-order Bilevel Minimax Optimization
by: Zhang, Xuelin, et al.
Published: (2026)

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

Adaptive Machine Learning-Driven Multi-Fidelity Stratified Sampling for Failure Analysis of Nonlinear Stochastic Systems
by: Xu, Liuyun, et al.
Published: (2025)

HBLLM: Wavelet-Enhanced High-Fidelity 1-Bit Quantization for LLMs
by: Chen, Ningning, et al.
Published: (2025)

Machine Learning based Enterprise Financial Audit Framework and High Risk Identification
by: Yuan, Tingyu, et al.
Published: (2025)

Best Agent Identification for General Game Playing
by: Stephenson, Matthew, et al.
Published: (2025)

Fidelity-Aware Data Composition for Robust Robot Generalization
by: Tong, Zizhao, et al.
Published: (2025)

Understanding Expert Structures on Minimax Parameter Estimation in Contaminated Mixture of Experts
by: Yan, Fanqi, et al.
Published: (2024)

On Statistical Rates of Conditional Diffusion Transformers: Approximation, Estimation and Minimax Optimality
by: Hu, Jerry Yao-Chieh, et al.
Published: (2024)

Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment
by: Huang, Audrey, et al.
Published: (2025)

Online Multi-modal Root Cause Identification in Microservice Systems
by: Zheng, Lecheng, et al.
Published: (2024)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Kernel Stochastic Configuration Networks for Nonlinear Regression
by: Chen, Yongxuan, et al.
Published: (2024)

Minimax Optimality and Spectral Routing for Majority-Vote Ensembles under Markov Dependence
by: Shihab, Ibne Farabi, et al.
Published: (2026)

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

Stochastic Q-learning for Large Discrete Action Spaces
by: Fourati, Fares, et al.
Published: (2024)

F-Fidelity: A Robust Framework for Faithfulness Evaluation of Explainable AI
by: Zheng, Xu, et al.
Published: (2024)

EnterpriseBench Corecraft: Training Generalizable Agents on High-Fidelity RL Environments
by: Mehta, Sushant, et al.
Published: (2026)

Two-Step Offline Preference-Based Reinforcement Learning with Constrained Actions
by: Xu, Yinglun, et al.
Published: (2023)

Identifying the Best Transition Law
by: Ahmadipour, Mehrasa, et al.
Published: (2025)

FastBO: Fast HPO and NAS with Adaptive Fidelity Identification
by: Jiang, Jiantong, et al.
Published: (2024)

Nonasymptotic CLT and Error Bounds for Two-Time-Scale Stochastic Approximation
by: Kong, Seo Taek, et al.
Published: (2025)