The geometry of logconcave functions and sampling algorithms

László Lovász, Santosh Vempala

Research output: Contribution to journalArticle

99 Citations (Scopus)

Abstract

The class of logconcave functions in ℝn is a common generalization of Gaussians and of indicator functions of convex sets. Motivated by the problem of sampling from logconcave density functions, we study their geometry and introduce a technique for "smoothing" them out. These results are applied to analyze two efficient algorithms for sampling from a logconcave distribution in n dimensions, with no assumptions on the local smoothness of the density function. Both algorithms, the ball walk and the hit-and-run walk, use a random walk (Markov chain) to generate a random point. After appropriate preprocessing, they produce a point from approximately the right distribution in time O*(n4) and in amortized time O*(n3) if n or more sample points are needed (where the asterisk indicates that dependence on the error parameter and factors of log n are not shown). These bounds match previous bounds for the special case of sampling from the uniform distribution over a convex body.

Original languageEnglish
Pages (from-to)307-358
Number of pages52
JournalRandom Structures and Algorithms
Volume30
Issue number3
DOIs
Publication statusPublished - May 1 2007

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The geometry of logconcave functions and sampling algorithms'. Together they form a unique fingerprint.

  • Cite this