相关论文: Dynamic Models of Wasserstein-1-Type Unbalanced Tr…
We study a rather general class of optimal "ballistic" transport problems for matrix-valued measures. These problems naturally arise, in the spirit of \emph{Y. Brenier. Comm. Math. Phys. (2018) 364(2) 579-605}, from a certain dual…
We propose a variational model with diffeomorphic optimal transportation for joint image reconstruction and motion estimation. The proposed model is a production of assembling the Wasserstein distance with the Benamou--Brenier formula in…
We propose a fast algorithm for the calculation of the Wasserstein-1 distance, which is a particular type of optimal transport distance with homogeneous of degree one transport cost. Our algorithm is built on multilevel primal-dual…
The balanced vehicular traffic model is a macroscopic model for vehicular traffic flow. We use this model to study the traffic dynamics at highway bottlenecks either caused by the restriction of the number of lanes or by on-ramps or…
In this note we introduce a new model for the mailing problem in branched transportation in order to allow the cost functional to take into account the orientation of the moving particles. This gives an effective answer to [Problem 15.9] of…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…
The transport approach is a useful tool to study dynamics of non-equilibrium systems. For heavy-ion collisions at intermediate energies, where both the smooth nucleon potential and the hard-core nucleon-nucleon collision are important, the…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
Modeling of urban traffic flows is required due to the complexity of their successful forecasting, as well as due to the impact of various random factors on them, and the complexity of transport systems in modern cities. Forecasting of…
We consider statistical methods which invoke a min-max distributionally robust formulation to extract good out-of-sample performance in data-driven optimization and learning problems. Acknowledging the distributional uncertainty in learning…
In recent years, the machine learning community has increasingly embraced the optimal transport (OT) framework for modeling distributional relationships. In this work, we introduce a sample-based neural solver for computing the Wasserstein…
We consider a Beckmann formulation of an unbalanced optimal transport (UOT) problem. The $\Gamma$-convergence of this formulation of UOT to the corresponding optimal transport (OT) problem is established as the balancing parameter $\alpha$…
Distributionally-robust optimization is often studied for a fixed set of distributions rather than time-varying distributions that can drift significantly over time (which is, for instance, the case in finance and sociology due to…
We propose a model to describe the optimal distributions of residents and services in a prescribed urban area. The cost functional takes into account the transportation costs (according to a Monge--Kantorovich-type criterion) and two…
We study a class of mass transport models where mass is transported in a preferred direction around a one-dimensional periodic lattice and is globally conserved. The model encompasses both discrete and continuous masses and parallel and…
A general nonlinear $1$st-order consensus-based solution for distributed constrained convex optimization is proposed with network resource allocation applications. The solution is used to optimize continuously-differentiable strictly convex…
This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed…
Obtaining solutions to Optimal Transportation (OT) problems is typically intractable when the marginal spaces are continuous. Recent research has focused on approximating continuous solutions with discretization methods based on i.i.d.…
The Euler and Navier-Stokes fluid mechanics equations are derived using a modified statistical mechanical approach using theory taken from the Chapman-Enskog perturbation analysis used to support the lattice Boltzmann method. Additional…
We consider a probabilistic model for large-scale task allocation problems for multi-agent systems, aiming to determine an optimal deployment strategy that minimizes the overall transport cost. Specifically, we assign transportation agents…