Sampling s-concave functions: The limit of convexity based isoperimetry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 420-433

  Chandrasekaran, Karthekeyan ^a   Deshpande, Amit ^b   Vempala, Santosh ^a  

^a Georgia Institute of Technology   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAUCHY DENSITY; CONCAVE FUNCTION; EFFICIENT SAMPLING; HEAVY-TAILED; LOG-CONCAVE DENSITIES; LOGCONCAVE FUNCTIONS; MIXING TIME; OPTIMIZATION ALGORITHMS; PROBABILITY DENSITIES; RANDOM WALK;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; LEARNING ALGORITHMS; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350600103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_32     Document Type: Conference Paper

References (19)

1. [AK91] Applegate, D., Kannan, R.: Sampling and integration of near log-concave functions. In: STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 156-163. ACM, New York (1991)
2. [Bob07] Bobkov, S.G.: Large deviations and isoperimetry over convex probability measures with heavy tails. Electronic Journal of Probability 12, 1072-1100 (2007)
3. [Bor74] Borell, C.: Convex measures on locally convex spaces. Ark. Math. 12, 239-252 (1974)
4. [Bor75] Borell, C.: Convex set functions in d-space. Periodica Mathematica Hungarica 6, 111-136 (1975)
5. [BV04] Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51(4), 540-556 (2004)
6. [DF91] Dyer, M.E., Frieze, A.M.: Computing the volume of a convex body: a case where randomness provably helps. In: Proc. of AMS Symposium on Probabilistic Combinatorics and Its Applications, pp. 123-170 (1991)
7. [DFK91] Dyer, M.E., Frieze, A.M., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38(1), 1-17 (1991)
8. [Joh87] Johnson, M.E.: Multivariate statistical simulation. Wiley, Chichester (1987)
9. [KL96] Kannan, R., Li, G.: Sampling according to the multivariate normal density. In: FOCS 1996: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 204. IEEE Computer Society Press, Los Alamitos (1996)
10. [KLS95] Kannan, R., Lovász, L., Simonovits, M.: Isoperimetric problems for convex bodies and a localization lemma. J. Discr. Comput. Geom. 13, 541-559 (1995)
11. 5) volume algorithm for convex bodies. Random Structures and Algorithms 11, 1-50 (1997)
12. [KV06] Kalai, A., Vempala, S.: Simulated annealing for convex optimization. Math. Oper. Res. 31(2), 253-266 (2006)
13. [Lov90] Lovász, L.: How to compute the volume? Jber. d. Dt. Math.-Verein, Jubiläumstagung 1990, 138-151 (1990)
14. [LS92] Lovász, L., Simonovits, M.: On the randomized complexity of volume and diameter. In: Proc. 33rd IEEE Annual Symp. on Found. of Comp. Sci., pp. 482-491 (1992)
15. [LS93] Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Structures and Alg 4, 359-412 (1993)
16. [LV06a] Lovász, L., Vempala, S.: Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 57-68. IEEE Computer Society Press, Los Alamitos (2006)
17. [LV06b] Lovász, L., Vempala, S.:Hit-and-run from acorner. SIAMJ. Computing 35, 985-1005 (2006)
18. 4) volume algorithm. J. Comput. Syst. Sci. 72(2), 392-417 (2006)
19. [LV07] Lovász, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30(3), 307-358 (2007)