Blog
About

  • Record: found
  • Abstract: found
  • Article: found
Is Open Access

On perturbed proximal gradient algorithms

Preprint

Read this article at

Bookmark
      There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

      Abstract

      We study a version of the proximal gradient algorithm for which the gradient is intractable and is approximated by Monte Carlo methods (and in particular Markov Chain Monte Carlo). We derive conditions on the step size and the Monte Carlo batch size under which convergence is guaranteed: both increasing batch size and constant batch size are considered. We also derive non-asymptotic bounds for an averaged version. Our results cover both the cases of biased and unbiased Monte Carlo approximation. To support our findings, we discuss the inference of a sparse generalized linear model with random effect and the problem of learning the edge structure and parameters of sparse undirected graphical models.

      Related collections

      Author and article information

      Journal
      2014-02-10
      2016-06-24
      1402.2365

      http://arxiv.org/licenses/nonexclusive-distrib/1.0/

      Custom metadata
      60F15, 60G42
      29 pages, 5 figures
      math.ST math.OC stat.TH

      Numerical methods, Statistics theory

      Comments

      Comment on this article