Polyhedral Instability Governs Regret in Online Learning
DGX agentarXiv:2605.13692v1 Announce Type: new Abstract: Many online decision problems over combinatorial actions are addressed via convex relaxations, leading to online convex optimization with piecewise line