A unified complexity bound for logconcave sampling
Researchers have developed a new, unified complexity bound for sampling logconcave distributions. This bound is nearly tight and applies to various settings, including constrained and well-conditioned densities. The analysis introduces an improved bound for the Poincaré constant of a lifted distribution, leading to more efficient convergence rates. AI