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

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications ALT 2026
Constrained Online Convex Optimization with Memory and Predictions AAAI 2026
Decentralized Online Convex Optimization with Unknown Feedback Delays AAAI 2026
Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization ALT 2026
Efficient Methods for Non-stationary Online Learning JMLR 2025
Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025
On the Power of Optimism in Constrained Online Convex Optimization IJCAI 2025
Universal Online Convex Optimization Meets Second-order Bounds JMLR 2025
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint AAAI 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises AAAI 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints AAAI 2025
Universal Online Convex Optimization with $1$ Projection per Round NIPS 2024
Private Online Learning via Lazy Algorithms NIPS 2024
Online Stackelberg Optimization via Nonlinear Control COLT 2024
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization JMLR 2024
An Equivalence Between Static and Dynamic Regret Minimization NIPS 2024
Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets NIPS 2024
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously NIPS 2024
Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning NIPS 2024
Online Submodular Maximization via Online Convex Optimization AAAI 2024
Multi-Agent Imitation Learning: Value is Easy, Regret is Hard NIPS 2024
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization JMLR 2024
Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization COLT 2024
Stochastic-Constrained Stochastic Optimization with Markovian Data JMLR 2024
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints NIPS 2024