Matches in SemOpenAlex for { <https://semopenalex.org/work/W4320343058> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W4320343058 abstract "Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in most applications, the success of MOT is severely limited by a lack of efficient algorithms. Indeed, MOT in general requires exponential time in the number of marginals k and their support sizes n. This paper develops a general theory about what structure makes MOT solvable in poly(n,k) time. We develop a unified algorithmic framework for solving MOT in poly(n,k) time by characterizing the structure that different algorithms require in terms of simple variants of the dual feasibility oracle. This framework has several benefits. First, it enables us to show that the Sinkhorn algorithm, which is currently the most popular MOT algorithm, requires strictly more structure than other algorithms do to solve MOT in poly(n,k) time. Second, our framework makes it much simpler to develop poly(n,k) time algorithms for a given MOT problem. In particular, it is necessary and sufficient to (approximately) solve the dual feasibility oracle -- which is much more amenable to standard algorithmic techniques. We illustrate this ease-of-use by developing poly(n,k) time algorithms for three general classes of MOT cost structures: (1) graphical structure; (2) set-optimization structure; and (3) low-rank plus sparse structure. For structure (1), we recover the known result that Sinkhorn has poly(n,k) runtime; moreover, we provide the first poly(n,k) time algorithms for computing solutions that are exact and sparse. For structures (2)-(3), we give the first poly(n,k) time algorithms, even for approximate computation. Together, these three structures encompass many -- if not most -- current applications of MOT." @default.
- W4320343058 created "2023-02-13" @default.
- W4320343058 creator A5039466187 @default.
- W4320343058 creator A5091031925 @default.
- W4320343058 date "2020-08-07" @default.
- W4320343058 modified "2023-09-23" @default.
- W4320343058 title "Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure" @default.
- W4320343058 doi "https://doi.org/10.48550/arxiv.2008.03006" @default.
- W4320343058 hasPublicationYear "2020" @default.
- W4320343058 type Work @default.
- W4320343058 citedByCount "0" @default.
- W4320343058 crossrefType "posted-content" @default.
- W4320343058 hasAuthorship W4320343058A5039466187 @default.
- W4320343058 hasAuthorship W4320343058A5091031925 @default.
- W4320343058 hasBestOaLocation W43203430581 @default.
- W4320343058 hasConcept C111472728 @default.
- W4320343058 hasConcept C11413529 @default.
- W4320343058 hasConcept C114614502 @default.
- W4320343058 hasConcept C115903868 @default.
- W4320343058 hasConcept C126255220 @default.
- W4320343058 hasConcept C134306372 @default.
- W4320343058 hasConcept C138885662 @default.
- W4320343058 hasConcept C151376022 @default.
- W4320343058 hasConcept C162319229 @default.
- W4320343058 hasConcept C164226766 @default.
- W4320343058 hasConcept C177264268 @default.
- W4320343058 hasConcept C199360897 @default.
- W4320343058 hasConcept C2780586882 @default.
- W4320343058 hasConcept C311688 @default.
- W4320343058 hasConcept C33923547 @default.
- W4320343058 hasConcept C41008148 @default.
- W4320343058 hasConcept C55166926 @default.
- W4320343058 hasConcept C80444323 @default.
- W4320343058 hasConceptScore W4320343058C111472728 @default.
- W4320343058 hasConceptScore W4320343058C11413529 @default.
- W4320343058 hasConceptScore W4320343058C114614502 @default.
- W4320343058 hasConceptScore W4320343058C115903868 @default.
- W4320343058 hasConceptScore W4320343058C126255220 @default.
- W4320343058 hasConceptScore W4320343058C134306372 @default.
- W4320343058 hasConceptScore W4320343058C138885662 @default.
- W4320343058 hasConceptScore W4320343058C151376022 @default.
- W4320343058 hasConceptScore W4320343058C162319229 @default.
- W4320343058 hasConceptScore W4320343058C164226766 @default.
- W4320343058 hasConceptScore W4320343058C177264268 @default.
- W4320343058 hasConceptScore W4320343058C199360897 @default.
- W4320343058 hasConceptScore W4320343058C2780586882 @default.
- W4320343058 hasConceptScore W4320343058C311688 @default.
- W4320343058 hasConceptScore W4320343058C33923547 @default.
- W4320343058 hasConceptScore W4320343058C41008148 @default.
- W4320343058 hasConceptScore W4320343058C55166926 @default.
- W4320343058 hasConceptScore W4320343058C80444323 @default.
- W4320343058 hasLocation W43203430581 @default.
- W4320343058 hasLocation W43203430582 @default.
- W4320343058 hasOpenAccess W4320343058 @default.
- W4320343058 hasPrimaryLocation W43203430581 @default.
- W4320343058 hasRelatedWork W1500736818 @default.
- W4320343058 hasRelatedWork W1538818782 @default.
- W4320343058 hasRelatedWork W1905648941 @default.
- W4320343058 hasRelatedWork W1988529552 @default.
- W4320343058 hasRelatedWork W2004234313 @default.
- W4320343058 hasRelatedWork W2114616060 @default.
- W4320343058 hasRelatedWork W2385431910 @default.
- W4320343058 hasRelatedWork W2392953011 @default.
- W4320343058 hasRelatedWork W4320153962 @default.
- W4320343058 hasRelatedWork W342824375 @default.
- W4320343058 isParatext "false" @default.
- W4320343058 isRetracted "false" @default.
- W4320343058 workType "article" @default.