Query lower bounds for log-concave sampling

DOI10.1109/FOCS57990.2023.00131MaRDI QIDQ6942834zbMATH OpenFDO

Authors Jerry Zirui Li, Jaume de Dios Pont, Shyam Narayanan, Sinho Chewi, Chen Lu

Publication date 15 August 2025

Full work available at URL https://hdl.handle.net/1721.1/155703

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Computational methods for problems pertaining to statistics (62-08) Sampling theory, sample surveys (62D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Learning and adaptive systems in artificial intelligence (68T05)

Cited in

(3)

• Fixed-sparsity matrix approximation from matrix-vector products
• Exact simulation of diffusions and improved algorithms for log-concave sampling
• Persistence Pays: Square-root condition-number dependence for Metropolis-adjusted kinetic Langevin Monte Carlo with a non-reversibly updated accept/reject uniform

This page was built for publication: Query lower bounds for log-concave sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942834)