Imagen de Portada

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sarkar, Dhruv, Chakrabartty, Aprameyo, Supantha, Subhamon, Dey, Palash, Sinha, Abhishek
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Relation-Aware Slicing in Cross-Domain Alignment
por: Sarkar, Dhruv, et al.
Publicado: (2025)

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

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

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

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

TAPS : Frustratingly Simple Test Time Active Learning for VLMs
por: Sarkar, Dhruv, et al.
Publicado: (2025)

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

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

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

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

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

A Dynamic Agent Based Model of the Real Economy with Monopolistic Competition, Perfect Product Differentiation, Heterogeneous Agents, Increasing Returns to Scale and Trade in Disequilibrium
por: Supantha, Subhamon, et al.
Publicado: (2024)

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

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

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

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)

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

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

Quantum Algorithms for Projection-Free Sparse Convex Optimization
por: He, Jianhao, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

Riemannian Projection-free Online Learning
por: Hu, Zihao, et al.
Publicado: (2023)

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

BanditQ: Fair Bandits with Guaranteed Rewards
por: Sinha, Abhishek
Publicado: (2023)

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

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

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