Ming Zhong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ming Zhong has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Mauro Maggioni
Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, USA
4 shared publications - Baoli Hao
Illinois Institute of Technology, Chicago, USA
3 shared publications - Annalisa Quaini
Department of Mathematics, University of Houston, 3551 Cullen Blvd, Houston TX 77204, USA
1 shared publication Benjamin Ganis
1 shared publication- Chun Liu
School of Earth Sciences and Engineering, Nanjing University, Nanjing, China
1 shared publication Fang Cheng
Chongqing Communication College
1 shared publication
Latest Publications
- Open Access
- 28 September 2026
- Published by Elsevier in SSRN Electronic Journal
Learning Interaction Kernels from Collective Steady States
We propose a learning procedure for system identification in interacting particle systems from single-snapshot observations of collective behaviors, unlike existing approaches that rely on observations of trajectories. This setting leads to a fundamentally ill-posed inverse problem, which we solve by using a regularization strategy based on the empirical distribution of observed configurations, drawn from different, unobserved initial conditions. We test our learning procedure on a variety of representative models with steady-state and quasi-stationary patterns, where collective behaviors encode implicit information about the interaction mechanisms, demonstrating that our approach enables stable and accurate recovery of the underlying interaction laws, leading to faithful reproduction of the collective behavior, and in many cases even of the dynamics leading up to it.
- 28 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLearning Interaction Kernels from Collective Steady States
We propose a learning procedure for system identification in interacting particle systems from single-snapshot observations of collective behaviors, unlike existing approaches that rely on observations of trajectories. This setting leads to a fundamentally ill-posed inverse problem, which we solve by using a regularization strategy based on the empirical distribution of observed configurations, drawn from different, unobserved initial conditions. We test our learning procedure on a variety of representative models with steady-state and quasi-stationary patterns, where collective behaviors encode implicit information about the interaction mechanisms, demonstrating that our approach enables stable and accurate recovery of the underlying interaction laws, leading to faithful reproduction of the collective behavior, and in many cases even of the dynamics leading up to it.
- Open Access
- 26 March 2026
- Published by Elsevier in SSRN Electronic Journal
Stability in Training PINNs for Stiff PDEs: Why Initial Conditions Matter
Training physics-informed neural networks (PINNs) on stiff, time-dependent PDEs remains a fundamental challenge due to optimization instabilities and gradient pathologies. Through a series of rigorous ablation studies and Neural Tangent Kernel (NTK) analysis, we identify that the exact enforcement of initial conditions (ICs) is a decisive factor in stabilizing the training landscape. We present the first systematic ablation of two core strategies: hard initial-condition constrained transformation and self-adaptive loss weighting. Our findings demonstrate that embedding ICs directly into the network architecture provides an implicit time-marching effect, effectively reducing spectral bias and enabling the solution of highly stiff benchmarks, including sharp transitions and high-frequency coupled systems. This work provides a scalable framework for developing reliable and physically-consistent neural solvers for complex mechanical systems.
- 26 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessStability in Training PINNs for Stiff PDEs: Why Initial Conditions Matter
Training physics-informed neural networks (PINNs) on stiff, time-dependent PDEs remains a fundamental challenge due to optimization instabilities and gradient pathologies. Through a series of rigorous ablation studies and Neural Tangent Kernel (NTK) analysis, we identify that the exact enforcement of initial conditions (ICs) is a decisive factor in stabilizing the training landscape. We present the first systematic ablation of two core strategies: hard initial-condition constrained transformation and self-adaptive loss weighting. Our findings demonstrate that embedding ICs directly into the network architecture provides an implicit time-marching effect, effectively reducing spectral bias and enabling the solution of highly stiff benchmarks, including sharp transitions and high-frequency coupled systems. This work provides a scalable framework for developing reliable and physically-consistent neural solvers for complex mechanical systems.
- 17 February 2026
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 36 (05) , 1019-1050
A finite element framework for simulating residential burglary in realistic urban geometries
We consider a partial differential equation (PDE) model to predict residential burglary derived from a probabilistic agent-based model through a mean-field limit operation. The PDE model is a nonlinear, coupled system of two equations in two variables (attractiveness of residential sites and density of criminals), similar to the Keller–Segel model for aggregation based on chemotaxis. Unlike previous works, which applied periodic boundary conditions, we enforce boundary conditions that arise naturally from the variational formulation of the PDE problem, i.e., the starting point for the application of a finite element method. These conditions specify the value of the normal derivatives of the system variables at the boundary. For the numerical solution of the PDE problem discretized in time and space, we propose a scheme that decouples the computation of the attractiveness from the computation of the criminal density at each time step, resulting in the solution of two linear algebraic systems per iteration. Through numerous numerical tests, we demonstrate the robustness and computational efficiency of this approach. Leveraging the flexibility allowed by the finite element method, we show results for spatially heterogeneous model parameters and a realistic geometry (city of Chicago). The paper includes a discussion of future perspectives to build multiscale, “multi-physics” models that can become a tool for the community. The robust and efficient code developed for this paper, which is shared open-source, is intended as the solid base for this broader research program.
- 17 February 2026
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 36 (05) , 1019-1050
A finite element framework for simulating residential burglary in realistic urban geometries
We consider a partial differential equation (PDE) model to predict residential burglary derived from a probabilistic agent-based model through a mean-field limit operation. The PDE model is a nonlinear, coupled system of two equations in two variables (attractiveness of residential sites and density of criminals), similar to the Keller–Segel model for aggregation based on chemotaxis. Unlike previous works, which applied periodic boundary conditions, we enforce boundary conditions that arise naturally from the variational formulation of the PDE problem, i.e., the starting point for the application of a finite element method. These conditions specify the value of the normal derivatives of the system variables at the boundary. For the numerical solution of the PDE problem discretized in time and space, we propose a scheme that decouples the computation of the attractiveness from the computation of the criminal density at each time step, resulting in the solution of two linear algebraic systems per iteration. Through numerous numerical tests, we demonstrate the robustness and computational efficiency of this approach. Leveraging the flexibility allowed by the finite element method, we show results for spatially heterogeneous model parameters and a realistic geometry (city of Chicago). The paper includes a discussion of future perspectives to build multiscale, “multi-physics” models that can become a tool for the community. The robust and efficient code developed for this paper, which is shared open-source, is intended as the solid base for this broader research program.
- Open Access
Learning Theory for Inferring Interaction Kernels in Second-Order Interacting Agent Systems
Modeling the complex interactions of systems of particles or agents is a fundamental scientific and mathematical problem that is studied in diverse fields, ranging from physics and biology, to economics and machine learning. In this work, we describe a very general second-order, heterogeneous, multivariable, interacting agent model, with an environment, that encompasses a wide variety of known systems. We describe an inference framework that uses nonparametric regression and approximation theory based techniques to efficiently derive estimators of the interaction kernels which drive these dynamical systems. We develop a complete learning theory which establishes strong consistency and optimal nonparametric min-max rates of convergence for the estimators, as well as provably accurate predicted trajectories. The estimators exploit the structure of the equations in order to overcome the curse of dimensionality and we describe a fundamental coercivity condition on the inverse problem which ensures that the kernels can be learned and relates to the minimal singular value of the learning matrix. The numerical algorithm presented to build the estimators is parallelizable, performs well on high-dimensional problems, and is demonstrated on complex dynamical systems.
Open AccessLearning Theory for Inferring Interaction Kernels in Second-Order Interacting Agent Systems
Modeling the complex interactions of systems of particles or agents is a fundamental scientific and mathematical problem that is studied in diverse fields, ranging from physics and biology, to economics and machine learning. In this work, we describe a very general second-order, heterogeneous, multivariable, interacting agent model, with an environment, that encompasses a wide variety of known systems. We describe an inference framework that uses nonparametric regression and approximation theory based techniques to efficiently derive estimators of the interaction kernels which drive these dynamical systems. We develop a complete learning theory which establishes strong consistency and optimal nonparametric min-max rates of convergence for the estimators, as well as provably accurate predicted trajectories. The estimators exploit the structure of the equations in order to overcome the curse of dimensionality and we describe a fundamental coercivity condition on the inverse problem which ensures that the kernels can be learned and relates to the minimal singular value of the learning matrix. The numerical algorithm presented to build the estimators is parallelizable, performs well on high-dimensional problems, and is demonstrated on complex dynamical systems.
- 16 May 2020
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 411, 132542
Data-driven discovery of emergent behaviors in collective dynamics
- 16 May 2020
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 411, 132542
Data-driven discovery of emergent behaviors in collective dynamics
- 28 June 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (29) , 14424-14433
Nonparametric inference of interaction laws in systems of agents from trajectory data
Inferring the laws of interaction in agent-based systems from observational data is a fundamental challenge in a wide variety of disciplines. We propose a nonparametric statistical learning approach for distance-based interactions, with no reference or assumption on their analytical form, given data consisting of sampled trajectories of interacting agents. We demonstrate the effectiveness of our estimators both by providing theoretical guarantees that avoid the curse of dimensionality and by testing them on a variety of prototypical systems used in various disciplines. These systems include homogeneous and heterogeneous agent systems, ranging from particle systems in fundamental physics to agent-based systems that model opinion dynamics under the social influence, prey–predator dynamics, flocking and swarming, and phototaxis in cell dynamics.
- 28 June 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (29) , 14424-14433
Nonparametric inference of interaction laws in systems of agents from trajectory data
Inferring the laws of interaction in agent-based systems from observational data is a fundamental challenge in a wide variety of disciplines. We propose a nonparametric statistical learning approach for distance-based interactions, with no reference or assumption on their analytical form, given data consisting of sampled trajectories of interacting agents. We demonstrate the effectiveness of our estimators both by providing theoretical guarantees that avoid the curse of dimensionality and by testing them on a variety of prototypical systems used in various disciplines. These systems include homogeneous and heterogeneous agent systems, ranging from particle systems in fundamental physics to agent-based systems that model opinion dynamics under the social influence, prey–predator dynamics, flocking and swarming, and phototaxis in cell dynamics.
- Open Access
Iterative Refinement of A Modified Lavrentiev Regularization Method for De-convolution of the Discrete Helmholtz Type Differential Filter
We propose and analyze an iterative refinement of a modified Lavrentiev regularization method for deconvolution of the discrete Helmholtz-type differential filter. The modification for the Lavrentiev regularization method exploits the properties of the Helmholtz filter, and we prove that the modification reduces the error bound between the original solution and the approximated solution. Furthermore, we derive an optimal stopping condition on the number of iterations necessary for the regularization. We provide numerical examples demonstrating the benefits of this iterative modified Lavrentiev regularization over a family of Tikhonov regularization methods.
Open AccessIterative Refinement of A Modified Lavrentiev Regularization Method for De-convolution of the Discrete Helmholtz Type Differential Filter
We propose and analyze an iterative refinement of a modified Lavrentiev regularization method for deconvolution of the discrete Helmholtz-type differential filter. The modification for the Lavrentiev regularization method exploits the properties of the Helmholtz filter, and we prove that the modification reduces the error bound between the original solution and the approximated solution. Furthermore, we derive an optimal stopping condition on the number of iterations necessary for the regularization. We provide numerical examples demonstrating the benefits of this iterative modified Lavrentiev regularization over a family of Tikhonov regularization methods.
- 1 September 2014
- Published by Trans Tech Publications, Ltd. in Applied Mechanics and Materials
- Vol. 644-650, 4095-4098
Two-Dimensional Reconstruction of Digital Human Images Based on Distributed Parallel Computing
Under the different client scales, distributed parallel computing were employed in the two-dimensional reconstruction for digital human images. Through this way, the speed ratio for reconstruction could be greatly improved but the serial processing and communication overhead restricted the further parallelize scale.
- 1 September 2014
- Published by Trans Tech Publications, Ltd. in Applied Mechanics and Materials
- Vol. 644-650, 4095-4098
Two-Dimensional Reconstruction of Digital Human Images Based on Distributed Parallel Computing
Under the different client scales, distributed parallel computing were employed in the two-dimensional reconstruction for digital human images. Through this way, the speed ratio for reconstruction could be greatly improved but the serial processing and communication overhead restricted the further parallelize scale.
- 1 January 2011
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 33 (3) , 1439-1474
A Stochastic Mortar Mixed Finite Element Method for Flow in Porous Media with Multiple Rock Types
This paper presents an efficient multiscale stochastic framework for uncertainty quantification in modeling of flow through porous media with multiple rock types. The governing equations are based on Darcy's law with nonstationary stochastic permeability represented as a sum of local Karhunen–Loève expansions. The approximation uses stochastic collocation on either a tensor product or a sparse grid, coupled with a domain decomposition algorithm known as the multiscale mortar mixed finite element method. The latter method requires solving a coarse scale mortar interface problem via an iterative procedure. The traditional implementation requires the solution of local fine scale linear systems on each iteration. We employ a recently developed modification of this method that precomputes a multiscale flux basis to avoid the need for subdomain solves on each iteration. In the stochastic setting, the basis is further reused over multiple realizations, leading to collocation algorithms that are more efficient than the traditional implementation by orders of magnitude. Error analysis and numerical experiments are presented.
- 1 January 2011
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 33 (3) , 1439-1474
A Stochastic Mortar Mixed Finite Element Method for Flow in Porous Media with Multiple Rock Types
This paper presents an efficient multiscale stochastic framework for uncertainty quantification in modeling of flow through porous media with multiple rock types. The governing equations are based on Darcy's law with nonstationary stochastic permeability represented as a sum of local Karhunen–Loève expansions. The approximation uses stochastic collocation on either a tensor product or a sparse grid, coupled with a domain decomposition algorithm known as the multiscale mortar mixed finite element method. The latter method requires solving a coarse scale mortar interface problem via an iterative procedure. The traditional implementation requires the solution of local fine scale linear systems on each iteration. We employ a recently developed modification of this method that precomputes a multiscale flux basis to avoid the need for subdomain solves on each iteration. In the stochastic setting, the basis is further reused over multiple realizations, leading to collocation algorithms that are more efficient than the traditional implementation by orders of magnitude. Error analysis and numerical experiments are presented.