Efficient Greedy Coordinate Descent for Composite Problems.Download PDFOpen Website

2019 (modified: 09 Nov 2022)AISTATS2019Readers: Everyone
Abstract: Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth proble...
0 Replies

Loading