Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport

@misc{shen2026regularized,
  title = {{Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport}},
  author = {Binrui Shen and Shengxin Zhu},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.29299},
  eprint = {2608.29299},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.29299},
}

TY  - UNPB
TI  - Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport
AU  - Binrui Shen
AU  - Shengxin Zhu
PY  - 2026
DA  - 2026/08/29
PB  - arXiv
DO  - 10.48550/arxiv.2608.29299
UR  - https://arxiv.org/abs/2608.29299
AB  - Three classical problems-linear assignment, graph matching, and optimal transport-share a common structure: they seek an optimal matrix-valued coupling on a matrix polytope. We study regularized coupling maps that encompass two families of regularization: entropy/KL regularization, which exponentiates the input score matrix and projects it onto the relevant matrix polytope via the KL-projection; and the Frobenius/Euclidean regularization, which performs the Euclidean projection of the scaled input matrix onto the same polytope. We trace how these two geometries yield complementary algorithmic tools for graph matching (CSGO, ASM, FRAM) and optimal transport (IP-EOT, PSN). The regularized coupling map serves as a direction generator in graph matching and as a solution representation in optimal transport, with the regularizer determining the geometry and the outer task determining the precision standard.
ER  -