Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
cs.LG, math.OC, stat.ML
Submitted: 2026-05-25
Updated: 2026-11-08
Terminology
Sources
- Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
- Bandit Convex Optimisation
- Online Learning: A Modern Introduction Using Convex Optimization
- Unveiling Hidden Convexity in Deep Learning: a Sparse Signal Processing Perspective
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis