The geometry of logconcave functions and sampling algorithms
From MaRDI portal
Recommendations
- Sampling from log-concave distributions
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Log-Sobolev inequalities and sampling from log-concave distributions
- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
Cited in
(87)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Log-Sobolev inequalities and sampling from log-concave distributions
- 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
- Normalizing constants of log-concave densities
- 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
- Complexity of zigzag sampling algorithm for strongly log-concave distributions
- 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
- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
- 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
- Oracle estimation of a change point in high-dimensional quantile regression
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Comparison of hit-and-run, slice sampler and random walk Metropolis
- Efficient sampling from time-varying log-concave distributions
- Log-concavity and strong log-concavity: a review
- Ulam floating bodies
- scientific article; zbMATH DE number 7626719 (Why is no real title available?)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Density estimation for shift-invariant multidimensional distributions
- 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
- scientific article; zbMATH DE number 7306865 (Why is no real title available?)
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- The entropic barrier: exponential families, log-concave geometry, and self-concordance
- Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- On the integrality gap of binary integer programs with Gaussian data
- Tyler's and Maronna's M-estimators: non-asymptotic concentration results
- Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions
- 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
- Minimizing convex functions with rational minimizers
- Limit distribution theory for smooth \(p\)-Wasserstein distances
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
- Integrating products of quadratic forms
- A quick estimate for the volume of a polyhedron
- Statistical inference with regularized optimal transport
- Robust lower bounds on monopoly profit with -concave demand
- A generalization of Grünbaum's inequality in \(\mathrm{RCD}(0, N)\)-spaces
- Statistical microlocal analysis in two-dimensional x-ray CT
- Estranged facets and k-facets of Gaussian random point sets
- Reducing the large set threshold for Oertel's conjecture on the mixed-integer volume
- On the choice of the non-trainable internal weights in random feature maps for forecasting chaotic dynamical systems
- Improved dimension dependence in the Bernstein-von Mises theorem via a new Laplace approximation bound
- Log-concave density estimation with independent components
- Unadjusted Langevin algorithm for non-convex weakly smooth potentials
- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Local reconstruction analysis of inverting the Radon transform in the plane from noisy discrete data
- Eldan's stochastic localization and the KLS conjecture: isoperimetry, concentration and mixing
- Attribute-efficient learning of halfspaces with malicious noise: near-optimal label complexity and noise tolerance
- The projected covariance measure for assumption-lean variable significance testing
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Optimal regularization for a data source
- Reducing isotropy and volume to KLS: faster rounding and volume algorithms
- Dispersion of mass and the complexity of randomized geometric algorithms
This page was built for publication: The geometry of logconcave functions and sampling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437021)