In-and-out: algorithmic diffusion for sampling convex bodies
From MaRDI portal
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Diffusion processes (60J60) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Cites work
- A practical volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A Simple Analytic Proof of an Inequality by P. Buser
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- Analysis and geometry of Markov diffusion operators
- Analysis of Langevin Monte Carlo via convex optimization
- Bayesian computation and stochastic systems. With comments and reply.
- Blocking Conductance and Mixing in Random Walks
- Bourgain's slicing problem and KLS isoperimetry up to polylog
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- Dissipation of Information in Channels With Input Constraints
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Eldan's stochastic localization and the KLS conjecture: isoperimetry, concentration and mixing
- Entropies, convexity, and functional inequalities: on \(\Phi\)-entropies and \(\Phi\)-Sobolev inequalities
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- Geometric algorithms and combinatorial optimization.
- Heat flow and a faster algorithm to compute the surface area of a convex body
- Hit-and-Run from a Corner
- Hit-and-run mixes fast
- scientific article; zbMATH DE number 5019925 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- Isoperimetric problems for convex bodies and a localization lemma
- Log-Sobolev inequalities and sampling from log-concave distributions
- Logarithmic bounds for isoperimetry and slices of convex sets
- Random walks and anO*(n5) volume algorithm for convex bodies
- Random walks in a convex body and an improved volume algorithm
- Random walks on polytopes and an affine interior point method for linear programming
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
- Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Some inequalities satisfied by the quantities of information of Fisher and Shannon
- Sparse regression learning by aggregation and Langevin Monte-Carlo
- Spectral monotonicity under Gaussian convolution
- Spreading of sets in product spaces and hypercontraction of the Markov operator
- Strong Data Processing Inequalities for Input Constrained Additive Noise Channels
- The Langevin Monte Carlo algorithm in the non-smooth log-concave case
- The mirror Langevin algorithm converges with vanishing bias
- The Poincaré inequality and quadratic transportation-variance inequalities
- The strong data processing inequality under the heat flow
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
This page was built for publication: In-and-out: algorithmic diffusion for sampling convex bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227404)
