regret bound

Explore, Refine, then Commit: Nearly Optimal Multi-Group Mean Estimation with Active Learning UAI 2026 Extreme Value Monte Carlo Tree Search for Classical Planning AAAI 2026 Fast Best-in-Class Regret for Contextual Bandits UAI 2026 Federated Combinatorial Causal Bandits with Heterogeneous Causal Influences UAI 2026 Federated Linear Dueling Bandits AAAI 2026 Finite-Sample Regret Analysis of Nash Q-Learning with Random-Feature Approximation UAI 2026 Flickering Multi-Armed Bandits L4DC 2026 Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: √T-Regret L4DC 2026 Gradient-Variation Regret Bounds for Unconstrained Online Learning COLT 2026 Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference UAI 2026 How to Set β_1, β_2 in Adam: An Online Learning Perspective ALT 2026 Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy ALT 2026 Learning-based Optimal Admission Control for Erlang-B Queuing Systems UAI 2026 Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs COLT 2026 Leveraging Similarities in Multi-Armed Bandits COLT 2026 Mixture-Greedy for Online Generative Model Selection: Is UCB Necessary in Diversity-Aware Multi-Armed Bandits? UAI 2026 Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing AAAI 2026 Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach COLT 2026 Neural Exploitation and Exploration of Contextual Bandits JMLR 2026 Omniprediction with Long-Term Constraints COLT 2026 Online Caching in Tree Networks: Algorithms, Regret, and Complexity L4DC 2026 Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications ALT 2026 Online Convex Optimization with Sublinear Noisy Probes COLT 2026 Online Learning and Coverage of Unknown Fields Using Random-Feature Gaussian Processes L4DC 2026 Online Linear Regression with Paid Stochastic Features AAAI 2026