Search arXiv⌕ Search

arXiv subjects

Yongxin Chen

Publications and source records attributed to Yongxin Chen.

At least 199 records · Page 11Linked to original sources

Relaxed Schroedinger bridges and robust network routing

We consider network routing under random link failures with a desired final distribution. We provide a mathematical formulation of a relaxed transport problem where the final distribution only needs to be close to the desired one. The problem is a maximum entropy problem for path distributions with an extra terminal cost. We show that the unique solution may be obtained solving a generalized Schroedinger system. An iterative algorithm to compute the solution is provided. It contracts the Hilbert metric with contraction ratio less than 1/2 leading to extremely fast convergence.

math.OC↗

Measure-valued spline curves: an optimal transport viewpoint

The aim of this article is to introduce and address the problem to smoothly interpolate (empirical) probability measures. To this end, we lift the concept of a spline curve from the setting of points in a Euclidean space that that of probability measures, using the framework of optimal transport.

math.OC↗

Steering the distribution of agents in mean-field and cooperative games

The purpose of this work is to pose and solve the problem to guide a collection of weakly interacting dynamical systems (agents, particles, etc.) to a specified terminal distribution. The framework is that of mean-field and of cooperative games. A terminal cost is used to accomplish the task; we establish that the map between terminal costs and terminal probability distributions is onto. Our approach relies on and extends the theory of optimal mass transport and its generalizations.

eess.SY↗

On the Matrix Monge-Kantorovich Problem

The classical Monge-Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by the square of the Euclidean distance, one can define a metric on densities called the "Wasserstein distance." In this note, we formulate a natural matrix counterpart of the MK problem for positive definite density matrices. We prove a number of results about this metric including showing that it can be formulated as a convex optimization problem, strong duality, an analogue of the Poincare-Wirtinger inequality, and a Lax-Hopf-Oleinik type result.

math.FA↗

Efficient-robust routing for single commodity network flows

We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed initial and final marginals. From a computational standpoint, viewing scheduling this way is especially attractive in light of the existence of an iterative algorithm to compute the solution. The present paper builds on [13] by introducing an index of efficiency of a transportation plan and points, accordingly, to efficient-robust transport policies. In developing the theory, we establish two new invariance properties of the solution (called bridge) - an iterated bridge invariance property and the invariance of the most probable paths. These properties, which were tangentially mentioned in our previous work, are fully developed here. We also show that the distribution on paths of the optimal transport policy, which depends on a "temperature" parameter, tends to the solution of the "most economical" but possibly less robust optimal mass transport problem as the temperature goes to zero. The relevance of all of these properties for transport over networks is illustrated in an example.

math-ph↗

An Efficient Algorithm for Matrix-Valued and Vector-Valued Optimal Mass Transport

We present an efficient algorithm for recent generalizations of optimal mass transport theory to matrix-valued and vector-valued densities. These generalizations lead to several applications including diffusion tensor imaging, color images processing, and multi-modality imaging. The algorithm is based on sequential quadratic programming (SQP). By approximating the Hessian of the cost and solving each iteration in an inexact manner, we are able to solve each iteration with relatively low cost while still maintaining a fast convergent rate. The core of the algorithm is solving a weighted Poisson equation, where different efficient preconditioners may be employed. We utilize incomplete Cholesky factorization, which yields an efficient and straightforward solver for our problem. Several illustrative examples are presented for both the matrix and vector-valued cases.

math.NA↗

Vector-Valued Optimal Mass Transport

We introduce the problem of transporting vector-valued distributions. In this, a salient feature is that mass may flow between vectorial entries as well as across space (discrete or continuous). The theory relies on a first step taken to define an appropriate notion of optimal transport on a graph. The corresponding distance between distributions is readily computable via convex optimization and provides a suitable generalization of Wasserstein-type metrics. Building on this, we define Wasserstein-type metrics on vector-valued distributions supported on continuous spaces as well as graphs. Motivation for developing vector-valued mass transport is provided by applications such as multi-color image processing, polarimetric radar, as well as network problems where resources may be vectorial.

math.OC↗

Matricial Wasserstein-1 Distance

In this note, we propose an extension of the Wasserstein 1-metric ($W_1$) for matrix probability densities, matrix-valued density measures, and an unbalanced interpretation of mass transport. The key is using duality theory, in particular, a "dual of the dual" formulation of $W_1$. This matrix analogue of the Earth Mover's Distance has several attractive features including ease of computation.

math.FA↗

Interpolation of Density Matrices and Matrix-Valued Measures: The Unbalanced Case

In this note, we propose an unbalanced version of the quantum mechanical version of optimal mass transport that was based on the Lindblad equation. We formulate a natural interpolation framework between density matrices and matrix-valued measures via a quantum mechanical formulation of Fisher-Rao information and the matricial Wasserstein distance.

math.FA↗

Regularization and Interpolation of Positive Matrices

We consider certain matricial analogues of optimal mass transport of positive definite matrices of equal trace. The framework is motivated by the need to devise a suitable geometry for interpolating positive definite matrices in ways that allow controlling the apparent tradeoff between "aligning up their eigenstructure" and "scaling the corresponding eigenvalues". Indeed, motivation for this work is provided by power spectral analysis of multivariate time series where, linear interpolation between matrix-valued power spectra generates push-pop artifacts. Push-pop of power distribuion is objectionable as it corresponds to unrealistic response of scatterers.

math.OC↗

Matrix Optimal Mass Transport: A Quantum Mechanical Approach

In this paper, we describe a possible generalization of the Wasserstein 2-metric, originally defined on the space of scalar probability densities, to the space of Hermitian matrices with trace one, and to the space of matrix-valued probability densities. Our approach follows a computational fluid dynamical formulation of the Wasserstein-2 metric and utilizes certain results from the quantum mechanics of open systems, in particular the Lindblad equation. It allows determining the gradient flow for the quantum entropy relative to this matricial Wasserstein metric. This may have implications to some key issues in quantum information theory.

math-ph↗

Optimal steering of a linear stochastic system to a final probability distribution, Part III

The subject of this work has its roots in the so called Schroedginer Bridge Problem (SBP) which asks for the most likely distribution of Brownian particles in their passage between observed empirical marginal distributions at two distinct points in time. Renewed interest in this problem was sparked by a reformulation in the language of stochastic control. In earlier works, presented as Part I and Part II, we explored a generalization of the original SBP that amounts to optimal steering of linear stochastic dynamical systems between state-distributions, at two points in time, under full state feedback. In these works the cost was quadratic in the control input. The purpose of the present work is to detail the technical steps in extending the framework to the case where a quadratic cost in the state is also present. In the zero-noise limit, we obtain the solution of a (deterministic) mass transport problem with general quadratic cost.

eess.SY↗

Low-complexity modeling of partially available second-order statistics: theory and an efficient matrix completion algorithm

State statistics of linear systems satisfy certain structural constraints that arise from the underlying dynamics and the directionality of input disturbances. In the present paper we study the problem of completing partially known state statistics. Our aim is to develop tools that can be used in the context of control-oriented modeling of large-scale dynamical systems. For the type of applications we have in mind, the dynamical interaction between state variables is known while the directionality and dynamics of input excitation is often uncertain. Thus, the goal of the mathematical problem that we formulate is to identify the dynamics and directionality of input excitation in order to explain and complete observed sample statistics. More specifically, we seek to explain correlation data with the least number of possible input disturbance channels. We formulate this inverse problem as rank minimization, and for its solution, we employ a convex relaxation based on the nuclear norm. The resulting optimization problem is cast as a semidefinite program and can be solved using general-purpose solvers. For problem sizes that these solvers cannot handle, we develop a customized alternating minimization algorithm (AMA). We interpret AMA as a proximal gradient for the dual problem and prove sub-linear convergence for the algorithm with fixed step-size. We conclude with an example that illustrates the utility of our modeling and optimization framework and draw contrast between AMA and the commonly used alternating direction method of multipliers (ADMM) algorithm.

math.OC↗

Robust transport over networks

We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals. The random evolution is selected to be closest to a prior measure on paths in the relative entropy sense, i.e., a Schroedinger bridge between the two marginals. This is an atypical stochastic control problem where the control consists in suitably modifying the transition mechanism. The prior can incorporate cost of traversing edges or allocate equal probability to all paths of equal length connecting any two given nodes, i.e., a uniform measure on paths. This latter choice relies on the so-called Ruelle-Bowen random walk and gives rise to a scheduling that tends to utilize all paths as uniformly as the topology allows. Thus, when the Ruelle-Bowen law is taken as prior, the transportation plan tends to lessen congestion and ensure a level of robustness. We show that the Ruelle-Bowen law is itself a Schroedinger bridge albeit with a prior that is not a probability measure. The paradigm of Schroedinger bridges as a mechanism for scheduling transport on networks can be adapted to graphs that are not strongly connected as well as to weighted graphs. The latter leads to transportation plans that effect a compromise between robustness and transportation cost.

eess.SY↗

Stochastic control, entropic interpolation and gradient flows on Wasserstein product spaces

Since the early nineties, it has been observed that the Schroedinger bridge problem can be formulated as a stochastic control problem with atypical boundary constraints. This in turn has a fluid dynamic counterpart where the flow of probability densities represents an entropic interpolation between the given initial and final marginals. In the zero noise limit, such entropic interpolation converges in a suitable sense to the displacement interpolation of optimal mass transport (OMT). We consider two absolutely continuous curves in Wasserstein space ${\cal W}_2$ and study the evolution of the relative entropy on ${\cal W}_2\times {\cal W}_2$ on a finite time interval. Thus, this study differs from previous work in OMT theory concerning relative entropy from a fixed (often equilibrium) distribution (density). We derive a gradient flow on Wasserstein product space. We find the remarkable property that fluxes in the two components are opposite. Plugging in the "steepest descent" into the evolution of the relative entropy we get what appears to be a new formula: The two flows approach each other at a faster rate than that of two solutions of the same Fokker-Planck. We then study the evolution of relative entropy in the case of uncontrolled-controlled diffusions. In two special cases of the Schroedinger bridge problem, we show that such relative entropy may be monotonically decreasing or monotonically increasing.

math.PR↗

The role of the time-arrow in mean-square estimation of stochastic processes

The purpose of this paper is to explain a certain dichotomy between the information that the past and future values of a multivariate stochastic process carry about the present. More specifically, vector-valued, second-order stochastic processes may be deterministic in one time-direction and not the other. This phenomenon, which is absent in scalar-valued processes, is deeply rooted in the geometry of the shift-operator. The exposition and the examples we discuss are based on the work of Douglas, Shapiro and Shields on cyclic vectors of the backward shift and relate to classical ideas going back to Wiener and Kolmogorov. We focus on rank-one stochastic processes for which we present a characterization of all regular processes that are deterministic in the reverse time-direction. The paper builds on examples and the goal is to provide pertinent insights to a control engineering audience.

math.OC↗

Fast cooling for a system of stochastic oscillators

We study feedback control of coupled nonlinear stochastic oscillators in a force field. We first consider the problem of asymptotically driving the system to a desired {\em steady state} corresponding to reduced thermal noise. Among the feedback controls achieving the desired asymptotic transfer, we find that the most efficient one {from an energy point of view} is characterized by {\em time-reversibility}. We also extend the theory of Schrödinger bridges to this model, thereby steering the system in {\em finite time} and with minimum effort to a target steady-state distribution. The system can then be maintained in this state through the optimal steady-state feedback control. The solution, in the finite-horizon case, involves a space-time harmonic function $φ$, and $-\logφ$ plays the role of an artificial, time-varying potential in which the desired evolution occurs. This framework appears extremely general and flexible and can be viewed as a considerable generalization of existing active control strategies such as macromolecular cooling. In the case of a quadratic potential, the results assume a form particularly attractive from the algorithmic viewpoint as the optimal control can be computed via deterministic matricial differential equations. An example involving inertial particles illustrates both transient and steady state optimal feedback control.

math-ph↗

Entropic and displacement interpolation: a computational approach using the Hilbert metric

Monge-Kantorovich optimal mass transport (OMT) provides a blueprint for geometries in the space of positive densities -- it quantifies the cost of transporting a mass distribution into another. In particular, it provides natural options for interpolation of distributions (displacement interpolation) and for modeling flows. As such it has been the cornerstone of recent developments in physics, probability theory, image processing, time-series analysis, and several other fields. In spite of extensive work and theoretical developments, the computation of OMT for large scale problems has remained a challenging task. An alternative framework for interpolating distributions, rooted in statistical mechanics and large deviations, is that of Schroedinger bridges (entropic interpolation). This may be seen as a stochastic regularization of OMT and can be cast as the stochastic control problem of steering the probability density of the state-vector of a dynamical system between two marginals. In this approach, however, the actual computation of flows had hardly received any attention. In recent work on Schroedinger bridges for Markov chains and quantum evolutions, we noted that the solution can be efficiently obtained from the fixed-point of a map which is contractive in the Hilbert metric. Thus, the purpose of this paper is to show that a similar approach can be taken in the context of diffusion processes which i) leads to a new proof of a classical result on Schroedinger bridges and ii) provides an efficient computational scheme for both, Schroedinger bridges and OMT. We illustrate this new computational approach by obtaining interpolation of densities in representative examples such as interpolation of images.

math.OC↗