Imagen de Portada

Tight Bounds for Online Convex Optimization with Adversarial Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sinha, Abhishek, Vaze, Rahul
Formato:	Preprint
Publicado:	2024
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

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

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2025)

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

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
por: Shah, Harsh, et al.
Publicado: (2025)

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

Convex Optimization with Nested Evolving Feasible Sets
por: M., Karthick Krishna, et al.
Publicado: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
por: Vaze, Rahul, et al.
Publicado: (2025)

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

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

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

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)

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

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
por: Liu, Shanqi, et al.
Publicado: (2024)

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

Tight Generalization Bounds for Noiseless Inverse Optimization
por: Fatemi, Pouria, et al.
Publicado: (2026)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
por: Jakob, Fabian, et al.
Publicado: (2025)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
por: Bai, Cedar Site, et al.
Publicado: (2024)

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

Smooth Quasar-Convex Optimization with Constraints
por: Martínez-Rubio, David
Publicado: (2025)

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
por: Armacki, Aleksandar, et al.
Publicado: (2026)

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

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

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

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

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

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
por: Vaze, Rahul, et al.
Publicado: (2025)

Tight Constraint Prediction of Six-Degree-of-Freedom Transformer-based Powered Descent Guidance
por: Briden, Julia, et al.
Publicado: (2025)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
por: Huang, Yankun, et al.
Publicado: (2025)

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)

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

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

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

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

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

Tight Regret Bounds for Bayesian Optimization in One Dimension
por: Scarlett, Jonathan
Publicado: (2018)

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

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

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