### 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 a logconcave density function, we study their geometry and introduce an analysis technique for "smoothing" them out. This leads to efficient sampling algorithms with no assumptions on the local smoothness of the density function. After appropriate preprocessing, both the ball walk (with a Metropolis filter) and a generalization of hit-and-run produce a point from approximately the right distribution in time O* (n^{4}), and in amortized time O* (n^{3}) if many sample points are needed (where the asterisk indicates that dependence on the error parameter and factors of log n are not shown). The bounds are optimal in terms of a "roundness" parameter and match the best-known bounds for the special case of the uniform density over a convex set.

Original language | English |
---|---|

Pages (from-to) | 640-649 |

Number of pages | 10 |

Journal | Annual Symposium on Foundations of Computer Science - Proceedings |

Publication status | Published - Dec 3 2003 |

Event | Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States Duration: Oct 11 2003 → Oct 14 2003 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science - Proceedings*, 640-649.