Recent work has established that power-law spectral conditions on data enable tight convergence bounds for deterministic gradient descent, resolving the conflict between classical exponential bounds and observed power-law learning curves. In this work, we extend this result to the stochastic regime of high-dimensional machine learning.
Thomas Dybdahl
As seen in:
The Guardian,
arXiv,
NPR,
Slate,
The Marshall Project,
The Colorado Sun,
The Diane Rehm Show,
Spectrum Magazine,
Inquest,
Concert Monkey
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Thomas
Contact Thomas, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack