On perturbed proximal gradient algorithms
From MaRDI portal
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.
Recommendations
- Convergence of stochastic proximal gradient algorithm
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
- Stochastic proximal-gradient algorithms for penalized mixed models
- A proximal stochastic gradient method with progressive variance reduction
- Proximal algorithms in statistics and machine learning
Cited in
(57)- A SAEM algorithm for fused Lasso penalized nonlinear mixed effect models: application to group comparison in pharmacokinetics
- On variance reduction for stochastic smooth convex optimization with multiplicative noise
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- On the proximal gradient algorithm with alternated inertia
- Convergence of contrastive divergence algorithm in exponential family
- Convergence of stochastic proximal gradient algorithm
- A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
- General convergence analysis of stochastic first-order methods for composite optimization
- Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation
- Consistent online Gaussian process regression without the sample complexity bottleneck
- Fast selection of nonlinear mixed effect models using penalized likelihood
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm
- High-performance statistical computing in the computing environments of the 2020s
- Perturbed iterate SGD for Lipschitz continuous loss functions
- SABRINA: a stochastic subspace majorization-minimization algorithm
- Computation for latent variable model estimation: a unified stochastic proximal framework
- Stochastic proximal-gradient algorithms for penalized mixed models
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Ergodic convergence of a stochastic proximal point algorithm
- Stochastic forward-backward splitting for monotone inclusions
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Change-point computation for large graphical models: a scalable algorithm for Gaussian graphical models with change-points
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- Sparse estimation in Ising model via penalized Monte Carlo methods
- Optimization methods for large-scale machine learning
- scientific article; zbMATH DE number 7079312 (Why is no real title available?)
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Proximal Gradient Methods for Machine Learning and Imaging
- Gradient flows and randomised thresholding: sparse inversion and classification
- Minibatch forward-backward-forward methods for solving stochastic variational inequalities
- The stochastic auxiliary problem principle in Banach spaces: measurability and convergence
- Maximum likelihood estimation of regularization parameters in high-dimensional inverse problems: an empirical Bayesian approach. I: Methodology and experiments
- Maximum likelihood estimation of regularization parameters in high-dimensional inverse problems: an empirical Bayesian approach. II: Theoretical analysis
- Exploiting multi-core architectures for reduced-variance estimation with intractable likelihoods
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
- A strong law of large numbers for random monotone operators
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization
- On the accept-reject mechanism for Metropolis-Hastings algorithms
- Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization
- Sharper Bounds for Proximal Gradient Algorithms with Errors
- The stochastic proximal distance algorithm
- Sequential sample average majorization-minimization
- A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
- Regularized Rényi divergence minimization through Bregman proximal gradient algorithms
- Score-aware policy-gradient and performance guarantees using local Lyapunov stability
- Convergence analysis of a proximal stochastic denoising regularization algorithm
- When Composite Likelihood meets Stochastic Approximation
- Statistical finite elements via interacting particle Langevin dynamics
- Interacting particle Langevin algorithm for maximum marginal likelihood estimation
- CV@R-penalised portfolio optimisation with biased stochastic mirror descent
- Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization
- Statistical inference of constrained stochastic optimization via sketched sequential quadratic programming
- Differentially private regularized stochastic convex optimization with heavy-tailed data
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- A normal map-based proximal stochastic gradient method: convergence and identification properties
- Equivariant denoisers for plug-and-play image restoration
- A fully stochastic primal-dual algorithm
This page was built for publication: On perturbed proximal gradient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361273)
