Image de couverture de livre

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Xiufeng, Chen, Qian, Wang, Zhijin, Liu, Ruyu
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

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)

Projection-Free Online Convex Optimization with Time-Varying Constraints
par: Garber, Dan, 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)

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)

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

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
par: Jia, Tingkai, et autres
Publié: (2026)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

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

Revisiting Projection-Free Online Learning with Time-Varying Constraints
par: Wang, Yibo, et autres
Publié: (2025)

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
par: Liu, Shanqi, et autres
Publié: (2024)

pyFAST: A Modular PyTorch Framework for Time Series Modeling with Multi-source and Sparse Data
par: Wang, Zhijin, et autres
Publié: (2025)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
par: Hutchinson, Spencer, et autres
Publié: (2024)

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

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

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
par: Pan, Zhaoye, et autres
Publié: (2026)

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

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
par: Lekeufack, Jordan, et autres
Publié: (2024)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
par: Liu, Zijian
Publié: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
par: Sahinoglu, Emre, et autres
Publié: (2025)

Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints
par: Hamoud, Bassel, et autres
Publié: (2025)

No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
par: Losalka, Arpan, et autres
Publié: (2024)

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

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
par: Yang, Sifan, et autres
Publié: (2026)

Smooth Quasar-Convex Optimization with Constraints
par: Martínez-Rubio, David
Publié: (2025)

No-Regret Gaussian Process Optimization of Time-Varying Functions
par: Mauduit, Eliabelle, et autres
Publié: (2025)

Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
par: Wang, Juncheng, et autres
Publié: (2024)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
par: Zhao, Peng, et autres
Publié: (2021)

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
par: Yang, Wenhao, et autres
Publié: (2025)

Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization
par: Bardou, Anthony, et autres
Publié: (2023)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
par: Zhao, Peng, et autres
Publié: (2025)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
par: Oki, Taihei, et autres
Publié: (2026)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
par: Bernasconi, Martino, et autres
Publié: (2024)

Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis
par: Li, Junfan, et autres
Publié: (2024)

Probabilistic Circuits with Constraints via Convex Optimization
par: Ghandi, Soroush, et autres
Publié: (2024)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
par: Jakob, Fabian, et autres
Publié: (2025)

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

Feature-driven reinforcement learning for photovoltaic in continuous intraday trading
par: Abate, Arega Getaneh, et autres
Publié: (2025)

Tady: A Neural Disassembler without Structural Constraint Violations
par: Qin, Siliang, et autres
Publié: (2025)

Data-Dependent Regret Bounds for Constrained MABs
par: Genalti, Gianmarco, et autres
Publié: (2025)