The geometry of logconcave functions and sampling algorithms
From MaRDI portal
Publication:3437021
DOI10.1002/rsa.20135zbMath1122.65012WikidataQ90907554 ScholiaQ90907554MaRDI QIDQ3437021
László Lovász, Santosh Vempala
Publication date: 11 May 2007
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20135
Metropolis algorithm; sampling algorithms; log-concave density; ball walk; Markov Chain Monte Carlo method; hit and run walk
60J22: Computational methods in Markov chains
65C40: Numerical analysis or methods applied to Markov chains
65C10: Random number generation in numerical analysis
Related Items
Unnamed Item, Oracle Estimation of a Change Point in High-Dimensional Quantile Regression, Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume, Comparison of hit-and-run, slice sampler and random walk Metropolis, The accessibility of convex bodies and derandomization of the hit and run algorithm, Unnamed Item, Unnamed Item, Ulam floating bodies, Unnamed Item, Unnamed Item, Unnamed Item, Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization, A Generalized Central Limit Conjecture for Convex Bodies, Two-Sided Estimates for Order Statistics of Log-Concave Random Vectors, Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation, A simplified proof of CLT for convex bodies, Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions, Convex set of quantum states with positive partial transpose analysed by hit and run algorithm, On the integrality gap of binary integer programs with Gaussian data, Tyler's and Maronna's M-estimators: non-asymptotic concentration results, John’s walk, Inference for High-Dimensional Censored Quantile Regression, Convergence of Gibbs sampling: coordinate hit-and-run mixes fast, Finite-sample complexity of sequential Monte Carlo estimators, A multivariate Gnedenko law of large numbers, The floating body and the hyperplane conjecture, Computational results of an \(O^{\ast }(n^{4})\) volume algorithm, Gibbs/Metropolis algorithms on a convex polytope, Log-concavity and strong log-concavity: a review, On randomized fictitious play for approximating saddle points over convex sets, Dispersion of mass and the complexity of randomized geometric algorithms, Projective re-normalization for improving the behavior of a homogeneous conic linear system, Rapid mixing of geodesic walks on manifolds with positive curvature, Sampling from a log-concave distribution with projected Langevin Monte Carlo, Exploratory distributions for convex functions, Concentration of the empirical level sets of Tukey's halfspace depth, Local continuity of log-concave projection, with applications to estimation under model misspecification, Stability of the Prékopa-Leindler inequality for log-concave functions, A lower-bound on monopoly profit for log-concave demand, Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials, Concentration inequalities for log-concave distributions with applications to random surface fluctuations, Oracle lower bounds for stochastic gradient sampling algorithms, Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference, Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives, On Condorelli inequality for log-concave demand, Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients, Correction of AI systems by linear discriminants: probabilistic foundations, A remark on approximating permanents of positive definite matrices, Fast multivariate log-concave density estimation, Statistical active learning algorithms for noise tolerance and differential privacy, Thin shell implies spectral gap up to polylog via a stochastic localization scheme, On the computational complexity of MCMC-based estimators in large samples, Pointwise estimates for marginals of convex bodies, Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions, A central limit theorem for convex sets, On the symmetry function of a convex set, Hit-and-Run for Numerical Integration, The Core of the Participatory Budgeting Problem, On Sampling from Multivariate Distributions
