The DOI matches its Crossref record; 112 of the 112 references it cites were found in a registry or an index; none of the 68 sources its claims cite is checked for support yet.
Unsupervised machine learning in atomistic simulations, between predictions and understanding
Open accessAbstract
Automated analyses of the outcome of a simulation have been an important part of atomistic modeling since the early days, addressing the need of linking the behavior of individual atoms and the collective properties that are usually the final quantity of interest. Methods such as clustering and dimensionality reduction have been used to provide a simplified, coarse-grained representation of the structure and dynamics of complex systems from proteins to nanoparticles. In recent years, the rise of machine learning has led to an even more widespread use of these algorithms in atomistic modeling and to consider different classification and inference techniques as part of a coherent toolbox of data-driven approaches. This perspective briefly reviews some of the unsupervised machine-learning methods—that are geared toward classification and coarse-graining of molecular simulations—seen in relation to the fundamental mathematical concepts that underlie all machine-learning techniques. It discusses the importance of using concise yet complete representations of atomic structures as the starting point of the analyses and highlights the risk of introducing preconceived biases when using machine learning to rationalize and understand structure-property relations. Supervised machine-learning techniques that explicitly attempt to predict the properties of a material given its structure are less susceptible to such biases. Current developments in the field suggest that using these two classes of approaches side-by-side and in a fully integrated mode, while keeping in mind the relations between the data analysis framework and the fundamental physical principles, will be key to realizing the full potential of machine learning to help understand the behavior of complex molecules and materials.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
This perspective reviews unsupervised machine-learning methods for atomistic simulations—clustering and dimensionality reduction—and argues they are powerful but strongly dependent on structural representations and hyperparameter choices. It recommends validating and optimizing unsupervised analyses through supervised learning tasks to reduce preconceived biases and improve understanding of structure–property relations.
Key findings
- Unsupervised schemes such as clustering and dimensionality reduction can identify structural motifs and coarse-grained states, but their outcome depends crucially on the feature space, metric, or kernel; non-linear transformations can split, merge, create, or destroy local maxima in the probability distribution.
- The paper states that for real data there is no “ground truth” for what partitioning or low-dimensional representation is best, and analyses often require human intervention in algorithm design and hyperparameter tuning, risking tuning until results match expectations.
- Supervised learning can provide objective metrics for unsupervised representations: checking how accurately a property can be predicted, analyzing learning curves, optimizing hyperparameters, and benchmarking order parameters against the committor in biomolecular simulations.
- The paper argues that combining supervised and unsupervised approaches side-by-side is key, with examples including Markov-state models, materials cartography, accelerated sampling, and structure searches; no original numerical results are reported.
Methods
- Perspective/review article; no new primary data, simulations, or experiments are reported.
- Reviews mathematical foundations of representations, distances/kernels, clustering, dimensionality reduction, and applications in atomistic modeling.
- Synthesizes literature and author opinion rather than performing a systematic quantitative meta-analysis.
Limitations
- The paper states that unsupervised learning lacks ground truth for real data and is sensitive to representation and hyperparameters; manual intervention can introduce preconceived biases.
- The paper states that supervised validation is proposed as a mitigation, but this is presented as the author’s opinion and not as a fully solved problem.
- Evident from the text: as a perspective, it provides no new numerical benchmarks or empirical validation, and its conclusions are based on literature synthesis and the author’s viewpoint.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 68 cited sources checked · 0 supported · 0 flagged
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In all honesty, most of the time the analyses did require a significant amount of human intervention, first in the design of the details of the classification/dimensionality reduction algorithm, and later in the choice of the hyperparameters that define the structural representation and tune the functioning of the machine learning scheme.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIn the paper
“When considering the nitrogen-substituted analogues of pentacene, however, we found that the most clear-cut clustering was associated with in-plane H-bonding rather than with the stacking.”
What the sources say
- Not checked yetcites [84] 2018, Chem. Sci. source
Strength:boosted· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIn the paper
“we have recently developed a generalized convex hull (GCH) construction 113 that uses (kernel) principal component analysis to determine the structural parameters that capture the highest degree of diversity in a collection of (meta)stable structures.”
What the sources say
- Not checked yetcites [113] A. Wieczorek , M.Wieser, D.Murezzan, and V.Roth, “Learning sparse latent representations with the deep copula information bottleneck,” e-print arXiv:1804.06216 (2018).
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Supervised machine-learning techniques, that explicitly attempt to predict the properties of a material given its structure, are less susceptible to such biases.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“A second reason - that is particularly relevant for unsupervised-learning applications geared towards simplifying the description of complex systems - is that the choice of representation provides ample leeway to incorporate prior knowledge or to otherwise restrict the scope of the analysis.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The main downside with using raw atomic coordinates as an input representation is precisely the fact that they discriminate between structures that are physically indistinguishable.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In closing this brief overview, it should be stressed that all of these techniques depend crucially on the choice of the feature space, and/or the metric that is used to estimate the similarity between inputs.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Machinelearning representations that are based on the description of local motifs, rather than on a conventional characterization of the system in terms of its lattice parameters and minimal unit cell, are very convenient, because they simplify the task of recognizing structures that correspond to alternative descriptions of the same periodic configuration (e.g. a conventional versus a primitive f”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIn the paper
“While the cost and effectiveness of different representations may vary, one can demonstrate that most of these schemes can be seen as a specific implementation of a very abstract density-based scheme, in which a ket |A〉 is associated to each configuration 37 ,”
What the sources say
- Not checked yetcites [37] 2019, J. Chem. Phys. source
Strength:boosted· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The connection between density peaks and minima in the free energy makes density-based clustering methods (Fig. 3b) particularly well-suited to the analysis of finitetemperature atomistic simulations.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- It may state two separate claims as one. 14
- Probably not a substantial claim. 30
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In other terms Eq. (1) reproduces exactly the value of the kernel for each structure in the reference set, and provides a practical approximation of the vector |X〉 associated with the kernel for any other structure.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Obviously, opting for a specialized description of a system introduces some biases in the procedure.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“From a formal point of view, the representer theorem guarantees that each positive-definite kernel 14 is associated with a Hilbert space whose scalar product 〈X|X ′ 〉 equals the kernel, and it is always possible to convert a kernel into a metric, e.g. by the relation d ( X , X ′ ) 2 = k ( X , X ) + k ( X ′ , X ′ ) -2 k ( X , X ′ ).”
What the sources say
- Not checked yetcites [14] M. Cuturi , e-print arXiv:0911.5367 (2009).
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is worth stressing that the representation of a structure can take the form of a vector of features |X〉 (e.g. all the backbone dihedrals in a protein, the coordination number of atoms in a cluster, etc.), a measure of similarity between pairs of structures that can be implemented as a distance d ( X , X ′ ), or the form of a kernel k ( X , X ′ ). In fact, these three ways of representing a data”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Given a representation in terms of a finite set of features x j ( X ) = 〈 j |X〉 , it is always possible to use it as the starting point to define a distance or a kernel.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Such a unifying view of input representations helps to understand the limits and strengths of each particular representation - for instance how SOAP power spectra components are systematic but overdetermined, and how Behler-Parrinello symmetry functions are highly correlated with each other.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is however hard if not impossible to comprehend - not to mention visualize - the meaning or the relative positions of vectors in a high (or infinite) dimensional space.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“The problem of obtaining a complete yet concise description of a molecular or condensed-phase structure is central to many modelling techniques, including the sampling of rare events 15 and the search for stable structures 2,16,17 .”
What the sources say
Strength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“One may argue that given sufficient amounts of training data a good ML scheme should be able to recognize these invariances, but why bother: most of the state-ofthe-art representations incorporate symmetries and by using them you can let your 20-layer convolutional neural network focus on learning correlations that are not as obvious.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Clustering techniques identify agglomeration of data in the most significant regions of feature space, but do not offer an overall picture of the relations between different structures.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the context of unsupervised learning it is often performed manually, by trial and error, and constitutes one of the critical points to consider to keep the procedure truly unbiased.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This is a problem that obviously transcends the specific application to chemistry, physics or materials science, and dimensionality-reduction methods have long been sought after for all sorts of data analysis applications.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Obviously, the separation is far from clear-cut, and it is often possible to construct a local version of a global representation 25 , and vice versa to assemble local kernels and feature vectors into a representation of entire structures 32 .”
What the sources say
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The use of local, atom/fragment-based representations is also convenient to find recurring patterns in the building blocks of a structure, rather than in the overall configuration.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we will discuss below, the risk of introducing spurious features can be mitigated by using general-purpose, relatively simple functions of the atomic coordinates as the input representation, and by checking that clustering is insensitive to the choice feature space, kernel or metric.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In principle, the information on the absolute position of each input in space, and the relations between any given pair of inputs, are encoded fully in the feature vectors.”
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Non-linear transformations of the input space, or of the measure of similarity, introduce distortions that can easily split, merge, create and destroy local maxima in the probability distribution associated with the input set.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“dimensionality reduction lies at the heart of the vast majority of accelerated sampling methods, which try to beat the time scale problem of molecular simulations”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“The idea that the data may lie on a manifold that is only low-dimensional on a local basis is also behind methods such as locally-linear embedding (LLE) 76”
What the sources say
- Not checked yetcites [76] 2000, Science source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The time-lagged independent component analysis method (TICA) 80,81 identifies linear combinations of features from a time-dependent trajectory that not only have the largest variance, but that also have the longest autocorrelation time”
What the sources say
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Rests on an assumption: The most relevant degrees of freedom for a system are those in which the dynamics are slower.
In the paper
“the spectral gap optimization of order parameters (SGOOP) method to single out the linear combination of input features that correspond to the direction that is most relevant for the long-time dynamics of the system being studied 82”
What the sources say
- Not checked yetcites [82] 2016, Proc. Natl. Acad. Sci. U. S. A. source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Rests on an assumption: The most relevant degrees of freedom for a system are those in which the dynamics are slower.
None of the sources cited for this claim have been checked yet.
In the paper
“'Materials cartography', as it has been referred to 57 , strives to obtain a low-dimensional (typically 2D) representation of a set of materials, or of different phases of the same material, that reflects the 'structureenergy-property' landscape 84,85 of that system.”
What the sources say
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Similar approaches have been applied to biomolecular simulations 86 , where the main application of dimensionality reduction has been in connection with accelerated sampling.”
What the sources say
- Not checked yetcites [86] 2012, J. Mol. Graphics Modell. source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All of the methods discussed this far rely exclusively on the distribution of atoms in each structure.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“ISOMAP 75 uses a neighborhood analysis to estimate geodesic distances between points, based on the assumption that the data lies on a curved, but locally low-dimensional, manifold.”
What the sources say
- Not checked yetcites [75] 2000, Science source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The applications of dimensionality reduction schemes to atomistic simulations reflect the dual function of a coarse-grained representation, as a mean to simplify the description of a system to understand it better, and to explore more effectively its conformational space.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
None of the sources cited for this claim have been checked yet.
In the paper
“In order to observe a rare (activated) event without developing dedicated hardware 1 one needs to selectively increase the speed at which the pathways related to the transition are traversed 51,87,88 , to modify the probability distribution that is sampled during the simulation so that configurations that are close to the transition state occur more often 15,89 , or to generate adaptively ens”
What the sources say
- Not checked yetcites [1] 2009
- Not checked yetcites [51] 2002, Annu. Rev. Mater. Res. source
- Not checked yetcites [87] 2002, Annu. Rev. Phys. Chem. source
- Not checked yetcites [88] 2008, J. Phys. Chem. B source
- Not checked yetcites [15] 2002, Proc. Natl. Acad. Sci. U. S. A. source
- Not checked yetcites [89] 1977, J. Comput. Phys. source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Take for instance the case of metadynamics, in which a repulsive bias is accumulated in locations that have already been visited during the trajectory, forcing the system out of free energy minima 93,94 . The volume of one of these minima grows exponentially with the dimensionality d of collective variable space, and so does the time to accumulate sufficient bias to escape the freeenergy basin.”
What the sources say
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Either way, the objective is to accelerate sampling while introducing a minimal disturbance to the natural behavior of the system 91”
What the sources say
- Not checked yetcites [91] 2013, Phys. Rev. Lett. source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The accuracy of the regression model also provides an objective metric to optimize the hyperparameters that define the representation 107 , and even to determine the most effective non-linear function of features that reproduces the target properties 108 .”
What the sources say
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is then tempting to pick one own's arbitrary perception of what an 'insightful' outcome of the analysis would be, and tune the representation and machine-learning scheme until the results reflect most clearly one's expectations.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For starters, it gives an idea of the limiting accuracy that can be expected when inferring structureproperty relations by application of unsupervised classification or coarse-graining schemes.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
None of the sources cited for this claim have been checked yet.
In the paper
“Clustering can be used to select the most relevant reference configurations from a database 109 , or to partition it into regions on which specialized models can be trained. 110”
What the sources say
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“A low-dimensional representation of a dataset can help when it comes to identifying problematic regions, and understanding how a given representation 'sees' a set of structures 58,104,111 .”
What the sources say
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Choosing to describe the inputs using a feature vector that is not problem specific, and validating and optimizing it through a relevant supervised learning exercise, reduces substantially the amount of human intervention and the possibility of introducing preconceived biases when applying clustering and dimensionality reduction schemes.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Unsupervised schemes can help shed light on the functioning of supervised algorithms that are often opaque, and supervised schemes can help to formulate quantitative metrics to assess the performance of unsupervised learning.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper relies on this without support.
In biomolecular simulations, entropically-stabilized states are the norm rather than the exception.
“particularly in the case of biomolecular simulations in which entropically-stabilized states are the norm rather than the exception.”
The paper relies on this without support.
In crystalline materials with few defects, local minima on the potential energy surface unequivocally identify the meta-stable states of the system.
“This is because in crystalline materials with few defects local minima on the potential energy surface unequivocally identify the meta-stable states of the system.”
The paper relies on this without support.
The most relevant degrees of freedom for a system are those in which the dynamics are slower.
“It is often the case, however, that the most relevant degrees of freedom for a system are those in which the dynamics are slower.”
The paper relies on this without support.
The complexity of simulations is increasing for materials, chemical and biomolecular applications.
“as the complexity of simulations is increasing for materials, chemical and biomolecular applications.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“ML models, analysis of their key features (32,52), and dimensionality reduction (i.e., unsupervised learning) (53-56) represent important tools for building structure-property relationships and mapping chemical space (57).”
From Machine Learning for the Discovery, Design, and Engineering of Materials. (2022) · cites this paper as [56]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
PCA input vectors are described as d-dimensional
MinorThe text defines x_i as a D-dimensional input vector and s_i as its d-dimensional principal-component representation. It later calls the x_i vectors d-dimensional.
“Another way to interpret PCA is to see { x i } as the set of d -dimensional points”
“Given a set of D -dimensional input vectors x i associated with N structures or local environments, PCA identifies the d linear combinations of the feature components that capture the largest possible fraction of the variability of the dataset (Fig. 4a).”
LLE discussion points to the wrong figure panel
MinorThe LLE discussion points to Fig. 4c, but the caption assigns local-relation-preserving embedding methods to Fig. 4d; Fig. 4c is assigned to multidimensional scaling.
“and then by imposing self-consistently that each point in low dimension should be a combination of its neighbors using the same weights (Fig. 4c)”
“(c) Multi-dimensional scaling and related approaches attempt to reproduce the similarity between high-dimensional data points in low dimension. (d) Embedding methods explicitly try to preserve local relations between points, under the assumption that they lie on a (locally) low-dimensional manifold.”
Citations
Cites
(2008) · Journal of Machine Learning Research · Cited by 33,051
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Commentary: The Materials Project: A materials genome approach to accelerating materials innovation
Jain, A., Ong, S. P., Hautier, G., Chen, W., Richards, W. D., Dacek, S., Cholia, S., Gunter, D., Skinner, D., Ceder, G., et al. (2013) · APL Materials · doi:10.1063/1.4812323 · Cited by 13,094
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A. J., & Müller, K. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,196
Nonphysical sampling distributions in Monte Carlo free-energy estimation: Umbrella sampling
Torrie, G. M., & Valleau, J. P. (1977) · Journal of Computational Physics · doi:10.1016/0021-9991(77)90121-8 · Cited by 6,091
Laio, A., & Parrinello, M. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.202427399 · Cited by 5,626
Generalized Neural-Network Representation of High-Dimensional Potential-Energy Surfaces
Behler, J., & Parrinello, M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.146401 · Cited by 5,010
Machine learning for molecular and materials science
Butler, K. T., Davies, D. W., Cartwright, H., Isayev, O., & Walsh, A. (2018) · Nature · doi:10.1038/s41586-018-0337-2 · Cited by 4,968
Clustering by fast search and find of density peaks
Rodríguez, Á., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,963
Flagged first, then by citations
Research works printed but not linked: 7
- 2016, The God Delusion
- 2011, Pattern Recognition and Machine Learning (Information Science and Statistics)
- 2006, Gaussian Processes for Machine Learning
- 2003, Energy Landscapes: Applications to Clusters, Biomolecules and Glasses
- H. Huo and M.Rupp, e-print arxiv:1704.06439 (2017). · arXiv
- 2010, Multidimensional Scaling
- 2008, J. Mach. Learn. Res., 9, 2579
Cited by
Sorted by citations
Items 101–173 of 173
Algorithmic graph theory for post-processing molecular dynamics trajectories
Bougueroua, S., Aboulfath, Y., Barth, D., & Gaigeot, M. (2023) · Molecular Physics · doi:10.1080/00268976.2022.2162456 · Cited by 11
Ishraaq, R., Akash, T. S., & Das, S. (2024) · Macromolecules · doi:10.1021/acs.macromol.3c02539 · Cited by 11
Quantum Chemistry Meets Machine Learning
Fabrizio, A., Meyer, B., Fabregat, R., & Corminbœuf, C. (2019) · CHIMIA International Journal for Chemistry · doi:10.2533/chimia.2019.983 · Cited by 11
Microtubule Severing Enzymes Oligomerization and Allostery: A Tale of Two Domains
Macke, A. C., Kelly, M. S., Varikoti, R. A., Mullen, S., Groves, D., Forbes, C., & Dima, R. I. (2022) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.2c05288 · Cited by 10
Tsunawaki, M., Fukuhara, S., & Shibuta, Y. (2021) · MATERIALS TRANSACTIONS · doi:10.2320/matertrans.mt-m2021032 · Cited by 9
Glova, A. D., & Karttunen, M. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0229161 · Cited by 8
Learning Markovian dynamics with spectral maps
Rydzewski, J., & Gökdemir, T. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0189241 · Cited by 9
Elias, D. R. D. A., Granato, E., & de Koning, M. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126653 · Cited by 8
“Dividing and Conquering” and “Caching” in Molecular Modeling
Cao, X., & Tian, P. (2021) · International Journal of Molecular Sciences · doi:10.3390/ijms22095053 · Cited by 10
Sun, J., Cheng, L., & Miller, T. F. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0101280 · Cited by 8
Artificial Intelligence in Translational Medicine
Brogi, S., & Calderone, V. (2021) · International Journal of Translational Medicine · doi:10.3390/ijtm1030016 · Cited by 8
Li, Y., Zhou, R., Zhou, Y., & Chen, Z. S. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110395 · Cited by 7
Transferring chemical and energetic knowledge between molecular systems with machine learning
Heydari, S., Raniolo, S., Livi, L., & Limongelli, V. (2023) · Communications Chemistry · doi:10.1038/s42004-022-00790-5 · Cited by 6
Noda, K., & Shibuta, Y. (2024) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ad5821 · Cited by 6
Quality of uncertainty estimates from neural network potential ensembles
Kahle, L., & Zipoli, F. (2022) · Physical review. E · doi:10.1103/physreve.105.015311 · Cited by 6
Machine Learning at the Atomic Scale
Musil, F., & Ceriotti, M. (2019) · CHIMIA International Journal for Chemistry · doi:10.2533/chimia.2019.972 · Cited by 7
Self-citationUnderstanding Defects in Amorphous Silicon with Million‐Atom Simulations and Machine Learning
Morrow, J. D., Ugwumadu, C. E., Drabold, D. A., Elliott, S. R., Goodwin, A. L., & Deringer, V. L. (2024) · Angewandte Chemie · doi:10.1002/ange.202403842 · Cited by 5
Automated computational workflows for muon spin spectroscopy
Onuorah, I. J., Bonacci, M., Isah, M. M., Mazzani, M., Renzi, R. D., Pizzi, G., & Bonfà, P. (2025) · Digital Discovery · doi:10.1039/d4dd00314d · Cited by 7
ClasSOMfier: A neural network for cluster analysis and detection of lattice defects
Troncoso, J. F. (2020) · Computational Materials Science · doi:10.1016/j.commatsci.2020.110167 · Cited by 5
Research on the classification of ancient silicate glass artifacts based on machine learning
Chen, W., & Chen, D. (2024) · Archaeometry · doi:10.1111/arcm.13001 · Cited by 4
Macke, A. C., Stump, J. E., Kelly, M. S., Rowley, J., Herath, V., Mullen, S., & Dima, R. I. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c01511 · Cited by 4
Kahawatte, S., Macke, A. C., Clair, C. S., & Dima, R. I. (2025) · Biochemistry · doi:10.1021/acs.biochem.4c00693 · Cited by 4
Deep Learning for Image Processing and Reconstruction to Enhance LED-Based Photoacoustic Imaging
Sivasubramanian, K., & Xing, L. (2020) · Progress in optical science and photonics · doi:10.1007/978-981-15-3984-8_9 · Cited by 4
Scalable learning of potentials to predict time-dependent Hartree–Fock dynamics
Bhat, H. S., Gupta, P., & Isborn, C. M. (2024) · APL Machine Learning · doi:10.1063/5.0232683 · Cited by 4
Shiga, M., Sorai, M., Morishita, T., Aichi, M., Nishiyama, N., & Fujii, T. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adcf71 · Cited by 4
Behera, S. A., Krishna, P. K., & Achary, P. G. R. (2025) · Challenges and advances in computational chemistry and physics · doi:10.1007/978-3-031-78736-2_5 · Cited by 4
Naghshnejad, P., Das, D., Romagnoli, J. A., Kumar, R., & Chen, J. (2025) · Membranes · doi:10.3390/membranes16010012 · Cited by 4
Two-dimensional RMSD projections for reaction path visualization and validation
Goswami, R. R. (2026) · MethodsX · doi:10.1016/j.mex.2026.103851 · Cited by 3
Machine-Learned Free Energy Surfaces for Capillary Condensation and Evaporation in Mesopores
Desgranges, C., & Delhommelle, J. (2022) · Entropy · doi:10.3390/e24010097 · Cited by 3
Automated Analysis of Continuum Fields from Atomistic Simulations Using Statistical Machine Learning
Prakash, A., & Sandfeld, S. (2022) · Advanced Engineering Materials · doi:10.1002/adem.202200574 · Cited by 3
Jiang, Y., Aireti, M., Leng, X., Ji, X., Liu, J., Cui, X., Duan, H., Jing, Q., & Cao, H. (2023) · Nanomaterials · doi:10.3390/nano13152155 · Cited by 3
Li, R., Gao, T., Zhang, P., & Li, A. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c00787 · Cited by 3
Atomistic descriptor optimization using complementary Euclidean and geodesic distance information
Iyer, G. R., & Rubenstein, B. M. (2024) · Molecular Physics · doi:10.1080/00268976.2024.2381617 · Cited by 3
Franke, L., & Peter, C. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c01298 · Cited by 3
Predicting molecular properties using adjacency matrix powers and atomic number sequences
Afzal, M. Z., Siddiqi, S. S., & Nizami, A. R. (2025) · Chemical Engineering Science · doi:10.1016/j.ces.2025.122650 · Cited by 4
A neural network-assisted open boundary molecular dynamics simulation method
Floyd, J. E., & Lukes, J. R. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0083198 · Cited by 3
Durumeric, A. E. P., & Voth, G. A. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0146812 · Cited by 3
Kahle, L., Minisini, B., Bui, T., First, J. T., Buda, C., Goldman, T., & Wimmer, E. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d4cp01980f · Cited by 3
Sentiment Analysis through Machine Learning
Khan, M. A. A., Ali-Emran, Kabir, M. A., Ali, M. H., & Haque, A. (2021) · Journal of Southwest Jiaotong University · doi:10.35741/issn.0258-2724.56.3.32 · Cited by 3
Explaining classifiers to understand coarse-grained modelsPreprint
Durumeric, A. E. P., & Voth, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.07337 · Cited by 2
Tajs, P., Skarupski, M., & Rydzewski, J. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c01107 · Cited by 3
Yu, Y., & Niu, H. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0288279 · Cited by 2
Unsupervised machine learning algorithms as support tools in molecular dynamics simulations
Rim, D. N., Moyano, L. G., & Millán, E. N. (2019) · El Servicio de Difusión de la Creación Intelectual (National University of La Plata) · Cited by 2
Non-adiabatic molecular dynamics of PAH-related complexes
Posenitskiy, E. (2020) · theses.fr (ABES) · doi:10.70675/bfb35103z00bbz4bf9z80fdze96b19b060bb · Cited by 2
Automating the Analysis of Substrate Reactivity through Environment Interaction Mapping
da Silva, T. H., Lu, J., Cortright, Z., Mulumba, D., Khan, M. S., & Andreussi, O. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c00474 · Cited by 1
Incorporating Anionic Ligands in Chemical Space Exploration with New Ligand Additivity Relationships
Kulik, H. J. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c00636 · Cited by 1
Zeng, J., Qin, M., Jiang, M., Wang, S., Xie, X., Li, L., Ren, W., Shao, P., Xiao, X., & Luo, X. (2025) · Environmental Functional Materials · doi:10.1016/j.efmat.2025.12.001 · Cited by 1
Desai, S., Wilson, M. A., Liu, S., Kounouho, S., O’Connor, T. C., & Dingreville, R. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c02130 · Cited by 1
Hartl, B., Mihalkovič, M., Šamaj, L., Mazars, M., Trizac, E., & Kahl, G. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0166822 · Cited by 1
Leveraging Machine Learning for Enhanced Customer Experiences in E- Commerce
Sen, A., Saha, A., & Ghosh, A. (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-19032 · Cited by 1
Leveraging Machine Learning for Enhanced Customer Experiences in E- Commerce
Jana, S., Biswas, R., Pal, M., & Pal, K. (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-15586s · Cited by 1
Tirimbó, G., Çaylak, O., & Baumeier, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.01787 · Cited by 1
Computational Material Database of Free-Standing 2D PerovskitesPreprint
Yang, J., & Li, S. (2022) · ChemRxiv · doi:10.26434/chemrxiv-2022-7wqj3 · Cited by 1
Computational compound screening of biomolecules and soft materials by molecular simulations
Bereau, T. (2020) · Modelling and Simulation in Materials Science and Engineering · doi:10.1088/1361-651x/abd042 · Cited by 29
Machine Learning in Insurance Underwriting Context
Yang, B. (2021) · International Conference on Electronic Information Technology and Smart Agriculture (ICEITSA) · doi:10.1109/iceitsa54226.2021.00097
Gasparotto, P., Bochicchio, D., Ceriotti, M., & Pavan, G. M. (2019) · ChemRxiv · doi:10.26434/chemrxiv.8268197.v2
Self-citationApplication of machine learning to the structure classification of ternary metal nanoparticles
Мясниченко, В. С., Матренин, П. В., Sdobnyakov, N. Y., & Соколов, Д. Н. (2023) · AIP conference proceedings · doi:10.1063/5.0118249
Investigating Protein Structure Populations from Simulation Data using Unsupervised Learning
Gogovi, G. K., Asamoah, J. K. K., & Fosu, G. O. (2022) · International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci58124.2022.00112
Factorization in molecular modeling and belief propagation algorithms
Du, B., & Tian, P. (2023) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2023935
Museza, N. A., & Mazambani, G. (2023) · Zimbabwe Conference of Information and Communication Technologies (ZCICT) · doi:10.1109/zcict59466.2023.10528432
Jakse, N. (2024) · doi:10.1002/9781394325634.ch3
Machine Learning of Slow Collective Variables and Enhanced Sampling via Spatial TechniquesPreprint
Gökdemir, T., & Rydzewski, J. (2025) · Qeios · doi:10.32388/70q2ov
Role of Blockchain-Integrated Machine Learning in the Supply Chain: Review on Applications
Tugcan, C., & Korhan, O. (2025) · Lecture notes in management and industrial engineering · doi:10.1007/978-3-031-88071-1_5
Wang, W., Liu, X., & Pérez‐Ríos, J. (2025) · Physical Chemistry Chemical Physics · doi:10.1039/d5cp01732g
Unsupervised learning of non-Abelian multi-gap topological phases
He, X., Zhang, R.-Y., Cui, X., Zhang, L., & Chan, C. T. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ae0513
335Machine learning models for predicting drug toxicity and side effects
Sharma, A. K., Karthik, G. L., Kamra, R., Praveena, S., & Hariram, V. (2025) · De Gruyter eBooks · doi:10.1515/9783111503202-008
Enabling knowledge discovery from data
Rajan, K. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-22256-6.00003-8
Unbiased exploration of the transition region in ice nucleation using the NpH ensemble
Falkner, S., Schwierz, N., & de Hijes, P. M. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0336532
Yi, S., Shi, L., Zhou, G. X., Liu, X., & Fang, T. (2026) · Chemical Communications · doi:10.1039/d6cc04856k
Cañete‐Arché, A., McGinley, A., Castro-Latorre, P., Watson, G. W., & Melchor, M. G. (2026) · Research Square · doi:10.21203/rs.3.rs-11013614/v1
Zhu, Y., Zhang, J., Feng, C., Huang, B., Yang, W., & Lan, Z. (2026) · JACS Au · doi:10.1021/jacsau.6c01054
Distinct tubulin C-terminal tails control the efficiency of a microtubule severing machine
Dewage, M. R., Kahawatte, S., Ross, J. L., & Dima, R. I. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0345522
Metadata
- Authors
- Ceriotti, M.
- Affiliations
- École Polytechnique Fédérale de Lausanne (CH)
- Corresponding author
- Ceriotti, Michele
- ORCID
- Ceriotti, Michele
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2019-04-19
- Volume
- 150
- Issue
- 15
- Pages
- 150901-150901
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2924564326
- Semantic Scholar
- 1db247fc224065b15b85c26dcb31a91eb3b0b05f
- Cited by
- 173
- References
- 110
- Citations by year
- 2026: 8 · 2025: 24 · 2024: 18 · 2023: 24 · 2022: 32 · 2021: 25 · 2020: 28 · 2019: 14
- FWCI
- 8.93
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- The Journal of Chemical Physics (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- H2020 European Research Council (677013-HBMAP)
- Topics
- Physical Sciences › Materials Science › Materials Chemistry › Machine Learning in Materials Science
- Physical Sciences › Chemistry › Physical and Theoretical Chemistry › Advanced Physical and Chemical Molecular Interactions
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Model Reduction and Neural Networks
- Keywords
- unsupervised learning, atomistic simulation, molecular dynamics, clustering, dimensionality reduction, coarse-graining, structure-property relationships, machine learning bias, structure representation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-08, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-08 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review