Copertina

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Sarkar, Dhruv, Sinha, Abhishek
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

BanditQ: Fair Bandits with Guaranteed Rewards
di: Sinha, Abhishek
Pubblicazione: (2023)

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

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

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

Zero-shot Active Learning Using Self Supervised Learning
di: Sinha, Abhishek, et al.
Pubblicazione: (2024)

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

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

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

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

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

Distributed Associative Memory via Online Convex Optimization
di: Wang, Bowen, et al.
Pubblicazione: (2025)

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

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
di: Ryabchenko, Alexander, et al.
Pubblicazione: (2026)

Distributed Dynamic Associative Memory via Online Convex Optimization
di: Wang, Bowen, et al.
Pubblicazione: (2025)

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

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

Unconstrained Robust Online Convex Optimization
di: Zhang, Jiujia, et al.
Pubblicazione: (2025)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
di: Qiu, Hao, et al.
Pubblicazione: (2025)

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

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

HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
di: Tran, Trinh, et al.
Pubblicazione: (2026)

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
di: Nguyen, Hoang T., et al.
Pubblicazione: (2025)

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

Online Convex Optimization with a Separation Oracle
di: Mhammedi, Zakaria
Pubblicazione: (2024)

Breaking the $O(\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\sqrt{T})$ Static Regret in Constrained Online Convex Optimization
di: Balasundaram, Haricharan, et al.
Pubblicazione: (2026)

Multi-Objective $\textit{min-max}$ Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Bayesian Optimization with Formal Safety Guarantees via Online Conformal Prediction
di: Zhang, Yunchuan, et al.
Pubblicazione: (2023)

Improved Regret for Bandit Convex Optimization with Delayed Feedback
di: Wan, Yuanyu, et al.
Pubblicazione: (2024)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
di: Chakraborty, Abhishek, et al.
Pubblicazione: (2026)

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