Accelerating Unbalanced Optimal Transport Problem Using Dynamic Penalty Updating

With the increasing applications of Optimal Transport (OT) in the machine learning field, the Unbalanced Optimal Transport (UOT) problem, as a variant of the OT problem, has gained attention for its improved generality. There is an urgent need for fast algorithms that can efficiently handle large pe...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of ... International Joint Conference on Neural Networks pp. 1 - 6
Main Authors: Su, Xun, Kasai, Hiroyuki
Format: Conference Proceeding
Language:English
Published: IEEE 30.06.2024
Subjects:
Accuracy
Bregman Proximal Descent
Brightness
Degradation
Heuristic algorithms
Machine learning algorithms
Majorization-Maximization Algorithm
Mirror Descent
Navigation
Neural networks
Optimal Transport
Optimization
Unbalanced Optimal Transport
ISSN:2161-4407
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the increasing applications of Optimal Transport (OT) in the machine learning field, the Unbalanced Optimal Transport (UOT) problem, as a variant of the OT problem, has gained attention for its improved generality. There is an urgent need for fast algorithms that can efficiently handle large penalty parameters. In this paper, we prove that the recently proposed Majorize-Minimization algorithm for the UOT problem can be viewed as a form of the Bregman Proximal Descent (BPD), and we propose to use the dynamic penalty updating to overcome the substantial degradation of its convergence rate in response to large penalties. Using the dynamic scheme and Nesterov acceleration of the BPD algorithm, we can successfully compute more accurate and sparser solutions for the large penalty parameter and approach the computational speed of the well-known Sinkhorn's algorithm, which sacrifices accuracy by adding an entropy item.
ISSN:2161-4407
DOI:10.1109/IJCNN60899.2024.10650530