The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both in a case of reconstructing general nonnegative unknowns as well as for the sake of recovering probability distributions. Moreover, we discuss several variants of the algorithm and relations to other methods in the literature. The effectiveness of the approach is studied numerically in several examples.
Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm
INRIA-Paris(法国国家信息与自动化研究所巴黎分部);Université Paris-Dauphine, PSL Research University(巴黎第九大学,PSL研究大学);CNRS and Université Paris-Dauphine, PSL Research University(法国国家科学研究中心与巴黎第九大学,PSL研究大学)
Bregman proximal gradient method for linear optimization under entropic constraints
Univ. Rennes, CNRS, Inria, IRISA UMR 6074(雷恩大学、法国国家科学研究中心、Inria、IRISA);Universidad Técnica Federico Santa María Departamento de Matemática(费德里科·圣玛丽亚技术大学数学系)
Primal and Dual Analysis of Entropic Fictitious Play for Finite-sum Problems
Kyushu Institute of Technology(九州工业大学);RIKEN Center for Advanced Intelligence Project(理化学研究所先进智能项目中心);The University of Tokyo(东京大学);The University of Toronto(多伦多大学);Vector Institute for Artificial Intelligence(矢量人工智能研究所)