BAGEL: Adversarially Constrained Online Convex Optimization under Separation Oracle Access
cs.LG, cs.AI, math.OC
Submitted: 2025-02-23
Updated: 2026-08-26
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Projection-Free Online Convex Optimization with Stochastic Constraints
- Online Learning: A Modern Introduction Using Convex Optimization
- Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
- Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks