Logconcave functions: Geometry and efficient sampling algorithms

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 640-649

  Lovász, László ^a   Vempala, Santosh ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; EQUIVALENCE CLASSES; ERROR ANALYSIS; FUNCTION EVALUATION; PARAMETER ESTIMATION; PROBABILITY DENSITY FUNCTION; SET THEORY; ALGORITHMS; CRYSTAL LATTICES; FILTERS (FOR FLUIDS); GEOMETRY; LATTICE THEORY; LEARNING ALGORITHMS; MATHEMATICAL TECHNIQUES; PROBABILITY DISTRIBUTIONS; PROFESSIONAL ASPECTS; RANDOM PROCESSES; SAMPLING; STOCHASTIC SYSTEMS;

CONVEX SET; LOGCONCAVE DENSITY FUNCTION; SAMPLING ALGORITHMS;

ALGORITHMS; DENSITY FUNCTIONAL THEORY;

ANALYSIS TECHNIQUES; EFFICIENT SAMPLING; ENGINEERING PROFESSION; GAUSSIAN PROCESSES; INDICATOR FUNCTIONS; LOG-CONCAVE DENSITY FUNCTION; LOGCONCAVE FUNCTIONS; SAMPLING METHOD;

EID: 17444438746     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. D. Applegate and R. Kannan (1990): Sampling and integration of near log-concave functions, Proc. 23th ACM STOC, 156-163.
2. J. Bourgain: Random points in isotropic convex sets, in: Convex geometric analysis (Berkeley, CA, 1996), 53-58, Math. Sci. Res. Inst. Publ., 34, Cambridge Univ. Press, 1999.
3. A. Dinghas: Über eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternik-schem Typus, Math. Zeitschr. 68 (1957), 111-125.
4. M. Dyer, A. Frieze and R. Kannan: A random polynomial time algorithm for estimating volumes of convex bodies, Proc. 21st Annual ACM Symp. on the Theory of Computing (1989), 375-381.
5. M. Dyer, A. Frieze and L. Stougie: talk at the Math. Prog. Symp., Ann Arbor, Mich. (1994).
6. A. Frieze and R. Kannan: Log-Sobolev inequalities and sampling from log-concave distributions, Annals of Applied Probability, 9 (1999), 14-26.
7. A. Frieze, R. Kannan and N. Polson: Sampling from log-concave distributions, Ann. Appl. Probab. 4 (1994), 812-837; Correction: Sampling from log-concave distributions, ibid. 4 (1994), 1255.
8. A. Kalai and S. Vempala: Efficient algorithms for universal portfolios, in: Proc. 41st Annual IEEE Symp. on the Foundations of Computer Science (2000), 486-491.
9. R. Kannan and L. Lovász: A logarithmic Cheeger inequality and mixing in random walks, in: Proc. 31st Annual ACM STOC (1999), 282-287.
10. 5) volume algorithm for convex bodies," Random Structures and Algorithms 11 (1997), 1-50.
11. R. Kannan, L. Lovász and M. Simonovits: "Isoperimetric problems for convex bodies and a localization lemma," J. Discr. Comput. Geom. 13 (1995) 541-559.
12. L. Lovász: How to compute the volume? Jber. d. Dt. Math.-Verein, Jubiläumstagung 1990, B. G. Teubner, Stuttgart, 138-151.
13. L. Lovász: Hit-and-run mixes fast, Math. Prog. 86 (1998), 443-461.
14. L. Lovász and M. Simonovitz: Random walks in a convex body and an improved volume algorithm, Random Structures and Alg. 4 (1993), 359-412.
15. 3) sampling algorithm, Microsoft Research Tech. Rep MSR-TR-2003-04. Available at: http://www-math.mit/edu-vempala/papers/logcon-ball.ps
16. L. Lovász and S. Vempala: Hit-and-run is fast and fun, Microsoft Research Tech. Rep.MSR-TR-2003-05. Available at http://www-math.mit.edu/~vempala/papers/logcon-hitrun.ps
17. L. Leindler: On a certain converse of Hölder's Inequality II, Acta Sci. Math. Szeged 33 (1972), 217-223.
18. A. Prékopa: Logarithmic concave measures and functions, Acta Sci. Math. Szeged 34 (1973), 335-343.
19. A. Prékopa: On logarithmic concave measures with applications to stochastic programming, Acta Sci. Math. Szeged 32 (1973), 301-316.
20. A. Prékopa: Stochastic Programming, Akadémiai Kiadó, Budapest and Kluwer, Dordrecht 1995.
21. M. Rudelson: Random vectors in the isotropic position, J. Funct. Anal. 164 (1999) 60-72.
22. R.L. Smith (1984), Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions, Operations Res. 32, 1296-1308.
23. Z.B. Zabinsky, R.L. Smith, J.F. McDonald, H.E. Romeijin and D.E. Kaufman: Improving hit-and-run for global optimization, J. Global Optim. 3 (1993), 171-192.