Open Problem: Anytime Convergence Rate of Gradient Descent
<|reference_start|>Open Problem: Anytime Convergence Rate of Gradient Descent: Recent results show that vanilla gradient descent can be accelerated for smooth convex objectives, merely by changing the stepsize sequence. We show that this can lead to surprisingly large errors indefinitely, and therefore ask: Is there any stepsize schedule for gradient descent that accelerates the classic $\mathcal{O}(1/T)$ convergence rate, at \emph{any} stopping time $T$?<|reference_end|>
@article{kornowski2024open,
    title={Open Problem: Anytime Convergence Rate of Gradient Descent},
    author={Guy Kornowski, Ohad Shamir},
    journal={arXiv preprint arXiv:2406.13888},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.13888},
    primaryClass={math.OC cs.LG}
}