Imagen de Portada

Universal Online Convex Optimization Meets Second-order Bounds

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Lijun, Wang, Yibo, Wang, Guanghui, Yi, Jinfeng, Yang, Tianbao
Formato:	Preprint
Publicado:	2021
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
por: Wang, Bokun, et al.
Publicado: (2023)

Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
por: Jiang, Wei, et al.
Publicado: (2024)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
por: Jia, Tingkai, et al.
Publicado: (2026)

Projection-free Online Learning over Strongly Convex Sets
por: Wan, Yuanyu, et al.
Publicado: (2020)

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

Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization
por: Hu, Quanqi, et al.
Publicado: (2023)

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

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

Unconstrained Robust Online Convex Optimization
por: Zhang, Jiujia, et al.
Publicado: (2025)

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

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
por: Sahinoglu, Emre, et al.
Publicado: (2025)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
por: Hu, Quanqi, et al.
Publicado: (2024)

To Cool or not to Cool? Temperature Network Meets Large Foundation Models via DRO
por: Qiu, Zi-Hao, et al.
Publicado: (2024)

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

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

Optimal Bounds for Adversarial Constrained Online Convex Optimization
por: Ferreira, Ricardo N., et al.
Publicado: (2025)

Online Convex Optimization with a Separation Oracle
por: Mhammedi, Zakaria
Publicado: (2024)

Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator
por: Guo, Zhishuai, et al.
Publicado: (2021)

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

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

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

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

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

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

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

PAC-Bayes Meets Online Contextual Optimization
por: Xie, Zhuojun, et al.
Publicado: (2025)

Scalable Second-order Riemannian Optimization for $K$-means Clustering
por: Xu, Peng, et al.
Publicado: (2025)

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

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

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

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

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

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

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
por: Saad, El Mehdi, et al.
Publicado: (2025)

Are Convex Optimization Curves Convex?
por: Barzilai, Guy, et al.
Publicado: (2025)

Online Submodular Maximization via Online Convex Optimization
por: Salem, Tareq Si, et al.
Publicado: (2023)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

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

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
por: Yan, Wenjing, et al.
Publicado: (2024)