video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning

Published on Feb 4, 20253872 Views

We consider the minimization of a convex objective function defined on a Hilbert space, which is only available through unbiased estimates of its gradients. This problem includes standard machine lear

Related categories

Presentation

Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning00:00
Summary of new results33:22:42