论文信息 - Log-Sobolev inequalities and sampling from log-concave distributions

Log-Sobolev inequalities and sampling from log-concave distributions

We consider the problem of sampling according to a distribution with log-concave density F over a convex body K R n. The sampling is done using a biased random walk and we give improved polynomial upper bounds on the time to get a sample point with distribution close to F .

A. Frieze | R. Kannan

[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[3] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[4] Miklós Simonovits,et al. The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5] Miklós Simonovits,et al. Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[6] Nicholas G. Polson,et al. Sampling from log-concave distributions , 1994 .

[7] P. Diaconis,et al. LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .