Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection

Published on Dec 05, 20152851 Views

There has been significant recent work on the theory and application of randomized coordinate descent algorithms, beginning with the work of~ Nesterov [SIAM J. Optim., 22(2), 2012], who showed that a

Related categories