Cover Image

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sarkar, Dhruv, Sinha, Abhishek
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

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

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

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
by: Sarkar, Dhruv, et al.
Published: (2026)

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

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

Constrained Contextual Bandits with Adversarial Contexts
by: Sarkar, Dhruv, et al.
Published: (2026)

A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression
by: Sarkar, Dhruv, et al.
Published: (2026)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

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

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

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
by: Zhu, Jiahui, et al.
Published: (2025)

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

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
by: Wan, Yuanyu, et al.
Published: (2024)

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

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

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

Pareto-Optimal Anytime Algorithms via Bayesian Racing
by: Wurth, Jonathan, et al.
Published: (2026)

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

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

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
by: Liu, Xiufeng, et al.
Published: (2026)

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

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

Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
by: Jiang, Jiashuo
Published: (2023)

An Anytime Algorithm for Good Arm Identification
by: Jourdan, Marc, et al.
Published: (2023)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints
by: Yang, Ming, et al.
Published: (2025)

Improved Algorithms for Nash Welfare in Linear Bandits
by: Sarkar, Dhruv, et al.
Published: (2026)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

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

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

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

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

BanditQ: Fair Bandits with Guaranteed Rewards
by: Sinha, Abhishek
Published: (2023)

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

Constrained Online Convex Optimization with Memory and Predictions
by: Abdullah, Mohammed, et al.
Published: (2026)