Image de couverture de livre

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sarkar, Dhruv, Sinha, Abhishek
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression
par: Sarkar, Dhruv, et autres
Publié: (2026)

Constrained Contextual Bandits with Adversarial Contexts
par: Sarkar, Dhruv, et autres
Publié: (2026)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
par: Supantha, Subhamon, et autres
Publié: (2025)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2024)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2025)

BanditQ: Fair Bandits with Guaranteed Rewards
par: Sinha, Abhishek
Publié: (2023)

Constrained Online Convex Optimization with Memory and Predictions
par: Abdullah, Mohammed, et autres
Publié: (2026)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
par: Ferreira, Ricardo N., et autres
Publié: (2025)

Zero-shot Active Learning Using Self Supervised Learning
par: Sinha, Abhishek, et autres
Publié: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
par: Sarkar, Dhruv, et autres
Publié: (2026)

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
par: Lu, Yiyang, et autres
Publié: (2025)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
par: Yang, Sifan, et autres
Publié: (2026)

Online Submodular Maximization via Online Convex Optimization
par: Salem, Tareq Si, et autres
Publié: (2023)

Alternating Regret for Online Convex Optimization
par: Hait, Soumita, et autres
Publié: (2025)

Distributed Associative Memory via Online Convex Optimization
par: Wang, Bowen, et autres
Publié: (2025)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
par: Zhang, Liang, et autres
Publié: (2023)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
par: Ryabchenko, Alexander, et autres
Publié: (2026)

Distributed Dynamic Associative Memory via Online Convex Optimization
par: Wang, Bowen, et autres
Publié: (2025)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
par: Vaze, Rahul, et autres
Publié: (2025)

Online Convex Optimization with Unbounded Memory
par: Kumar, Raunak, et autres
Publié: (2022)

Unconstrained Robust Online Convex Optimization
par: Zhang, Jiujia, et autres
Publié: (2025)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
par: Qiu, Hao, et autres
Publié: (2025)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
par: Wan, Yuanyu, et autres
Publié: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
par: Chen, Sijia, et autres
Publié: (2023)

HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
par: Tran, Trinh, et autres
Publié: (2026)

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
par: Nguyen, Hoang T., et autres
Publié: (2025)

Online Convex Optimization with Memory and Limited Predictions
par: Wang, Zhengmiao, et autres
Publié: (2024)

Online Convex Optimization with a Separation Oracle
par: Mhammedi, Zakaria
Publié: (2024)

Breaking the $O(\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\sqrt{T})$ Static Regret in Constrained Online Convex Optimization
par: Balasundaram, Haricharan, et autres
Publié: (2026)

Multi-Objective $\textit{min-max}$ Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

Bayesian Optimization with Formal Safety Guarantees via Online Conformal Prediction
par: Zhang, Yunchuan, et autres
Publié: (2023)

Improved Regret for Bandit Convex Optimization with Delayed Feedback
par: Wan, Yuanyu, et autres
Publié: (2024)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
par: Chakraborty, Abhishek, et autres
Publié: (2026)

Small Gradient Norm Regret for Online Convex Optimization
par: Gao, Wenzhi, et autres
Publié: (2026)