Related papers: The sum of all width-one matrices
Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances…
Monotone gradient functions play a central role in solving the Monge formulation of the optimal transport (OT) problem, which arises in modern applications ranging from fluid dynamics to robot swarm control. When the transport cost is the…
Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…
In the geometric transportation problem, we are given a collection of points $P$ in $d$-dimensional Euclidean space, and each point is given a supply of $\mu(p)$ units of mass, where $\mu(p)$ could be a positive or a negative integer, and…
It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of…
In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…
For a given ground cost, approximating the Monge optimal transport map that pushes forward a given probability measure onto another has become a staple in several modern machine learning algorithms. The fourth-order Ma-Trudinger-Wang (MTW)…
We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…
This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear…
We consider the phase retrieval problem, which involves recovering a rank-one positive semidefinite matrix from rank-one measurements. A recently proposed algorithm based on Bures-Wasserstein gradient descent (BWGD) exhibits superlinear…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical solvers for discrete optimal transport. The challenge is to…
In this brief note, it is shown that the Bures-Wasserstein (BW) metric on the space positive definite matrices lends itself to convex optimization. In other words, the computation of the BW metric can be posed as a convex optimization…
This work analyzes the inverse optimal transport (IOT) problem under Bregman regularization. We establish well-posedness results, including existence, uniqueness (up to equivalence classes of solutions), and stability, under several…
Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…
Data sets in the form of binary matrices are ubiquitous across scientific domains, and researchers are often interested in identifying and quantifying noteworthy structure. One approach is to compare the observed data to that which might be…
We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where $c$ is a convex function on $R^d$ and $w_1x,...,w_dx$ are linear forms on $R^n$, $$\max \{c(w_1 x,...,w_d x):…
We introduce a convergent finite difference method for solving the optimal transportation problem on the sphere. The method applies to both the traditional squared geodesic cost (arising in mesh generation) and a logarithmic cost (arising…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…