Quantitative Uniform Stability of the Iterative Proportional Fitting Procedure
We establish the uniform in time stability, w.r.t. the marginals, of the Iterative Proportional Fitting Procedure, also known as Sinkhorn algorithm, used to solve entropy-regularised Optimal Transport problems. Our result is quantitative and stated in terms of the 1-Wasserstein metric. As a corollary we establish a quantitative stability result for Schr\"odinger bridges.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The derivatives of Sinkhorn-Knopp converge
We show that the derivatives of the Sinkhorn-Knopp algorithm, or iterative proportional fitting procedure, converge towards the derivatives of the entropic regularization of the optimal transport problem with a locally u…
Diffusion & Adversarial Schrödinger Bridges via Iterative Proportional Markovian Fitting
The Iterative Markovian Fitting (IMF) procedure based on iterative reciprocal and Markovian projections has recently been proposed as a powerful method for solving the Schr\"odinger Bridge problem. However, it has been o…
Exponential Convergence Guarantees for Iterative Markovian Fitting
The Schrödinger Bridge (SB) problem has become a fundamental tool in computational optimal transport and generative modeling. To address this problem, ideal methods such as Iterative Proportional Fitting and Iterative Ma…
Uniformly Stable Algorithms for Adversarial Training and Beyond
In adversarial machine learning, neural networks suffer from a significant issue known as robust overfitting, where the robust test accuracy decreases over epochs (Rice et al., 2020). Recent research conducted by Xing et…
The iterative proportional fitting algorithm and the NM-method: solutions for two different sets of problems
In this paper, we identify two different sets of problems. The first covers the problems that the iterative proportional fitting (IPF) algorithm was developed to solve. These concern completing a population table by usin…
counterfactual