1
Complexity of Non-Log-Concave Sampling in Fisher Information
首次给出非对数凹分布采样相对Fisher信息保证的查询复杂度，基于近端采样器与限制高斯oracle，是采样理论的重要进展
arXiv:2605.15859v1 Announce Type: cross Abstract: We study the query complexity of obtaining a relative Fisher information guarantee for sampling from…