Cover Image

Projection-free Online Learning over Strongly Convex Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wan, Yuanyu, Zhang, Lijun
Format:	Preprint
Published:	2020
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
by: Bao, Lingchan, et al.
Published: (2025)

Universal Online Convex Optimization with $1$ Projection per Round
by: Yang, Wenhao, et al.
Published: (2024)

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
by: Jiang, Wei, et al.
Published: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise
by: Yu, Dingzhi, et al.
Published: (2026)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
by: Lu, Yiyang, et al.
Published: (2026)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Convergence Analysis of the Lion Optimizer in Centralized and Distributed Settings
by: Jiang, Wei, et al.
Published: (2025)

Learning-Augmented Decentralized Online Convex Optimization in Networks
by: Li, Pengfei, et al.
Published: (2023)

Online (Non-)Convex Learning via Tempered Optimism
by: Haddouche, Maxime, et al.
Published: (2023)

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

Online Convex Optimization with Unbounded Memory
by: Kumar, Raunak, et al.
Published: (2022)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
by: Lu, Yiyang, et al.
Published: (2025)

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Online Convex Optimization with Memory and Limited Predictions
by: Wang, Zhengmiao, et al.
Published: (2024)

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees
by: de Vazelhes, William, et al.
Published: (2025)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

Safe Online Convex Optimization with Multi-Point Feedback
by: Hutchinson, Spencer, et al.
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
by: Pan, Zhaoye, et al.
Published: (2026)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
by: Zhan, Jingxin, et al.
Published: (2025)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

Distributed Online Private Learning of Convex Nondecomposable Objectives
by: Cheng, Huqiang, et al.
Published: (2022)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
by: Ji, Kaiyi
Published: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)