Lower Bounds for Linear-Oracle Online Learning
DGX agentarXiv:2609.38375v1 Announce Type: cross Abstract: Can a constant number of linear minimizations per round improve on the T^{3/4} regret rate of online Frank-Wolfe on general convex sets? Weibel et al.