regret bound

Online Learning in the Random-Order Model ICML 2025 Online Learning with Stochastically Partitioning Experts UAI 2025 Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025 Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting AAAI 2025 Online Quantile Regression JMLR 2025 On Preference-based Stochastic Linear Contextual Bandits with Knapsacks AISTATS 2025 On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime ICLR 2025 On the Power of Optimism in Constrained Online Convex Optimization IJCAI 2025 Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025 Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints AISTATS 2025 Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness AISTATS 2025 Order-Optimal Regret with Novel Policy Gradient Approaches in Infinite-Horizon Average Reward MDPs AISTATS 2025 Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy ICLR 2025 p-Mean Regret for Stochastic Bandits AAAI 2025 Position: Constants are Critical in Regret Bounds for Reinforcement Learning ICML 2025 Principal-Agent Bandit Games with Self-Interested and Exploratory Learning Agents ICML 2025 Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions IJCAI 2025 Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces UAI 2025 Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces ICML 2025 Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes ICML 2025 Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback IJCAI 2025 Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator ICLR 2025 Regret Bounds for Robust Online Decision Making COLT 2025 Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds ICLR 2025 Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs AISTATS 2025