Imagen de Portada

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Supantha, Subhamon, 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

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
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)

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

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

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

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

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

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

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

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

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

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

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

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)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
por: Stradi, Francesco Emanuele, et al.
Publicado: (2024)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
por: Bechavod, Yahav, et al.
Publicado: (2025)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2021)

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

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

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

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

Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks
por: Montasser, Omar, et al.
Publicado: (2025)

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

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

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
por: Yang, Wenhao, et al.
Publicado: (2025)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
por: Oki, Taihei, et al.
Publicado: (2026)

Data-Dependent Regret Bounds for Constrained MABs
por: Genalti, Gianmarco, et al.
Publicado: (2025)

Minimizing Queue Length Regret for Arbitrarily Varying Channels
por: Krishnakumar, G, et al.
Publicado: (2025)

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

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

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

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

Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
por: Wang, Juncheng, et al.
Publicado: (2024)

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

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

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

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

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
por: Pasteris, Stephen, et al.
Publicado: (2024)

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

Gradient-Variation Regret Bounds for Unconstrained Online Learning
por: Zhao, Yuheng, et al.
Publicado: (2026)