Robust computation of optimal transport by $ฮฒ$-potential regularization

December 26, 2022 ยท Declared Dead ยท ๐Ÿ› Asian Conference on Machine Learning

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shintaro Nakamura, Han Bao, Masashi Sugiyama arXiv ID 2212.13251 Category cs.LG: Machine Learning Cross-listed cs.AI Citations 0 Venue Asian Conference on Machine Learning Last Checked 4 months ago
Abstract
Optimal transport (OT) has become a widely used tool in the machine learning field to measure the discrepancy between probability distributions. For instance, OT is a popular loss function that quantifies the discrepancy between an empirical distribution and a parametric model. Recently, an entropic penalty term and the celebrated Sinkhorn algorithm have been commonly used to approximate the original OT in a computationally efficient way. However, since the Sinkhorn algorithm runs a projection associated with the Kullback-Leibler divergence, it is often vulnerable to outliers. To overcome this problem, we propose regularizing OT with the ฮฒ-potential term associated with the so-called $ฮฒ$-divergence, which was developed in robust statistics. Our theoretical analysis reveals that the $ฮฒ$-potential can prevent the mass from being transported to outliers. We experimentally demonstrate that the transport matrix computed with our algorithm helps estimate a probability distribution robustly even in the presence of outliers. In addition, our proposed method can successfully detect outliers from a contaminated dataset
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted