regret minimization

Best Arm Identification with Minimal Regret JMLR 2026 Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits AAAI 2026 Blackwell Approachability and Gradient Equilibrium are Equivalent COLT 2026 Calibeating Made Simple COLT 2026 Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries UAI 2026 Robust Decision-Focused Learning via Worst-Case Regret Minimization UAI 2026 Augmenting Online RL with Offline Data is All You Need: A Unified Hybrid RL Algorithm Design and Analysis UAI 2025 Best of Both Worlds: Regret Minimization versus Minimax Play ICML 2025 Beyond Numeric Rewards: In-Context Dueling Bandits with LLM Agents ACL 2025 Cost-Aware Optimal Pairwise Pure Exploration AISTATS 2025 Enabling Realtime Reinforcement Learning at Scale with Staggered Asynchronous Inference ICLR 2025 Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents AISTATS 2025 Finally Rank-Breaking Conquers MNL Bandits: Optimal and Efficient Algorithms for MNL Assortment ICLR 2025 Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification AAAI 2025 Logarithmic regret of exploration in average reward Markov decision processes COLT 2025 Marginal Benefit Driven RL Teacher for Unsupervised Environment Design AAAI 2025 Optimal Zero-shot Regret Minimization for Selective Classification with Out-of-Distribution Detection UAI 2025 Optimistic Q-learning for average reward and episodic reinforcement learning extended abstract COLT 2025 Optimization Over a Probability Simplex JMLR 2025 Optimizing Test-Time Compute via Meta Reinforcement Finetuning ICML 2025 p-Mean Regret for Stochastic Bandits AAAI 2025 Pure Exploration with Feedback Graphs AISTATS 2025 Reinforced In-Context Black-Box Optimization IJCAI 2025 Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits AISTATS 2025 Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms AISTATS 2025