conftrace_

online convex optimization

165 papers

Explore in graph

Also known as

OCO

Co-occurring keywords

regret bound (1926) online learning (1777) dynamic regret (94) regret minimization (315) constraint violation (39) stochastic optimization (1060) gradient descent (1144) strongly convex (89) bandit feedback (118) learning rate (192)

Papers

Projection-Free Online Convex Optimization via Efficient Newton Iterations NIPS 2023
Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness NIPS 2023
Regret Guarantees for Online Deep Control L4DC 2023
Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023
Adaptive Regret for Control of Time-Varying Dynamics L4DC 2023
Online Estimation and Control with Optimal Pathlength Regret L4DC 2022
One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization ACML 2022
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability ALT 2022
Distributed Online Learning for Joint Regret with Communication Constraints ALT 2022
Adaptive Conformal Predictions for Time Series ICML 2022
Online Frank-Wolfe with Arbitrary Delays NIPS 2022
Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022
A Simple yet Universal Strategy for Online Convex Optimization ICML 2022
Risk-Averse No-Regret Learning in Online Convex Games ICML 2022
Decentralized Online Convex Optimization in Networked Systems ICML 2022
A Regret Minimization Approach to Multi-Agent Control ICML 2022
Differentially Private Online-to-batch for Smooth Losses NIPS 2022
Distributed Online Convex Optimization with Compressed Communication NIPS 2022
Efficient Projection-Free Online Convex Optimization with Membership Oracle COLT 2022
Scale-free Unconstrained Online Learning for Curved Losses COLT 2022
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees COLT 2022
Non-stationary Bandits with Knapsacks NIPS 2022
Parameter-free Regret in High Probability with Heavy Tails NIPS 2022
Efficient Methods for Non-stationary Online Learning NIPS 2022