Related papers: Connections between Optimal Transport, Combinatori…
We consider the simultaneous optimal transportation of measures, where the target marginal is not necessarily fixed. For this problem, we prove the existence of a solution for completely regular spaces and investigate the structure of the…
We propose an optimal solution to a deterministic dynamic assignment problem by leveraging connections to the theory of discrete optimal transport to convert the combinatorial assignment problem into a tractable linear program. We seek to…
This paper investigates the connections between rectified flows, flow matching, and optimal transport. Flow matching is a recent approach to learning generative models by estimating velocity fields that guide transformations from a source…
An overview of recent results pertaining to the hydrodynamic description (both Newtonian and non-Newtonian) of granular gases described by the Boltzmann equation for inelastic Maxwell models is presented. The use of this mathematical model…
This paper proposes novel gradient-flow schemes that yield convergence to the optimal point of a convex optimization problem within a \textit{fixed} time from any given initial condition for unconstrained optimization, constrained…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
We consider a general optimal control problem in the setting of gradient flows. Two approximations of the problem are presented, both relying on the variational reformulation of gradient-flow dynamics via the Weighted-Energy-Dissipation…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
We derive novel results on the ergodic theory of irreducible, aperiodic Markov chains. We show how to optimally steer the network flow to a stationary distribution over a finite or infinite time horizon. Optimality is with respect to an…
We study the equivalence between the weighted least gradient problem and the weighted Beckmann minimal flow problem or equivalently, the optimal transport problem with Riemannian cost. Thanks to this equivalence, we prove existence and…
In this note, I review entropy-regularized Monge-Kantorovich problem in Optimal Transport, and derive the gradients of several popular algorithms popular in Computational Optimal Transport, including the Sinkhorn algorithms, Wasserstein…
Understanding the complex patterns in space-time exhibited by active systems has been the subject of much interest in recent times. Complementing this forward problem is the inverse problem of controlling active matter. Here we use optimal…
The motion of water is governed by the Navier-Stokes equations, which are complemented by the continuity equation to ensure local mass conservation. In this work, we construct the relativistic generalization of these equations through a…
The Hamiltonian formulation of superfluids based on noncanonical Poisson brackets is studied in detail. The assumption that the momentum density is proportional to the flow of the conserved energy is shown to lead to the covariant…
In this study, we investigate the linear transport of neutral system within the framework of relativistic kinetic theory. Under the relaxation time approximation, we obtain an iterative solution to the relativistic Boltzmann equation in…
We consider the problem to transport resources/mass while abiding by constraints on the flow through constrictions along their path between specified terminal distributions. Constrictions, conceptualized as toll stations at specified…
Hydrodynamic equations for a binary mixture of inelastic Maxwell models described by the Boltzmann equation are derived. The Navier-Stokes transport coefficients are {\em exactly} obtained by solving the Boltzmann equation from the…
We present a flow-based approach to the optimal transport (OT) problem between two continuous distributions $\pi_0,\pi_1$ on $\mathbb{R}^d$, of minimizing a transport cost $\mathbb{E}[c(X_1-X_0)]$ in the set of couplings $(X_0,X_1)$ whose…
This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally…
Much recent interest has focused on the design of optimization algorithms from the discretization of an associated optimization flow, i.e., a system of differential equations (ODEs) whose trajectories solve an associated optimization…