Data-driven discovery of governing equations from spatiotemporal data offers a promising route to obtaining coarse-grained descriptions of complex dynamical systems. Here, we investigate the performance of PDE-SINDy for discovering phase-ordering dynamics using the Allen--Cahn equation as a benchmark and the Ising model with Glauber spin-flip dynamics as a microscopic system. We systematically analyze the effects of data availability, size of the candidate library, and noise on the efficiency of the equation discovery. We find that stability-selection PDE-SINDy can robustly identify the relevant terms in the governing dynamics even under limited or noisy data, while the recovered coefficient values are substantially more sensitive to these factors. We further show that enlarging the candidate library can strongly affect both term identification and coefficient recovery. Incorporating library bagging with stability selection reduces this sensitivity and improves the efficiency of equation discovery. For the Glauber spin flip Ising model dynamics, the resulting coarse-grained equation reproduces the characteristic phase-separation and coarsening dynamics of the underlying microscopic system. Overall, our results demonstrate the potential of PDE-SINDy for phase-ordering systems while highlighting the importance of carefully assessing the factors that influence the efficiency of equation discovery.
The simple exclusion process (SEP) is a paradigmatic model for nonequilibrium transport, yet its rich dynamics over an exponentially large configuration space remain notoriously intractable. Here, we leverage variational autoregressive networks to characterize the nonequilibrium dynamics of the symmetric (SSEP), asymme...
Zhi-Mao Liu, Jing Liu, Pandeng Zhang et al.· 1 citation
We investigate the analysis and phase ordering dynamics of the active Cahn--Hilliard equation, providing novel results beyond the current state of the art concerning the well-posedness and the characterization of its coarsening dynamics. We consider both regular polynomial and singular logarithmic potentials. In partic...
A fixed coarse-grained description need not uniquely determine the underlying microscopic rules. Variations in these rules can alter collective behaviour while leaving the retained observables unchanged. Here we develop a method to identify and use such variations for collective-state design. We construct families of m...
Establishing a robust and physically interpretable link between static structure and heterogeneous relaxation dynamics remains a fundamental challenge in glass physics. Here, we introduce a weighted pair-entropy descriptor based on the conventional two-body excess entropy. For this, we multiply the integrand used to ca...
Jun Wu, Walter Kob, Yu-Jie Wang et al.· 0 citations
We review recent theoretical and empirical advances that recast fish schooling within a statistical-physics framework, emphasizing how heterogeneous and time-dependent interactions govern collective motion. Building on extensions of Vicsek-type models to complex and weighted social networks, we show that topology and l...
Elena del Amo, M. Miguel, R. Pastor-Satorras· 0 citations
Characterizing dynamical organization in time series requires distinguishing the diversity of accessible states from uncertainty in their temporal transitions. Here we introduce a state-transition information space based on two normalized entropy measures derived from ordinal patterns: K_q, quantifying ordinal-state di...
D. T. Mihailović, Vijay P. Singh, Slavica Malinović-Milićević· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.