dynamic regret

Dynamic Regret of Online Markov Decision Processes ICML 2022 Efficient Methods for Non-stationary Online Learning NeurIPS 2022 Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information L4DC 2022 Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments NeurIPS 2022 Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022 No-Regret Learning in Time-Varying Zero-Sum Games ICML 2022 Online Continual Adaptation with Active Self-Training AISTATS 2022 Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022 Optimal Dynamic Regret in LQR Control NeurIPS 2022 Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond AISTATS 2022 Parameter-free Mirror Descent COLT 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 Tracking Most Significant Arm Switches in Bandits COLT 2022 A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021 Near-Optimal Model-Free Reinforcement Learning in Non-Stationary Episodic MDPs ICML 2021 Non-stationary Reinforcement Learning without Prior Knowledge: an Optimal Black-box Approach COLT 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems NeurIPS 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021