Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition VI: Randomized Proximal Coordinate Descent Has Expected Rate (1 − μ/(dL))^kResearch Paper
Many problems in machine learning and statistics have the composite form , where is a smooth loss and is a non-smooth regularizer such as . When is separable, , the method of choice at scale is often randomized proximal coordinate descent: at each step one coordinate is drawn at random and a…