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 Submodular Maximization via Online Convex Optimization AAAI 2024
Projection-free Online Exp-concave Optimization COLT 2023
Improved Dynamic Regret for Online Frank-Wolfe COLT 2023
Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023
Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence COLT 2023
Projection-free Adaptive Regret with Membership Oracles ALT 2023
Adaptive Regret for Control of Time-Varying Dynamics L4DC 2023
Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States ALT 2023
Quasi-Newton Steps for Efficient Online Exp-Concave Optimization COLT 2023
Online Nonstochastic Control with Adversarial and Static Constraints ICML 2023
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023
Mechanic: A Learning Rate Tuner NIPS 2023
Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions NIPS 2023
Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness NIPS 2023
Unconstrained Dynamic Regret via Sparse Coding NIPS 2023
Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NIPS 2023
Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime ICML 2023
Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization NIPS 2023
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression ICML 2023
Online Convex Optimization with Unbounded Memory NIPS 2023
Federated Online and Bandit Convex Optimization ICML 2023
Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023
A Computationally Efficient Sparsified Online Newton Method NIPS 2023
Likelihood Ratio Confidence Sets for Sequential Decision Making NIPS 2023
Regret Guarantees for Online Deep Control L4DC 2023