Skip to content
Sagan

Paper

A unified complexity bound for logconcave sampling

Unreadunread

AI summary

arXiv:2606. 12694v1 Announce Type: cross Abstract: We give a simple, unified, and nearly tight bound for sampling arbitrary logconcave distributions from a warm start using the In-and-Out algorithm along with exponential lifting.