Robust computation of optimal transport by $\beta$-potential regularization
Nakamura, Shintaro, Bao, Han, Sugiyama, Masashi
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Dec-26-2022
- Country:
- North America > United States
- New York > New York County
- New York City (0.04)
- Massachusetts > Middlesex County
- Cambridge (0.04)
- Illinois > Cook County
- Chicago (0.04)
- California > Los Angeles County
- Los Angeles (0.04)
- New York > New York County
- Asia > Japan
- Honshū
- Kantō > Tokyo Metropolis Prefecture
- Tokyo (0.05)
- Kansai > Kyoto Prefecture
- Kyoto (0.04)
- Kantō > Tokyo Metropolis Prefecture
- Honshū
- North America > United States
- Genre:
- Research Report (0.40)
- Technology: