Matt Jacobs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matt Jacobs has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Inwon Kim
Department of Mathematics, UCLA, Los Angeles, USA
6 shared publications - Flavien Léger
ENS, PSL University, Paris, France
4 shared publications - Nicolás García Trillos
Department of Statistics, University of Wisconsin-Madison, Madison, USA
3 shared publications - Alpár Richárd Mészáros
Department of Mathematical Sciences, University of Durham, Durham, UK
2 shared publications Jakwang Kim
2 shared publications- Karthik Elamvazhuthi
Department of Mechanical Engineering University of California Riverside
2 shared publications
Latest Publications
- Open Access
- 15 September 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 210 (3) , 66
Asymptotic Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
We prove an explicit local linear rate for ADMM solving the isotropic Total Variation (TV) norm compressed sensing problem in multiple dimensions, by analyzing the auxiliary variable in the equivalent Douglas-Rachford splitting on a dual problem. Numerical verification on large 3D problems and real MRI data will be shown. The proven rate is not sharp, but it provides an explicit upper bound that appears close to the observed convergence rate in numerical experiments, although we do not claim this behavior holds in general.
- 15 September 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 210 (3) , 66
Open AccessAsymptotic Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
We prove an explicit local linear rate for ADMM solving the isotropic Total Variation (TV) norm compressed sensing problem in multiple dimensions, by analyzing the auxiliary variable in the equivalent Douglas-Rachford splitting on a dual problem. Numerical verification on large 3D problems and real MRI data will be shown. The proven rate is not sharp, but it provides an explicit upper bound that appears close to the observed convergence rate in numerical experiments, although we do not claim this behavior holds in general.
- 13 May 2026
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 250 (3) , 40
On the Singular Limit of Brinkman’s Law to Darcy’s Law
- 13 May 2026
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 250 (3) , 40
On the Singular Limit of Brinkman’s Law to Darcy’s Law
- Open Access
The Signed Wasserstein Barycenter Problem
Barycenter problems encode important geometric information about a metric space. While these problems are typically studied with positive weight coefficients associated to each distance term, more general signed Wasserstein barycenter problems have recently drawn a great deal of interest. These mixed sign problems have appeared in statistical inference setting as a way to generalize least squares regression to measure valued outputs and have appeared in numerical methods to improve the accuracy of Wasserstein gradient flow solvers. Unfortunately, the presence of negatively weighted distance terms destroys the Euclidean convexity of the unsigned problem, resulting in a much more challenging optimization task. The main focus of this work is to study properties of the signed barycenter problem for a general transport cost with a focus on establishing uniqueness of solutions. In particular, when there is only one positive weight, we extend the uniqueness result of Tornabene et al. (2025) to any cost satisfying a certain convexity property. In the case of arbitrary weights, we introduce the dual problem in terms of Kantorovich potentials and provide a sufficient condition for a stationary solution of the dual problem to induce an optimal signed barycenter.
Open AccessThe Signed Wasserstein Barycenter Problem
Barycenter problems encode important geometric information about a metric space. While these problems are typically studied with positive weight coefficients associated to each distance term, more general signed Wasserstein barycenter problems have recently drawn a great deal of interest. These mixed sign problems have appeared in statistical inference setting as a way to generalize least squares regression to measure valued outputs and have appeared in numerical methods to improve the accuracy of Wasserstein gradient flow solvers. Unfortunately, the presence of negatively weighted distance terms destroys the Euclidean convexity of the unsigned problem, resulting in a much more challenging optimization task. The main focus of this work is to study properties of the signed barycenter problem for a general transport cost with a focus on establishing uniqueness of solutions. In particular, when there is only one positive weight, we extend the uniqueness result of Tornabene et al. (2025) to any cost satisfying a certain convexity property. In the case of arbitrary weights, we introduce the dual problem in terms of Kantorovich potentials and provide a sufficient condition for a stationary solution of the dual problem to induce an optimal signed barycenter.
- 8 July 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 57 (4) , 3806-3839
Lagrangian Solutions to the Porous Media Equation and Reaction Diffusion Systems
In this paper, we construct global-in-time forward and backward Lagrangian flow maps along the pressure gradient generated by weak solutions of the porous media equation. The main difficulty is that when the initial data has compact support, it is well known that the pressure gradient is not a BV function. Thus, the theory of regular Lagrangian flows cannot be applied to construct the flow maps. To overcome this difficulty, we develop a new argument that combines Aronson–Bénilan type estimates with the quantitative Lagrangian flow theory of Crippa and De Lellis to show that certain doubly logarithmic quantities measuring the stability of flow maps do not blow up fast enough to prevent compactness. Our arguments are sufficiently flexible to handle the Hele–Shaw limit and a multispecies generalization of the porous media equation where the equation is replaced by a coupled hyperbolic-parabolic system of reaction diffusion equations. As one application of our flow maps, we are able to construct solutions where different species cannot mix together if they were separated at initial time.
- 8 July 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 57 (4) , 3806-3839
Lagrangian Solutions to the Porous Media Equation and Reaction Diffusion Systems
In this paper, we construct global-in-time forward and backward Lagrangian flow maps along the pressure gradient generated by weak solutions of the porous media equation. The main difficulty is that when the initial data has compact support, it is well known that the pressure gradient is not a BV function. Thus, the theory of regular Lagrangian flows cannot be applied to construct the flow maps. To overcome this difficulty, we develop a new argument that combines Aronson–Bénilan type estimates with the quantitative Lagrangian flow theory of Crippa and De Lellis to show that certain doubly logarithmic quantities measuring the stability of flow maps do not blow up fast enough to prevent compactness. Our arguments are sufficiently flexible to handle the Hele–Shaw limit and a multispecies generalization of the porous media equation where the equation is replaced by a coupled hyperbolic-parabolic system of reaction diffusion equations. As one application of our flow maps, we are able to construct solutions where different species cannot mix together if they were separated at initial time.
- 11 January 2025
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 249 (1) , 1-62
Regularity and Nondegeneracy for Tumor Growth with Nutrients
- 11 January 2025
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 249 (1) , 1-62
Regularity and Nondegeneracy for Tumor Growth with Nutrients
- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (11) , 11866-11873
A Score-Based Deterministic Diffusion Algorithm with Smooth Scores for General Distributions
Score matching based diffusion has shown to achieve the state of art results in generation modeling. In the original score matching based diffusion algorithm, the forward equation is a differential equation for which the probability density equation evolves according to a linear partial differential equation, the Fokker-Planck equation. A drawback of this approach is that one needs the data distribution to have a Lipschitz logarithmic gradient. This excludes a large class of data distributions that have a compact support. We present a deterministic diffusion process for which the vector fields are always Lipschitz and hence the score does not explode for probability measures with compact support. This deterministic diffusion process can be seen as a regularization of the porous media equation equation, which enables one to guarantee long term convergence of the forward process to the noise distribution. Though the porous media equation is itself not always guaranteed to have a Lipschitz vector field, it can be used to understand the closeness of the output of the algorithm to the data distribution as a function of the the time horizon and score matching error. This analysis enables us to show that the algorithm has better dependence on the score matching error than approaches based on stochastic diffusions. Using numerical experiments we verify our theoretical results on example one and two dimensional data distributions which are compactly supported. Additionally, we validate the approach on a modified MNIST data set for which the distribution is concentrated on a compact set. In each of the experiments, the approach using deterministic diffusion performs better that the diffusion algorithm with stochastic forward process, when considering the FID scores of the generated samples.
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (11) , 11866-11873
Open AccessA Score-Based Deterministic Diffusion Algorithm with Smooth Scores for General Distributions
Score matching based diffusion has shown to achieve the state of art results in generation modeling. In the original score matching based diffusion algorithm, the forward equation is a differential equation for which the probability density equation evolves according to a linear partial differential equation, the Fokker-Planck equation. A drawback of this approach is that one needs the data distribution to have a Lipschitz logarithmic gradient. This excludes a large class of data distributions that have a compact support. We present a deterministic diffusion process for which the vector fields are always Lipschitz and hence the score does not explode for probability measures with compact support. This deterministic diffusion process can be seen as a regularization of the porous media equation equation, which enables one to guarantee long term convergence of the forward process to the noise distribution. Though the porous media equation is itself not always guaranteed to have a Lipschitz vector field, it can be used to understand the closeness of the output of the algorithm to the data distribution as a function of the the time horizon and score matching error. This analysis enables us to show that the algorithm has better dependence on the score matching error than approaches based on stochastic diffusions. Using numerical experiments we verify our theoretical results on example one and two dimensional data distributions which are compactly supported. Additionally, we validate the approach on a modified MNIST data set for which the distribution is concentrated on a compact set. In each of the experiments, the approach using deterministic diffusion performs better that the diffusion algorithm with stochastic forward process, when considering the FID scores of the generated samples.
- Open Access
An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification
Despite the success of deep learning-based algorithms, it is widely known that neural networks may fail to be robust. A popular paradigm to enforce robustness is adversarial training (AT), however, this introduces many computational and theoretical difficulties. Recent works have developed a connection between AT in the multiclass classification setting and multimarginal optimal transport (MOT), unlocking a new set of tools to study this problem. In this paper, we leverage the MOT connection to propose computationally tractable numerical algorithms for computing universal lower bounds on the optimal adversarial risk and identifying optimal classifiers. We propose two main algorithms based on linear programming (LP) and entropic regularization (Sinkhorn). Our key insight is that one can harmlessly truncate the higher order interactions between classes, preventing the combinatorial run times typically encountered in MOT problems. We validate these results with experiments on MNIST and CIFAR-$10$, which demonstrate the tractability of our approach.
Open AccessAn Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification
Despite the success of deep learning-based algorithms, it is widely known that neural networks may fail to be robust. A popular paradigm to enforce robustness is adversarial training (AT), however, this introduces many computational and theoretical difficulties. Recent works have developed a connection between AT in the multiclass classification setting and multimarginal optimal transport (MOT), unlocking a new set of tools to study this problem. In this paper, we leverage the MOT connection to propose computationally tractable numerical algorithms for computing universal lower bounds on the optimal adversarial risk and identifying optimal classifiers. We propose two main algorithms based on linear programming (LP) and entropic regularization (Sinkhorn). Our key insight is that one can harmlessly truncate the higher order interactions between classes, preventing the combinatorial run times typically encountered in MOT problems. We validate these results with experiments on MNIST and CIFAR-$10$, which demonstrate the tractability of our approach.
- Open Access
Optimal Transport of Linear Systems over Equilibrium Measures
We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI system. In this case, the probability measures are singular with respect to the Lebesgue measure, thus not considered in previous results on optimal transport of linear systems. This problem is motivated by applications, such as robotics, where the initial and target configurations of robots, represented by measures, are in equilibrium or stationary. Despite the singular nature of the measures, for many cases of practical interest, we show that the Monge problem has a solution by applying classical optimal transport results. Moreover, the problem is computationally tractable even if the state space of the LTI system is moderately high in dimension, provided the equilibrium set lives in a low dimensional space. In fact, for an important subclass of linear quadratic problems, such as control of the double integrator with linear quadratic cost, the optimal transport map happens to coincide with that of the Euclidean cost. We demonstrate our results by computing the optimal transport map for the minimum energy cost for a two dimensional double integrator, despite the fact that the state space is four dimensional due to position and velocity variables.
Open AccessOptimal Transport of Linear Systems over Equilibrium Measures
We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI system. In this case, the probability measures are singular with respect to the Lebesgue measure, thus not considered in previous results on optimal transport of linear systems. This problem is motivated by applications, such as robotics, where the initial and target configurations of robots, represented by measures, are in equilibrium or stationary. Despite the singular nature of the measures, for many cases of practical interest, we show that the Monge problem has a solution by applying classical optimal transport results. Moreover, the problem is computationally tractable even if the state space of the LTI system is moderately high in dimension, provided the equilibrium set lives in a low dimensional space. In fact, for an important subclass of linear quadratic problems, such as control of the double integrator with linear quadratic cost, the optimal transport map happens to coincide with that of the Euclidean cost. We demonstrate our results by computing the optimal transport map for the minimum energy cost for a two dimensional double integrator, despite the fact that the state space is four dimensional due to position and velocity variables.
- 7 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 55 (6) , 6991-7023
Existence of Solutions to Reaction Cross Diffusion Systems
Reaction cross diffusion systems are a two species generalization of the porous media equation. These systems play an important role in the mechanical modeling of living tissues and tumor growth. Due to their mixed parabolic-hyperbolic structure, even proving the existence of solutions to these equations is challenging. In this paper, we exploit the parabolic structure of the system to prove the strong compactness of the pressure gradient in [Formula: see text]. The key ingredient is the energy dissipation relation, which, along with some compensated compactness arguments, allows us to upgrade weak convergence to strong convergence. As a consequence of the pressure compactness, we are able to prove the existence of solutions in a general setting and pass to the Hele-Shaw/incompressible limit in any dimension.
- 7 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 55 (6) , 6991-7023
Existence of Solutions to Reaction Cross Diffusion Systems
Reaction cross diffusion systems are a two species generalization of the porous media equation. These systems play an important role in the mechanical modeling of living tissues and tumor growth. Due to their mixed parabolic-hyperbolic structure, even proving the existence of solutions to these equations is challenging. In this paper, we exploit the parabolic structure of the system to prove the strong compactness of the pressure gradient in [Formula: see text]. The key ingredient is the energy dissipation relation, which, along with some compensated compactness arguments, allows us to upgrade weak convergence to strong convergence. As a consequence of the pressure compactness, we are able to prove the existence of solutions in a general setting and pass to the Hele-Shaw/incompressible limit in any dimension.
- Open Access
- 11 August 2023
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 29, 67
Well-posedness and regularity for a polyconvex energy
We prove the existence, uniqueness, and regularity of minimizers of a polyconvex functional in two and three dimensions, which corresponds to the H1-projection of measure-preserving maps. Our result introduces a new criteria on the uniqueness of the minimizer, based on the smallness of the lagrange multiplier. No estimate on the second derivatives of the pressure is needed to get a unique global minimizer. As an application, we construct a minimizing movement scheme to construct Lr-solutions of the Navier–Stokes equation (NSE) for a short time interval.
- 11 August 2023
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 29, 67
Open AccessWell-posedness and regularity for a polyconvex energy
We prove the existence, uniqueness, and regularity of minimizers of a polyconvex functional in two and three dimensions, which corresponds to the H1-projection of measure-preserving maps. Our result introduces a new criteria on the uniqueness of the minimizer, based on the smallness of the lagrange multiplier. No estimate on the second derivatives of the pressure is needed to get a unique global minimizer. As an application, we construct a minimizing movement scheme to construct Lr-solutions of the Navier–Stokes equation (NSE) for a short time interval.