arXiv (All)
open access
Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport
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 exponentiat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- On integral polytopes related to Edmonds' problem#1014291
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- Value-positivity for matrix games#1066576
Record · ID 794105
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive