Solving Fredholm equations of the first kind is crucial in many areas of the applied sciences. In this work we adopt a probabilistic and variational point of view by considering a minimization problem in the space of probability measures with an entropic regularization. Contrary to classical approaches which discretize the domain of the solutions, we introduce an algorithm to asymptotically sample from the unique solution of the regularized minimization problem. As a result our estimators do not depend on any underlying grid and have better scalability properties than most existing methods. Our algorithm is based on a particle approximation of the solution of a McKean--Vlasov stochastic differential equation associated with the Wasserstein gradient flow of our variational formulation. We prove the convergence towards a minimizer and provide practical guidelines for its numerical implementation. Finally, our method is compared with other approaches on several examples including density deconvolution and epidemiology.
翻译:在应用科学的许多领域,解决Fredholm第一种方程式至关重要。在这项工作中,我们采用一种概率和变异的观点,即考虑将概率测量空间的最小化问题,并进行昆虫正规化。与将解决方案领域分解的经典方法相反,我们引入了一种算法,从常规化最小化问题的独特解决办法中进行非随机抽样。因此,我们的测算员并不依赖任何内在网格,而且比大多数现有方法具有更好的可缩缩缩性。我们的算法基于与我们变异配方瓦塞斯坦梯度流相关的微粒接近的麦肯-弗拉索夫差异方程式。我们证明向最小化的趋同,并为它的数字实施提供了实用指南。最后,我们的方法与其他方法进行了比较,这些例子包括密度下降和流行病学。