一种近似抽样算法的改进分析
Improved analysis for a proximal algorithm for sampling
摘要:
我们研究了Lee,Shen和Tian(2021)的近似采样器,并在比强对数凹更弱的假设下获得了新的收敛保证:即,我们的结果适用于(1)弱对数凹目标,以及(2)满足允许非对数凹的等周假设的目标。我们证明了我们的结果,获得新的国家的最先进的抽样保证几类目标分布。我们还加强了近端采样器和近端方法之间的联系,在优化解释的近端采样器作为熵正则化Wasserstein近端方法,和近端点方法的限制,近端采样器与噪声消失。
英文摘要:
We study the proximal sampler of Lee, Shen, and Tian (2021) and obtain new convergence guarantees under weaker assumptions than strong log-concavity: namely, our results hold for (1) weakly log-concave targets, and (2) targets satisfying isoperimetric assumptions which allow for non-log-concavity. We demonstrate our results by obtaining new state-of-the-art sampling guarantees for several classes of target distributions. We also strengthen the connection between the proximal sampler and the proximal method in optimization by interpreting the proximal sampler as an entropically regularized Wasserstein proximal method, and the proximal point method as the limit of the proximal sampler with vanishing noise.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。