Ming Zhong

Ming Zhong

Auto-generated profile, based on publicly available information

Ming Zhong

Illinois Institute of Technology

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2023 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BHBaoli Hao
Baoli Hao
MZMing Zhong
Ming Zhong
KOKevin P. O'Keeffe
Kevin P. O'Keeffe
We study a population of swarmalators, mobile variants of phase oscillators, which run on a ring and have both attractive and repulsive interactions. This one-dimensional (1D) swarmalator model produces several of collective states: the standard sync and async states as well as a splaylike “polarized” state and several unsteady states such as active bands or swirling. The model's simplicity allows us to describe some of the states analytically. The model can be considered as a toy model for real-world swarmalators such as vinegar eels and sperm which swarm in quasi-1D geometries.

13 June 2023 in Sampling Theory, Signal Processing, and Data Analysis
Verified
Journal Article
Open access
PDF file
JMJason Miller
Jason Miller
STSui Tang
Sui Tang
MZMing Zhong
Ming Zhong
MMMauro Maggioni
Mauro Maggioni
Modeling the complex interactions of systems of particles or agents is a fundamental problem across the sciences, from physics and biology, to economics and social sciences. In this work, we consider second-order, heterogeneous, multivariable models of interacting agents or particles, within simple environments. We describe a nonparametric inference framework to efficiently estimate the latent interaction kernels which drive these dynamical systems. We develop a 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 optimal rates only depends on intrinsic dimension of interactions, which is typically much smaller than the ambient dimension. Our arguments are based on a coercivity condition which ensures that the interaction kernels can be estimated in stable fashion. The numerical algorithm presented to build the estimators is parallelizable, performs well on high-dimensional problems, and its performance is tested on a variety of complex dynamical systems.

10 October 2022 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
SFSimon Foucart
Simon Foucart
ETEitan Tadmor
Eitan Tadmor
MZMing Zhong
Ming Zhong

29 June 2024
Verified
Book Chapter
Closed access
PDF file
JFJinchao Feng
Jinchao Feng
MZMing Zhong
Ming Zhong

12 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
Bin DuanBin Duan
Bin Duan
MZMing Zhong
Ming Zhong
YYYan Yan
Yan Yan
With recent advances in computing hardware and surges of deep-learning architectures, learning-based deep image registration methods have surpassed their traditional counterparts, in terms of metric performance and inference time. However, these methods focus on improving performance measurements such as Dice, resulting in less attention given to model behaviors that are equally desirable for registrations, especially for medical imaging. This paper investigates these behaviors for popular learning-based deep registrations under a sanity-checking microscope. We find that most existing registrations suffer from low inverse consistency and nondiscrimination of identical pairs due to overly optimized image similarities. To rectify these behaviors, we propose a novel regularization-based sanity-enforcer method that imposes two sanity checks on the deep model to reduce its inverse consistency errors and increase its discriminative power simultaneously. Moreover, we derive a set of theoretical guarantees for our sanity-checked image registration method, with experimental results supporting our theoretical findings and their effectiveness in increasing the sanity of models without sacrificing any performance. Our code and models are available at https://github.com/tuffr5/Saner-deep-registration.

5 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
JFJinchao Feng
Jinchao Feng
MZMing Zhong
Ming Zhong
We present a comprehensive examination of learning methodologies employed for the structural identification of dynamical systems. These techniques are designed to elucidate emergent phenomena within intricate systems of interacting agents. Our approach not only ensures theoretical convergence guarantees but also exhibits computational efficiency when handling high-dimensional observational data. The methods adeptly reconstruct both first- and second-order dynamical systems, accommodating observation and stochastic noise, intricate interaction rules, absent interaction features, and real-world observations in agent systems. The foundational aspect of our learning methodologies resides in the formulation of tailored loss functions using the variational inverse problem approach, inherently equipping our methods with dimension reduction capabilities.