regret bound

uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs ICLR 2025 Universal Online Convex Optimization Meets Second-order Bounds JMLR 2025 Variance-Dependent Regret Bounds for Nonstationary Linear Bandits AISTATS 2025 Wasserstein Distributionally Robust Bayesian Optimization with Continuous Context AISTATS 2025 Weak-to-Strong Generalization Through the Data-Centric Lens ICLR 2025 When and why randomised exploration works (in linear bandits) ALT 2025 A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent AISTATS 2024 A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays NeurIPS 2024 A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning ICLR 2024 Accurate Parameter Estimation for Safety-Critical Systems with Unmodeled Dynamics (Abstract Reprint) AAAI 2024 Achieving Õ(1/ε) Sample Complexity for Constrained Markov Decision Process NeurIPS 2024 Achieving Fairness in Multi-Agent MDP Using Reinforcement Learning ICLR 2024 Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NeurIPS 2024 Active Set Ordering NeurIPS 2024 Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds COLT 2024 Adaptive online non-stochastic control L4DC 2024 Adaptive Regret for Bandits Made Possible: Two Queries Suffice ICLR 2024 A deep learning approach for distributed aggregative optimization with users’ Feedback L4DC 2024 A Discretization Framework for Robust Contextual Stochastic Optimization ICLR 2024 Adversarial Causal Bayesian Optimization ICLR 2024 Adversarial Contextual Bandits Go Kernelized ALT 2024 Adversarial Online Learning with Temporal Feedback Graphs COLT 2024 Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits NeurIPS 2024 An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints NeurIPS 2024 A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NeurIPS 2024