Multimarginal Optimal Transport (MOT) has recently attracted significant interest due to its many applications. However, in most applications, the success of MOT is severely hindered by a lack of sub-exponential time algorithms. This paper develops a general theory about "structural properties" that make MOT tractable. We identify two such properties: decomposability of the cost into either (i) local interactions and simple global interactions; or (ii) low-rank interactions and sparse interactions. We also provide strong evidence that (iii) repulsive costs make MOT intractable by showing that several such problems of interest are NP-hard to solve-even approximately. These three structures are quite general, and collectively they encompass many (if not most) current MOT applications. We demonstrate our results on a variety of applications in machine learning, statistics, physics, and computational geometry.
Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix A, one may look at the spectrum of ψ(A) for a properly chosen ψ. The issue is that the spectrum of A might be contaminated by non-informational top eigenvalues, e.g., due to scale' variations in the data, and the application of ψ aims to remove these.Designing a good functional ψ (and establishing what good means) is often challenging and model dependent. This paper proposes a simple and generic construction for sparse graphs,where A denotes the adjacency matrix and r is an integer (less than the graph diameter). This produces a graph connecting vertices from the original graph that are within distance r, and is referred to as graph powering. It is shown that graph powering regularizes the graph and decontaminates its spectrum in the following sense: (i) If the graph is drawn from the sparse Erdős-Rényi ensemble, which has no spectral gap, it is shown that graph powering produces a "maximal" spectral gap, with the latter justified by establishing an Alon-Boppana result for powered graphs; (ii) If the graph is drawn from the sparse SBM, graph powering is shown to achieve the fundamental limit for weak recovery (the KS threshold) similarly to [Mas14], settling an open problem therein. Further, graph powering is shown to be significantly more robust to tangles and cliques than previous spectral algorithms based on self-avoiding or nonbacktracking walk counts [Mas14, MNS14, BLM15, AS15]. This is illustrated on a geometric block model that is dense in cliques. *
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.