正在加载视频...
视频加载失败
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 次观看 • 1 年前 •via X (Twitter)
0 条评论
暂无评论
原始帖子的评论将显示在这里
