Image de couverture de livre

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Shanqi, Liu, Xin
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Safe Online Convex Optimization with Multi-Point Feedback
par: Hutchinson, Spencer, et autres
Publié: (2024)

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

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

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

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

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

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)

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

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

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

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

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
par: Zhan, Jingxin, et autres
Publié: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
par: Meng, Qing-xin, 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)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
par: Dahal, Hari, et autres
Publié: (2023)

Online Resource Allocation with Average Budget Constraints
par: Ao, Ruicheng, et autres
Publié: (2024)

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

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

Safe-EF: Error Feedback for Nonsmooth Constrained Optimization
par: Islamov, Rustem, et autres
Publié: (2025)

Online Non-Stationary Stochastic Quasar-Convex Optimization
par: Pun, Yuen-Man, et autres
Publié: (2024)

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

Learning-Augmented Decentralized Online Convex Optimization in Networks
par: Li, Pengfei, et autres
Publié: (2023)

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

Universal Online Convex Optimization with $1$ Projection per Round
par: Yang, Wenhao, et autres
Publié: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
par: Sachs, Sarah, et autres
Publié: (2023)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
par: Hihat, Massil, et autres
Publié: (2023)

A Variance-Reduced Stochastic Gradient Tracking Algorithm for Decentralized Optimization with Orthogonality Constraints
par: Wang, Lei, et autres
Publié: (2022)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
par: Wang, Lei, et autres
Publié: (2025)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
par: Pedramfar, Mohammad, et autres
Publié: (2024)

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

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
par: Hua, Youqing, et autres
Publié: (2024)

Are Convex Optimization Curves Convex?
par: Barzilai, Guy, et autres
Publié: (2025)

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

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
par: Barakat, Anas, et autres
Publié: (2026)

Local Linear Convergence of Infeasible Optimization with Orthogonal Constraints
par: Sun, Youbang, et autres
Publié: (2024)

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
par: Yan, Wenjing, et autres
Publié: (2024)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
par: Bao, Lingchan, et autres
Publié: (2025)