Skip to content
conftrace_

regret bound

2,284 papers

RB

Papers

Towards Achieving Sub-linear Regret and Hard Constraint Violation in Model-free RL AISTATS 2024 Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits NeurIPS 2024 Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback ICLR 2024 Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization ICLR 2024 Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning NeurIPS 2024 Universal Online Convex Optimization with $1$ Projection per Round NeurIPS 2024 Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits ICLR 2024 Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NeurIPS 2024 When Is Inductive Inference Possible? NeurIPS 2024 $O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games ICLR 2023 A Batch-to-Online Transformation under Random-Order Model NeurIPS 2023 A Blackbox Approach to Best of Both Worlds in Bandits and Beyond COLT 2023 Achieving Sub-linear Regret in Infinite Horizon Average Reward Constrained MDP with Linear Function Approximation ICLR 2023 A CMDP-within-online framework for Meta-Safe Reinforcement Learning ICLR 2023 Adaptation to the Range in K-Armed Bandits JMLR 2023 Adaptive Selective Sampling for Online Prediction with Experts NeurIPS 2023 A Distribution Optimization Framework for Confidence Bounds of Risk Measures ICML 2023 Adversarial Attacks on Adversarial Bandits ICLR 2023 Adversarial Online Multi-Task Reinforcement Learning ALT 2023 A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023 A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning ICLR 2023 A General Regret Bound of Preconditioned Gradient Method for DNN Training CVPR 2023 Allocating Divisible Resources on Arms with Unknown and Random Rewards COLT 2023 Alternation makes the adversary weaker in two-player games NeurIPS 2023 A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints ICML 2023