Imagen de Portada

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lu, Yiyang, Pedramfar, Mohammad, Aggarwal, Vaneet
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Artificial Intelligence Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$γ$-weakly $θ$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
por: Pedramfar, Mohammad, et al.
Publicado: (2026)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
por: Pedramfar, Mohammad, et al.
Publicado: (2024)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
por: Lu, Yiyang, et al.
Publicado: (2025)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
por: Pedramfar, Mohammad, et al.
Publicado: (2024)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
por: Lu, Yiyang, et al.
Publicado: (2026)

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
por: Pedramfar, Mohammad, et al.
Publicado: (2024)

Global Convergence Guarantees for Federated Policy Gradient Methods with Adversaries
por: Ganesh, Swetha, et al.
Publicado: (2024)

ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
por: Fourati, Fares, et al.
Publicado: (2025)

Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
por: Fourati, Fares, et al.
Publicado: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)

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

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
por: Jadav, Hareshkumar, et al.
Publicado: (2026)

Federated Distributionally Robust Optimization with Non-Convex Objectives: Algorithm and Analysis
por: Jiao, Yang, et al.
Publicado: (2023)

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

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

Hidden Convexity of Fair PCA and Fast Solver via Eigenvalue Optimization
por: Shen, Junhui, et al.
Publicado: (2025)

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

HoP: Homeomorphic Polar Learning for Hard Constrained Optimization
por: Deng, Ke, et al.
Publicado: (2025)

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization
por: Lu, Songtao
Publicado: (2022)

Joint Optimization of Multi-Objective Reinforcement Learning with Policy Gradient Based Algorithm
por: Bai, Qinbo, et al.
Publicado: (2021)

Multi-Armed Sampling Problem and the End of Exploration
por: Pedramfar, Mohammad, et al.
Publicado: (2025)

Convergence of Some Convex Message Passing Algorithms to a Fixed Point
por: Voracek, Vaclav, et al.
Publicado: (2024)

Convex and Bilevel Optimization for Neuro-Symbolic Inference and Learning
por: Dickens, Charles, et al.
Publicado: (2024)

Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithm
por: Bai, Qinbo, et al.
Publicado: (2022)

A Unified Approach for Maximizing Continuous DR-submodular Functions
por: Pedramfar, Mohammad, et al.
Publicado: (2023)

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

A Convexity-dependent Two-Phase Training Algorithm for Deep Neural Networks
por: Hrycej, Tomas, et al.
Publicado: (2025)

Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization
por: Hu, Quanqi, et al.
Publicado: (2023)

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

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

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
por: Moradipari, Ahmadreza, et al.
Publicado: (2023)

Double Momentum Method for Lower-Level Constrained Bilevel Optimization
por: Shi, Wanli, et al.
Publicado: (2024)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
por: Ozaslan, Ibrahim K., et al.
Publicado: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
por: Sachs, Sarah, et al.
Publicado: (2023)

Anytime Training with Schedule-Free Spectral Optimization
por: Apte, Anuj, et al.
Publicado: (2026)

How Memory in Optimization Algorithms Implicitly Modifies the Loss
por: Cattaneo, Matias D., et al.
Publicado: (2025)

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

Lion Secretly Solves Constrained Optimization: As Lyapunov Predicts
por: Chen, Lizhang, et al.
Publicado: (2023)

Recursive Entropic Risk Optimization in Discounted MDPs: Sample Complexity Bounds with a Generative Model
por: Mortensen, Oliver, et al.
Publicado: (2025)

Learning Concave Bid Shading Strategies in Online Auctions via Measure-valued Proximal Optimization
por: Nodozi, Iman, et al.
Publicado: (2025)