The Sample Complexity of Parameter-Free Stochastic Convex Optimization
DGX agentarXiv:2506.11336v2 Announce Type: replace Abstract: We study the sample complexity of stochastic convex optimization when problem parameters such as the distance to optimality and the Lipschitz consta