Jul 2026· Multiscale Modeling & Simulation· Vol 24, pp. 1096-1142· 0 citations· 54 references
TL;DR
This work revisits the framework of quantitative coarse graining and identifies the orthogonality condition from Legoll and Lelievre (2010) as a key criterion for constructing CVs that accurately preserve the statistical properties of the original process and introduces a general numerical method for designing neural network–based CVs that integrates tools from manifold learning with group-invariant featurization.
Abstract
Abstract.
Collective variables (CVs) play a crucial role in capturing rare events in high-dimensional systems, motivating the continual search for principled approaches to their design. In this work, we revisit the framework of quantitative coarse graining and identify the orthogonality condition from Legoll and Lelievre (2010) as a key criterion for constructing CVs that accurately preserve the statistical properties of the original process. We establish that satisfaction of the orthogonality condition enables error estimates for both relative entropy and pathwise distance to scale proportionally with the degree of scale separation. Building on this foundation, we introduce a general numerical method for designing neural network–based CVs that integrates tools from manifold learning with group-invariant featurization. To demonstrate the efficacy of our approach, we construct CVs for butane and achieve a CV that reproduces the antigauche transition rate with less than ten percent relative error and within two standard deviations of the empirically measured rate. Additionally, we provide empirical evidence challenging the necessity of uniform positive definiteness in diffusion tensors for transition rate reproduction and highlight the critical role of light atoms in CV design for molecular dynamics.
The arc of CV discovery is traced from intuition-driven heuristics to modern data-driven and generative frameworks, critically assess the strengths and limitations of each class of methods, and outline how the convergence of machine-learned potentials, automated CV learning, generative sampling, and causal interpretabi...
R. Talmazan, Cheng Giuseppe Chen, Chen-Yu Tang et al.· Digital Discovery· 0 citations
Two machine-learned representations are compared, DeepTICA and SPIB-VAE, with linear TICA for recovering steady-state observables from flawed distributions and a kinetic score computed from a coarse MSM at a resolution comparable to that used for RiteWeight random clustering is provided.
This work identifies the semantic bifurcation window - the precise temporal interval where joint and decomposed vector fields meaningfully diverge - and proposes surgical guidance, a hybrid sampling strategy that restricts exact multi-pass scoring strictly to this critical window.
This work develops a generative counterpart to the theory of benign overfitting and algorithmic regularization for overparameterized neural networks in the supervised lazy-training regime by studying denoising score matching in a vector-valued reproducing kernel Hilbert space with an inner-product kernel.
Hugo Latourelle-Vigeant, Sinho Chewi, Aram-Alexandre Pooladian et al.· 2 citations· ⚡1
The identification and reconstruction of the boundaries separating basins of attraction in multistable, multidimensional dynamical systems presents a fundamental challenge in computational dynamics. These structures govern transition pathways and other important large timescale behavior, yet they remain typically under...
Ellis R. Crabtree, Dimitris G. Giovanis, Anastasia S. Georgiou et al.· 0 citations
The success of machine learning in phase-transition problems does not rely on algorithmic complexity alone, but on tailoring the representation to respect the physical structure of the system, including its intrinsic constraints and symmetries.
L. T. Brito, G. Alves, F. W. S. Lima et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.