Cover Image

A Regret Perspective on Online Multiple Testing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hao, Qingyang, Zhou, Kongchang, Kong, Fang, Wei, Hongxin
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Data-Driven Online Model Selection With Regret Guarantees
by: Pacchiano, Aldo, et al.
Published: (2023)

Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms
by: Zhou, Kongchang, et al.
Published: (2025)

Provable Training Data Identification for Large Language Models
by: Liu, Zhenlong, et al.
Published: (2025)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

How does Bayesian Sampling help Membership Inference Attacks?
by: Liu, Zhenlong, et al.
Published: (2025)

RACER: Risk-Aware Calibrated Efficient Routing for Large Language Models
by: Hao, Sai, et al.
Published: (2026)

Analytic Continual Test-Time Adaptation for Multi-Modality Corruption
by: Zhang, Yufei, et al.
Published: (2024)

Defending Membership Inference Attacks via Privacy-aware Sparsity Tuning
by: Hu, Qiang, et al.
Published: (2024)

T-POP: Test-Time Personalization with Online Preference Feedback
by: Qu, Zikun, et al.
Published: (2025)

RoBoN: Routed Online Best-of-n for Test-Time Scaling with Multiple LLMs
by: Geuter, Jonathan, et al.
Published: (2025)

Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds
by: Liang, Hao, et al.
Published: (2022)

Online Learning with Multiple Fairness Regularizers via Graph-Structured Feedback
by: Zhou, Quan, et al.
Published: (2025)

Reasoning without Regret
by: Chitra, Tarun
Published: (2025)

Efficient Skill Discovery via Regret-Aware Optimization
by: Zhang, He, et al.
Published: (2025)

Towards Reward Fairness in RLHF: From a Resource Allocation Perspective
by: Ouyang, Sheng, et al.
Published: (2025)

HyPAC: Cost-Efficient LLMs-Human Hybrid Annotation with PAC Error Guarantees
by: Zeng, Hao, et al.
Published: (2026)

Model-agnostic Selective Labeling with Provable Statistical Guarantees
by: Huang, Huipeng, et al.
Published: (2025)

The Good, the Bad, and the Sampled: a No-Regret Approach to Safe Online Classification
by: Baharav, Tavor Z., et al.
Published: (2025)

No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery
by: Rutherford, Alexander, et al.
Published: (2024)

On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective
by: Zhou, Zhi, et al.
Published: (2026)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

Your Pre-trained LLM is Secretly an Unsupervised Confidence Calibrator
by: Luo, Beier, et al.
Published: (2025)

On the Provable Performance Guarantee of Efficient Reasoning Models
by: Zeng, Hao, et al.
Published: (2025)

Regret-Guided Search Control for Efficient Learning in AlphaZero
by: Tsai, Yun-Jui, et al.
Published: (2026)

Response-Level Rewards Are All You Need for Online Reinforcement Learning in LLMs: A Mathematical Perspective
by: He, Shenghua, et al.
Published: (2025)

Android Coach: Improve Online Agentic Training Efficiency with Single State Multiple Actions
by: Gan, Guo, et al.
Published: (2026)

No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)

Regret-Free Reinforcement Learning for LTL Specifications
by: Majumdar, Rupak, et al.
Published: (2024)

Regret-Based Defense in Adversarial Reinforcement Learning
by: Belaire, Roman, et al.
Published: (2023)

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

Rethinking the Sampling Criteria in Reinforcement Learning for LLM Reasoning: A Competence-Difficulty Alignment Perspective
by: Kong, Deyang, et al.
Published: (2025)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

Unveiling Statistical Significance of Online Regression over Multiple Datasets
by: Abu-Shaira, Mohammad, et al.
Published: (2025)

Super-Exponential Regret for UCT, AlphaGo and Variants
by: Orseau, Laurent, et al.
Published: (2024)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)

Regret-Based Federated Causal Discovery with Unknown Interventions
by: Baldo, Federico, et al.
Published: (2025)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023)

Provably Efficient Exploration in Reward Machines with Low Regret
by: Bourel, Hippolyte, et al.
Published: (2024)

Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making
by: Liu, Larkin, et al.
Published: (2025)

Missing Data Multiple Imputation for Tabular Q-Learning in Online RL
by: Chasalow, Kyla, et al.
Published: (2025)