Convergence rates of nested accelerated inexact proximal methods
published: Jan. 16, 2013, recorded: December 2012, views: 2956
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Proximal gradient methods are popular first order algorithms currently used to solve several machine learning and inverse problems. We consider the case where the proximity operator is not available in closed form and is thus approximated via an iterative procedure leading to a nested algorithm. For the first time, we show that relying on an appropriate notion of approximations, which gives an explicit stopping rule for the inner loop, convergence rates for the two-loops algorithm can be proved for accelerated procedures for a large class of approximation algorithms. An experimental comparison with a benchmark primal-dual algorithm is reported and confirms a good empirical performance.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !