Skip to content
Sagan

Paper

Complexity of Non-Log-Concave Sampling in Fisher Information

Unreadunread

AI summary

arXiv:2605. 15859v1 Announce Type: cross Abstract: We study the query complexity of obtaining a relative Fisher information guarantee for sampling from a log-smooth non-log-concave distribution; this is a sampling analog of finding an approximate stationary point in optimization.