Loading video...
Video Failed to Load
Oldies but goldies: Y Nesterov, A method for solving a convex programming problem with convergence rate O(1/k^2). Improves the 1/k rate of vanilla gradient descent to 1/k^2.
47,616 views • 1 year ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
