conftrace_

adaptive regret

19 papers

Explore in graph

Co-occurring keywords

online learning (1777) online convex optimization (165) dynamic regret (94) sublinear regret (88) regret bound (1926) convex optimization (1321) dynamic environment (37) strongly convex function (31) online algorithm (445) gradient descent (1144)

Papers

Efficient Methods for Non-stationary Online Learning JMLR 2025
Multi-model Ensemble Conformal Prediction in Dynamic Environments NIPS 2024
Online Non-convex Learning in Dynamic Environments NIPS 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees AAAI 2024
Projection-free Adaptive Regret with Membership Oracles ALT 2023
Adaptive Regret for Control of Time-Varying Dynamics L4DC 2023
Damped Online Newton Step for Portfolio Selection COLT 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NIPS 2022
Efficient Methods for Non-stationary Online Learning NIPS 2022
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions NIPS 2021
Self-Tuning Bandits over Unknown Covariate-Shifts ALT 2021
Minimizing Dynamic Regret and Adaptive Regret Simultaneously AISTATS 2020
Online Learning in Changing Environments IJCAI 2020
Adaptive Regret of Convex and Smooth Functions ICML 2019
User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NIPS 2019
Online Adaptive Principal Component Analysis and Its extensions ICML 2019
Dynamic Regret of Strongly Adaptive Methods ICML 2018
Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018
A Closer Look at Adaptive Regret JMLR 2016