scientific article; zbMATH DE number 7064053
From MaRDI portal
zbMath1491.65009arXiv1802.09188MaRDI QIDQ5381127
Szymon Majewski, Błażej Miasojedow, Alain Durmus
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1802.09188
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monte Carlo methods (65C05) Convergence of probability measures (60B10) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items
Oracle lower bounds for stochastic gradient sampling algorithms, Particle dual averaging: optimization of mean field neural network with global convergence rate analysis*, Constrained ensemble Langevin Monte Carlo, Complexity of zigzag sampling algorithm for strongly log-concave distributions, On sampling from a log-concave density using kinetic Langevin diffusions, The forward-backward envelope for sampling with the overdamped Langevin algorithm, Bayesian Stochastic Gradient Descent for Stochastic Optimization with Streaming Input Data, Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method, Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach. Part II: Theoretical Analysis, Unnamed Item, Unnamed Item, Is there an analog of Nesterov acceleration for gradient-based MCMC?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview
- Existence and stability for Fokker-Planck equations with log-concave reference measure
- A class of Wasserstein metrics for probability distributions
- Exponential convergence of Langevin distributions and their discrete approximations
- An introduction to MCMC for machine learning
- Introductory lectures on convex optimization. A basic course.
- Convergence to equilibrium in Wasserstein distance for Fokker-Planck equations
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise.
- Simulation-based regularized logistic regression
- The Bayesian elastic net
- (Non-) asymptotic properties of Stochastic Gradient Langevin Dynamics
- Inverse problems: A Bayesian perspective
- Optimal Concentration of Information Content for Log-Concave Densities
- Rényi Divergence and Kullback-Leibler Divergence
- Handbook of Markov Chain Monte Carlo
- Markov Chains and Stochastic Stability
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Monotone Operators and the Proximal Point Algorithm
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Variational Analysis
- The Variational Formulation of the Fokker--Planck Equation
- RECURSIVE COMPUTATION OF THE INVARIANT DISTRIBUTION OF A DIFFUSION: THE CASE OF A WEAKLY MEAN REVERTING DRIFT
- Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau
- L 1-Regularization Path Algorithm for Generalized Linear Models
- Equation of State Calculations by Fast Computing Machines
- The Entropy Per Coordinate of a Random Vector is Highly Constrained Under Convexity Conditions
- Elements of Information Theory
- Monte Carlo sampling methods using Markov chains and their applications
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Expansion of the global error for numerical schemes solving stochastic differential equations
- Convex analysis and monotone operator theory in Hilbert spaces
- Optimal Transport
- Bayesian auxiliary variable models for binary and multinomial regression
