Sampling from non-smooth distributions through Langevin diffusion
From MaRDI portal
Publication:2065460
Recommendations
- The forward-backward envelope for sampling with the overdamped Langevin algorithm
- Analysis of Langevin Monte Carlo via convex optimization
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Higher order Langevin Monte Carlo algorithm
Cites work
- A Hamiltonian Monte Carlo Method for Non-Smooth Energy Sampling
- A new approach to variable selection in least squares problems
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- A Useful Convergence Theorem for Probability Distributions
- Aggregating regression procedures to improve performance
- Aggregation by Exponential Weighting and Sharp Oracle Inequalities
- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Analysis of a random forests model
- Atomic Decomposition by Basis Pursuit
- Bagging predictors
- Boosting a weak learning algorithm by majority
- Bregman Monotone Optimization Algorithms
- Compressed sensing recovery via nonconvex shrinkage penalties
- Consistency of random forests and other averaging classifiers
- Consistency of the group Lasso and multiple kernel learning
- Consistent group selection in high-dimensional linear regression
- Convex analysis and monotone operator theory in Hilbert spaces
- Exact matrix completion via convex optimization
- Exponential convergence of Langevin distributions and their discrete approximations
- For most large underdetermined systems of linear equations the minimal đ1ânorm solution is also the sparsest solution
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 1089159 (Why is no real title available?)
- scientific article; zbMATH DE number 1522808 (Why is no real title available?)
- scientific article; zbMATH DE number 939851 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Linear and convex aggregation of density estimators
- Local differentiability of distance functions
- Low complexity regularization of linear inverse problems
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection with low complexity priors
- Near-ideal model selection by \(\ell _{1}\) minimization
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Nonlinear total variation based noise removal algorithms
- On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification
- PAC-Bayesian estimation and prediction in sparse additive models
- PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Prox-regular functions in Hilbert spaces
- Prox-regular functions in variational analysis
- Proximal Markov chain Monte Carlo algorithms
- Random forests
- Regularization of Wavelet Approximations
- Simultaneous adaptation to the margin and to complexity in classification
- Simultaneous analysis of Lasso and Dantzig selector
- Some theoretical results on the grouped variables Lasso
- Sparse regression learning by aggregation and Langevin Monte-Carlo
- Sparsity and Smoothness Via the Fused Lasso
- Statistics for high-dimensional data. Methods, theory and applications.
- Stochastic differential equations and applications.
- Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations
- The weighted majority algorithm
- Total Variation Projection With First Order Schemes
- Uncertainty Principles and Vector Quantization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- Weakly decomposable regularization penalties and structured sparsity
- Why the theorem of Scheffé should be rather called a theorem of Riesz
Cited in
(13)- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Exact lattice sampling from non-Gaussian distributions
- On sampling from a log-concave density using kinetic Langevin diffusions
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
- scientific article; zbMATH DE number 7415079 (Why is no real title available?)
- Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions
- The forward-backward envelope for sampling with the overdamped Langevin algorithm
- Approximate Primal-Dual Fixed-Point based Langevin Algorithms for Non-smooth Convex Potentials
- NF-ULA: normalizing flow-based unadjusted Langevin algorithm for imaging inverse problems
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration
- Subgradient Langevin methods for sampling from nonsmooth potentials
- Diffusion at absolute zero: Langevin sampling using successive Moreau envelopes
- A regularized bridge sampler for sparsely sampled diffusions
This page was built for publication: Sampling from non-smooth distributions through Langevin diffusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065460)
