conftrace_

dynamic regret

94 papers

Explore in graph

Co-occurring keywords

online learning (1777) online convex optimization (165) regret bound (1926) non-stationary environment (61) online algorithm (445) convex optimization (1321) adaptive regret (19) multi-armed bandit (1098) online gradient descent (39) policy optimization (657)

Papers

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization ALT 2026
Label Shift Meets Online Learning: Ensuring Consistent Adaptation with Universal Dynamic Regret CVPR 2025
On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning ICML 2025
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint AAAI 2025
Efficient Methods for Non-stationary Online Learning JMLR 2025
Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization JMLR 2024
Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation AAAI 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NIPS 2024
Percentile Risk-Constrained Budget Pacing for Guaranteed Display Advertising in Online Optimization AAAI 2024
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously NIPS 2024
Online Learning of Partitions in Additively Separable Hedonic Games IJCAI 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees AAAI 2024
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization JMLR 2024
Online Non-convex Learning in Dynamic Environments NIPS 2024
An Equivalence Between Static and Dynamic Regret Minimization NIPS 2024
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits JMLR 2023
Non-stationary Reinforcement Learning under General Function Approximation ICML 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits AISTATS 2023
Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms NIPS 2023
Unconstrained Online Learning with Unbounded Losses ICML 2023
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023
Provably Efficient Primal-Dual Reinforcement Learning for CMDPs with Non-stationary Objectives and Constraints AAAI 2023
Online Non-stochastic Control with Partial Feedback JMLR 2023
Second Order Path Variationals in Non-Stationary Online Learning AISTATS 2023