资源分类
》 资源 》论文》Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization

Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization

2020-01-08 | |  58 |   46 |   0

Abstract

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates. Using these rates, we perform as well as or better than a carefully chosen fixed error level on a set of structured sparsity problems.

上一篇：Policy Gradient Coagent Networks

下一篇：Information Rates and Optimal Decoding in Large Neural Populations

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...