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.
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
Claims the paper makes
0 of 68 cited sources checked · 0 supported · 0 flagged
- Findingreasoning§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 8
Most of the time, analyses using unsupervised learning required 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.
“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.”
Quote in the paperNot a substantial claim - Findingcitation§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 9
In Ref. 84, when considering nitrogen-substituted analogues of pentacene, the most clear-cut clustering was associated with in-plane H-bonding rather than with the stacking.
“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.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [84] 2018, Chem. Sci. source
Not checked in the free run.
- Findingcitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
A generalized convex hull (GCH) construction uses (kernel) principal component analysis to determine the structural parameters that capture the highest degree of diversity in a collection of (meta)stable structures.
“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.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [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).
Not checked in the free run.
- Interpretationreasoning§ Perspective: Unsupervised machine learning in atomistic simulations, between predictions and understanding · p. 1
Supervised machine-learning techniques are less susceptible to preconceived biases than unsupervised techniques when used to rationalize 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.”
Quote in the paperSubstantial claim - Premisereasoning§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2
The choice of representation provides leeway to incorporate prior knowledge or restrict the scope of the analysis.
“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.”
Quote in the paperNot a substantial claim
- Premisereasoning§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 4
Raw atomic coordinates as an input representation discriminate between structures that are physically indistinguishable.
“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.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CLUSTERING AND PATTERN RECOGNITION · p. 6
All of these clustering techniques depend crucially on the choice of the feature space, and/or the metric used to estimate similarity between inputs.
“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.”
Quote in the paperSubstantial claim - Interpretationreasoning§ V. APPLICATIONS OF CLUSTERING METHODS TO ATOMISTIC MODELING · p. 6
Machine-learning representations based on local motifs, rather than on conventional characterization in terms of 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.
“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”
Quote in the paperSubstantial claim - Interpretationcitation§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 4
Most representation schemes can be seen as a specific implementation of a very abstract density-based scheme.
“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 ,”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [37] 2019, J. Chem. Phys. source
Not checked in the free run.
- Interpretationnone given§ IV. CLUSTERING AND PATTERN RECOGNITION · p. 5
The connection between density peaks and minima in the free energy makes density-based clustering methods particularly well-suited to the analysis of finite-temperature atomistic simulations.
“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.”
Quote in the paperSubstantial claim - Interpretationcitation§ V. APPLICATIONS OF CLUSTERING METHODS TO ATOMISTIC MODELING · p. 6
The development of Markov-state models is closely interlinked with that of clustering algorithms, because an accurate and unbiased determination of kinetically distinct states is crucial for guaranteeing that the underlying assumption of Markovian dynamics holds true.
“The development of such Markov-state models 49,50 (MSM) is closely interlinked with that of clustering algorithms, because an accurate and unbiased determination of kinetically distinct states is crucial when it comes to guaranteeing that the underlying assumption of a Markovian dynamics holds true, particularly in the case of biomolecular simulations in which entropically-stabilized states are”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [49] 2010, Methods source
Not checked in the free run.
- cites [50] 2014, Curr. Opin. Struct. Biol. source
Not checked in the free run.
- Rests on an assumption: In biomolecular simulations, entropically-stabilized states are the norm rather than the exception.
- Interpretationreasoning§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 4
Symmetries provide a solid physical basis on which representations of atomic structures that are at the same time complete and concise can be built.
“Symmetries provide a solid physical basis on which representations of atomic structures that are at the same time complete and concise can be built.”
Quote in the paperSubstantial claim - Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7
The main drawback of TICA is the large amount of simulation data that is necessary to reliably estimate the autocorrelation function.
“the main drawback being the large amount of simulation data that is necessary to reliably estimate the autocorrelation function.”
Quote in the paperNot a substantial claim0 of 2 sources checked - Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7
Diffusion maps try to link geometric data to the characteristic time scale of the system's motion.
“methods such as diffusion maps 9,77-79 try to link geometric data to the characteristic time scale of the system's motion.”
Quote in the paperNot a substantial claim0 of 4 sources checked- cites [9] 2013, Annu. Rev. Phys. Chem. source
Not checked in the free run.
- cites [77] 2005, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [78] 2010, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [79] 2011, J. Chem. Phys. source
Not checked in the free run.
- Rests on an assumption: The most relevant degrees of freedom for a system are those in which the dynamics are slower.
- Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7
The intermediate range of distances is usually the most relevant to describe the transitions between meta-stable states.
“focus the optimization of the loss on the intermediate range of distances that are usually the most relevant to describe the transitions between meta-stable states 73”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [73] 2013, J. Chem. Theory Comput. source
Not checked in the free run.
- Interpretationnone given§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 8
When working with actual data rather than synthetic data there is no 'ground truth' in terms of what partitioning of the data, or low-dimensional representation, is performing best.
“when working with actual data rather than synthetic data there is no 'ground truth' in terms of what partitioning of the data, or low-dimensional representation, is performing best.”
Quote in the paperNot a substantial claim - Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8
The challenge of identifying the most appropriate low-dimensional space to accelerate conformational sampling is reflected in the fact that most early (and recent) applications of dimensionality reduction to atomistic modeling involved simulations of rare events or phase transitions.
“The challenge of identifying the most appropriate low-dimensional space to accelerate conformational sampling is reflected in the fact that most of early (and recent) applications of dimensionality reduction to atomistic modeling involved simulations of rare events or phase transitions 71,72,95-98 .”
Quote in the paperNot a substantial claim0 of 6 sources checked- cites [71] 2011, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [72] 2012, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [95] 2006, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [96] 2011, J. Chem. Phys. source
Not checked in the free run.
- cites [97] 2011, J. Phys. Chem. B source
Not checked in the free run.
- cites [98] 2017, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- Interpretationreasoning§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8
The statistical inefficiency of using a high-dimensional space to accelerate sampling is essentially a manifestation of the curse of dimensionality.
“This is essentially a manifestation of the curse of dimensionality.”
Quote in the paperSubstantial claim - Interpretationreasoning§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8
Using a high-dimensional space to accelerate sampling almost invariably leads to statistical inefficiency.
“Using a high-dimensional space to accelerate sampling almost invariably leads to statistical inefficiency.”
Quote in the paperSubstantial claim - Interpretationnone given§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 8
The most straightforward unsupervised learning schemes detect correlations between data points in feature space, and so depend crucially on what representation is used, as well as on how the pattern recognition scheme defines proximity and correlations.
“the most straightforward unsupervised learning schemes detect correlations between data points in feature space, and so depend crucially on what representation is used, as well as on how the pattern recognition scheme defines proximity and correlations”
Quote in the paperSubstantial claim - Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
It is possible to automate the parameter optimization, so as to maximise the similarity with the committor.
“It is then possible to automate the parameter optimization, so as to maximise the similarity with the committor 100-102 .”
Quote in the paperNot a substantial claim0 of 3 sources checked - Interpretationcitation§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 9
General-purpose and systematically-convergent descriptions of chemical environments provide a starting point that is considerably less biased than descriptors based on complicated heuristics that are designed from the outset to identify e.g. a stacking order, or the coordination of a site.
“General-purpose and systematically-convergent descriptions of chemical environments, such as those that are typically used to fit potentials or predict molecular properties 31,35 , provide a starting point that is considerably less biased than descriptors based on complicated heuristics that are designed from the outset to identify e.g. a stacking order, or the coordination of a site.”
Quote in the paperNot a substantial claim0 of 2 sources checked - Interpretationcitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
Dimensionality reduction algorithms such as TICA or SGOOP, that incorporate information on the system's dynamics, implicitly ensure that the order parameter(s) perform well as descriptors of the slowest molecular motion.
“Dimensionality reduction algorithms as TICA 80,81 or SGOOP 82 , that incorporate information on the system's dynamics, implicitly ensure that the order parameter(s) perform well as descriptors of the slowest molecular motion.”
Quote in the paperNot a substantial claim0 of 3 sources checked - Interpretationreasoning§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
Benchmarking order parameters in terms of accelerated sampling or committor analysis effectively introduces a quantitative metric to compare one candidate against another.
“This effectively introduces a quantitative metric to compare one candidate against another.”
Quote in the paperNot a substantial claim - Interpretationcitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
In combination with an analysis of the learning curves, it is possible to understand whether the problem is data-limited, or if the representation does not contain enough information to reflect the correlations between structure and properties.
“In combination with an analysis of the learning curves 103 (the accuracy of the model when making a prediction, as a function of the size of the training set) it is possible to understand whether the problem is data-limited, or if the representation does not contain enough information to reflect the correlations between structure and properties.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [103] 2016, J. Chem. Phys. source
Not checked in the free run.
- Interpretationcitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
A critical assessment of the model performance as a function of the hyperparameters makes it possible to gauge the range of interactions, or the locality of the physical phenomena underlying structure-property relations for that system.
“A critical assessment of the model performance as a function of the hyperparameters makes it possible to gauge the range of interactions 104 , or the locality of the physical phenomena underlying structure-property relations 105,106 for that system.”
Quote in the paperSubstantial claim0 of 3 sources checked - Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
In the field of biomolecular simulations, the order parameters obtained by trial-and-error, or by unsupervised learning, are often benchmarked in terms of how well they perform to drive an accelerated sampling algorithm, or on how well they perform in terms of an analysis of the committor.
“In the field of biomolecular simulations, the order parameters obtained by trial-an-error, or by unsupervised learning, are often benchmarked in terms of how well they perform to drive an accelerated sampling algorithm, or on how well they perform in terms of an analysis of the committor 99 .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [99] 2000, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- Interpretationreasoning§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
Combining supervised and unsupervised learning can be mutually beneficial.
“To an extent, combining supervised and unsupervised learning can be mutually beneficial.”
Quote in the paperNot a substantial claim - Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
Unsupervised learning strategies can also be used to reduce the number of features that are needed to describe a system.
“Unsupervised learning strategies can also be used to reduce the number of features that are needed to describe a system 112 .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [112] 2018, J. Chem. Phys. source
Not checked in the free run.
- Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9
Regression techniques can reconstruct (high-dimensional) free-energy surfaces, which mitigates the problem of the curse of dimensionality when performing essentially a density estimation.
“Another example of the synergy between supervised and unsupervised learning tasks involves the use of regression techniques to reconstruct (high-dimensional) free-energy surfaces, which mitigates the problem of the curse of dimensionality when performing essentially a density estimation 114-117 .”
Quote in the paperNot a substantial claim0 of 4 sources checked
- May combine two claims. 14
- Classified as probably not a substantial claim. 30
May combine two claims.
Findingnone given§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2Eq. (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.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone given§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2Opting for a specialized description of a system introduces biases in the procedure.
“Obviously, opting for a specialized description of a system introduces some biases in the procedure.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2Given a metric or a positive-definite kernel, it is possible to obtain an operative definition of a representation in terms of a set of features.
“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 ′ ).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [14] M. Cuturi , e-print arXiv:0911.5367 (2009).
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisereasoning§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2The representation of a structure can take the form of a vector of features, a measure of similarity, or a kernel, and these three ways can be used interchangeably.
“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”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Premisenone given§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 2Given a representation in terms of a finite set of features, it is always possible to use it as the starting point to define a distance or a kernel.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Interpretationreasoning§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 4SOAP power spectra components are systematic but overdetermined, and Behler-Parrinello symmetry functions are highly correlated with each other.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable), S4 (based).
Premisenone given§ VI. DIMENSIONALITY REDUCTION · p. 6It is hard if not impossible to comprehend the meaning or the relative positions of vectors in a high (or infinite) dimensional space.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).
Premisecitation§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 3The problem of obtaining a complete yet concise description of a molecular or condensed-phase structure is central to many modelling techniques.
“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 .”
Quote in the paperNot a substantial claim0 of 4 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Premisenone given§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 4Most state-of-the-art representations incorporate symmetries.
“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.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim. May combine two claims.
Premisenone given§ VI. DIMENSIONALITY REDUCTION · p. 6Clustering 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.
“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.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Interpretationnone given§ II. MACHINE LEARNING FOR ATOMISTIC MODELING · p. 3In unsupervised learning, hyperparameter optimization is often performed manually, by trial and error, and constitutes one of the critical points to consider to keep the procedure truly unbiased.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing), S4 (based).
Premisereasoning§ VI. DIMENSIONALITY REDUCTION · p. 6Dimensionality-reduction methods have long been sought after for all sorts of data analysis applications.
“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.”
Quote in the paperNot a substantial claimMay combine two claims.
Premisecitation§ III. REPRESENTATIONS, DISTANCES AND KERNELS · p. 3The separation between global and local representations is far from clear-cut, and it is often possible to construct a local version of a global representation, and vice versa.
“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 .”
Quote in the paperNot a substantial claim0 of 2 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone given§ V. APPLICATIONS OF CLUSTERING METHODS TO ATOMISTIC MODELING · p. 6The use of local, atom/fragment-based representations is convenient to find recurring patterns in the building blocks of a structure, rather than in the overall configuration.
“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.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim. May combine two claims.
Interpretationreasoning§ IV. CLUSTERING AND PATTERN RECOGNITION · p. 6The 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 of feature space, kernel or metric.
“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.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Premisenone given§ VI. DIMENSIONALITY REDUCTION · p. 6The 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.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone given§ IV. CLUSTERING AND PATTERN RECOGNITION · p. 6Non-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.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Premisenone given§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8Dimensionality reduction lies at the heart of the vast majority of accelerated sampling methods, which try to beat the time scale problem of molecular simulations.
“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”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7The 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).
“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”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [76] 2000, Science source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7TICA 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.
“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”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [80] 1994, Phys. Rev. Lett. source
Not checked in the free run.
- cites [81] 2013, J. Chem. Phys. source
Not checked in the free run.
- Rests on an assumption: The most relevant degrees of freedom for a system are those in which the dynamics are slower.
Probably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7SGOOP singles 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.
“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”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [82] 2016, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- Rests on an assumption: The most relevant degrees of freedom for a system are those in which the dynamics are slower.
Probably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8Materials cartography 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 'structure-energy-property' landscape of that system.
“'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.”
Quote in the paperNot a substantial claim0 of 3 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8Similar approaches have been applied to biomolecular simulations, where the main application of dimensionality reduction has been in connection with accelerated sampling.
“Similar approaches have been applied to biomolecular simulations 86 , where the main application of dimensionality reduction has been in connection with accelerated sampling.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [86] 2012, J. Mol. Graphics Modell. source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
Premisenone given§ VI. DIMENSIONALITY REDUCTION · p. 7All of the dimensionality reduction methods discussed up to this point rely exclusively on the distribution of atoms in each structure.
“All of the methods discussed this far rely exclusively on the distribution of atoms in each structure.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VI. DIMENSIONALITY REDUCTION · p. 7ISOMAP 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.
“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.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [75] 2000, Science source
Not checked in the free run.
Classified as probably not a substantial claim.
Premisereasoning§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8The applications of dimensionality reduction schemes to atomistic simulations reflect the dual function of a coarse-grained representation: to simplify the description of a system to understand it better, and to explore more effectively its conformational space.
“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.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8In order to observe a rare (activated) event without developing dedicated hardware, one needs to selectively increase the speed at which the pathways related to the transition are traversed, to modify the probability distribution that is sampled during the simulation so that configurations close to the transition state occur more often, or to generate adaptively ensembles of trajectories that覆盖the
“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”
Quote in the paperNot a substantial claim0 of 6 sources checked- cites [1] 2009
Not checked in the free run.
- cites [51] 2002, Annu. Rev. Mater. Res. source
Not checked in the free run.
- cites [87] 2002, Annu. Rev. Phys. Chem. source
Not checked in the free run.
- cites [88] 2008, J. Phys. Chem. B source
Not checked in the free run.
- cites [15] 2002, Proc. Natl. Acad. Sci. U. S. A. source
Not checked in the free run.
- cites [89] 1977, J. Comput. Phys. source
Not checked in the free run.
May combine two claims.
Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8In metadynamics, the volume of a free energy minimum grows exponentially with the dimensionality d of collective variable space, and so does the time to accumulate sufficient bias to escape the free-energy basin.
“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.”
Quote in the paperSubstantial claim0 of 2 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ VII. APPLICATIONS OF DIMENSIONALITY REDUCTION TO ATOMISTIC MODELING · p. 8The objective of accelerated sampling is to accelerate sampling while introducing a minimal disturbance to the natural behavior of the system.
“Either way, the objective is to accelerate sampling while introducing a minimal disturbance to the natural behavior of the system 91”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [91] 2013, Phys. Rev. Lett. source
Not checked in the free run.
May combine two claims.
Interpretationcitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9The accuracy of the regression model provides an objective metric to optimize the hyperparameters that define the representation, and even to determine the most effective non-linear function of features that reproduces the target properties.
“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 .”
Quote in the paperNot a substantial claim0 of 2 sources checkedProbably not a substantial claim: may not pass S2 (checkable).
Interpretationreasoning§ VIII. THE PROBLEMS WITH UNSUPERVISED LEARNING · p. 8It is tempting to pick one's own 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.
“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.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Interpretationreasoning§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9Checking how accurately one can machine-learn the property of interest based on the structural representation used as input for an unsupervised learning scheme gives an idea of the limiting accuracy that can be expected when inferring structure-property relations by application of unsupervised classification or coarse-graining schemes.
“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.”
Quote in the paperSubstantial claimMay combine two claims.
Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9Clustering can be used to select the most relevant reference configurations from a database, or to partition it into regions on which specialized models can be trained.
“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”
Quote in the paperNot a substantial claim0 of 2 sources checkedMay combine two claims.
Premisecitation§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9A 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.
“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 .”
Quote in the paperNot a substantial claim0 of 3 sources checkedProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone given§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9Choosing 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.
“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.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing), S4 (based). May combine two claims.
Interpretationnone given§ IX. PUTTING SOME SUPERVISION INTO UNSUPERVISED LEARNING · p. 9Unsupervised 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.
“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.”
Quote in the paperNot a substantial claim
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?
ML models, analysis of their key features, and dimensionality reduction represent important tools for building structure-property relationships and mapping chemical space.
“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.”
Cites
(2008) · Journal of Machine Learning Research · Cited by 33,051 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
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,121 · see citing works
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 · see citing works
Laio, A., & Parrinello, M. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.202427399 · Cited by 5,626 · see citing works
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 · see citing works
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 · see citing works
Clustering by fast search and find of density peaks
Rodríguez, Á., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,963 · see citing works
Bond-orientational order in liquids and glasses
Steinhardt, P. J., Nelson, D. R., & Ronchetti, M. (1983) · Physical review. B, Condensed matter · doi:10.1103/physrevb.28.784 · Cited by 3,511 · see citing works
Oganov, A. R., & Glass, C. W. (2006) · The Journal of Chemical Physics · doi:10.1063/1.2210932 · Cited by 2,596 · see citing works
On representing chemical environments
Bartók, A. P., Kondor, R., & Csányi, G. (2013) · Physical Review B · doi:10.1103/physrevb.87.184115 · Cited by 2,572 · see citing works
Automated identification and indexing of dislocations in crystal interfaces
Stukowski, A., Bulatov, V. V., & Arsenlis, A. (2012) · Modelling and Simulation in Materials Science and Engineering · doi:10.1088/0965-0393/20/8/085007 · Cited by 2,401 · see citing works
Fast and Accurate Modeling of Molecular Atomization Energies with Machine Learning
Rupp, M., Tkatchenko, A., Müller, K.-R., & von Lilienfeld, O. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.058301 · Cited by 2,312 · see citing works
The high-throughput highway to computational materials design
Curtarolo, S., Hart, G. L. W., Nardelli, M. B., Mingo, N., Sanvito, S., & Levy, O. (2013) · Nature Materials · doi:10.1038/nmat3568 · Cited by 2,053 · see citing works
Bolhuis, P. G., Chandler, D., Dellago, C., & Geissler, P. L. (2002) · Annual Review of Physical Chemistry · doi:10.1146/annurev.physchem.53.082301.113146 · Cited by 1,972 · see citing works
Machine learning in materials informatics: recent applications and prospects
Ramprasad, R., Batra, R., Pilania, G., Mannodi-Kanakkithodi, A., & Kim, C. (2017) · npj Computational Materials · doi:10.1038/s41524-017-0056-5 · Cited by 1,945 · see citing works
ANI-1: an extensible neural network potential with DFT accuracy at force field computational cost
Smith, J. S., Isayev, O., & Roitberg, A. E. (2017) · Chemical Science · doi:10.1039/c6sc05720a · Cited by 1,921 · see citing works
Mounet, N., Gibertini, M., Schwaller, P., Campi, D., Merkys, A., Marrazzo, A., Sohier, T., Castelli, I. E., Cepellotti, A., Pizzi, G., et al. (2018) · Nature Nanotechnology · doi:10.1038/s41565-017-0035-5 · Cited by 1,863 · see citing works
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675 · see citing works
Laio, A., & Gervasio, F. L. (2008) · Reports on Progress in Physics · doi:10.1088/0034-4885/71/12/126601 · Cited by 1,619 · see citing works
Perspective: Machine learning potentials for atomistic simulations
Behler, J. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4966192 · Cited by 1,435 · see citing works
<i>Ab initio</i> random structure searching
Pickard, C. J., & Needs, R. J. (2011) · Journal of Physics: Condensed Matter · doi:10.1088/0953-8984/23/5/053201 · Cited by 1,302 · see citing works
Identification of slow molecular order parameters for Markov model construction
Pérez-Hernández, G., Paul, F., Giorgino, T., De Fabritiis, G., & Noé, F. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4811489 · Cited by 990 · see citing works
Ouyang, R., Curtarolo, S., Ahmetcik, E., Scheffler, M., & Ghiringhelli, L. M. (2018) · Physical Review Materials · doi:10.1103/physrevmaterials.2.083802 · Cited by 944 · see citing works
Separation of a mixture of independent signals using time delayed correlations
Molgedey, L., & Schuster, H. G. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.3634 · Cited by 882 · see citing works
Goedecker, S. (2004) · The Journal of Chemical Physics · doi:10.1063/1.1724816 · Cited by 878 · see citing works
Permutationally invariant potential energy surfaces in high dimensionality
Braams, B., & Bowman, J. (2009) · International Reviews in Physical Chemistry · doi:10.1080/01442350903234923 · Cited by 841 · see citing works
Neural network potential-energy surfaces in chemistry: a tool for large-scale simulations
Behler, J. (2011) · Physical Chemistry Chemical Physics · doi:10.1039/c1cp21668f · Cited by 781 · see citing works
Comparing molecules and solids across structural and alchemical space
De, S., Bartók, A. P., Csányi, G., & Ceriotti, M. (2016) · Physical Chemistry Chemical Physics · doi:10.1039/c6cp00415f · Cited by 778 · see citing works
Self-citationMarkov state models of biomolecular conformational dynamics
Chodera, J. D., & Noé, F. (2014) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2014.04.002 · Cited by 776 · see citing works
Machine learning unifies the modeling of materials and molecules
Bartók, A. P., De, S., Poelking, C., Bernstein, N., Kermode, J. R., Csányi, G., & Ceriotti, M. (2017) · Science Advances · doi:10.1126/sciadv.1701816 · Cited by 764 · see citing works
Self-citationExtending the Time Scale in Atomistic Simulation of Materials
Voter, A. F., Montalenti, F., & Germann, T. C. (2002) · Annual Review of Materials Research · doi:10.1146/annurev.matsci.32.112601.141541 · Cited by 700 · see citing works
Everything you wanted to know about Markov State Models but were afraid to ask
Pande, V. S., Beauchamp, K., & Bowman, G. R. (2010) · Methods · doi:10.1016/j.ymeth.2010.06.002 · Cited by 698 · see citing works
<scp>G</scp>aussian approximation potentials: A brief tutorial introduction
Bartók, A. P., & Csányi, G. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24927 · Cited by 617 · see citing works
Identification of slow molecular order parameters for Markov model constructionPreprint
Perez-hern, G., Paul, F., Toni Giorgino, A., Fabritiis, G. D., Noé, F., & Contribution, E. (2013) · Cited by 613 · see citing works
AiiDA: automated interactive infrastructure and database for computational science
Pizzi, G., Cepellotti, A., Sabatini, R., Marzari, N., & Kozinsky, B. (2015) · Computational Materials Science · doi:10.1016/j.commatsci.2015.09.013 · Cited by 584 · see citing works
Assessing the Accuracy of Metadynamics
Laio, A., Rodriguez-Fortea, A., Gervasio, F. L., Ceccarelli, M., & Parrinello, M. (2005) · The Journal of Physical Chemistry B · doi:10.1021/jp045424k · Cited by 517 · see citing works
Tiwary, P., & Parrinello, M. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.230602 · Cited by 494 · see citing works
Schütt, K. T., Glawe, H., Brockherde, F., Sanna, A., Müller, K. R., & Gross, E. K. U. (2014) · Physical Review B · doi:10.1103/physrevb.89.205118 · Cited by 460 · see citing works
Crystal structure representations for machine learning models of formation energies
Faber, F. A., Lindmaa, A., von Lilienfeld, O. A., & Armiento, R. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24917 · Cited by 457 · see citing works
Reaction coordinates of biomolecular isomerization
Bolhuis, P. G., Dellago, C., & Chandler, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.100127697 · Cited by 426 · see citing works
Obtaining reaction coordinates by likelihood maximization
Peters, B., & Trout, B. L. (2006) · The Journal of Chemical Physics · doi:10.1063/1.2234477 · Cited by 417 · see citing works
Automatic Method for Identifying Reaction Coordinates in Complex Systems
Ma, A., & Dinner, A. R. (2005) · The Journal of Physical Chemistry B · doi:10.1021/jp045546c · Cited by 400 · see citing works
Simplifying the representation of complex free-energy landscapes using sketch-map
Ceriotti, M., Tribello, G. A., & Parrinello, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1108486108 · Cited by 340 · see citing works
Self-citationDas, P., Moll, M., Stamati, H., Kavraki, L. E., & Clementi, C. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0603553103 · Cited by 331 · see citing works
Tools for the automatic identification and classification of RNA base pairs
Yang, H.-W., Jossinet, F., Leontis, N., Chen, L., Westbrook, J., Berman, H., & Westhof, E. (2003) · Nucleic Acids Res. · doi:10.1093/nar/gkg529 · Cited by 331 · see citing works
Imbalzano, G., Anelli, A., Giofré, D., Klees, S., Behler, J., & Ceriotti, M. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5024611 · Cited by 330 · see citing works
Self-citationSymmetry-Adapted Machine Learning for Tensorial Properties of Atomistic Systems
Grisafi, A., Wilkins, D. M., Csányi, G., & Ceriotti, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.036002 · Cited by 309 · see citing works
Self-citationCrystal structure prediction using the minima hopping method
Amsler, M., & Goedecker, S. (2010) · The Journal of Chemical Physics · doi:10.1063/1.3512900 · Cited by 306 · see citing works
Isayev, O., Fourches, D., Muratov, E. N., Oses, C., Rasch, K., Tropsha, A., & Curtarolo, S. (2015) · Chemistry of Materials · doi:10.1021/cm503507h · Cited by 300 · see citing works
Shibuta, Y., Sakane, S., Miyoshi, E., Okita, S., Takaki, T., & Ohno, M. (2017) · Nature Communications · doi:10.1038/s41467-017-00017-5 · Cited by 296 · see citing works
Huang, B., & von Lilienfeld, O. A. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4964627 · Cited by 294 · see citing works
Determination of reaction coordinates via locally scaled diffusion map
Rohrdanz, M. A., Zheng, W., Maggioni, M., & Clementi, C. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3569857 · Cited by 292 · see citing works
Ouyang, R., Stefano Curtarolo, A., Ahmetcik, E., Scheffler, M., & Ghiringhelli, L. M. (2018) · MPG.PuRe (Max Planck Society) · Cited by 289 · see citing works
Algorithms for hierarchical clustering: an overview, II
Murtagh, F. D., & Contreras, P. (2017) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1219 · Cited by 287 · see citing works
Spectral gap optimization of order parameters for sampling complex molecular systems
Tiwary, P., & Berne, B. J. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1600917113 · Cited by 259 · see citing works
Rohrdanz, M. A., Zheng, W., & Clementi, C. (2013) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-040412-110006 · Cited by 242 · see citing works
Quantum Machine Learning in Chemical Compound Space
von Lilienfeld, O. A. (2017) · Angewandte Chemie International Edition · doi:10.1002/anie.201709686 · Cited by 240 · see citing works
Abrams, J. B., & Tuckerman, M. E. (2008) · The Journal of Physical Chemistry B · doi:10.1021/jp805039u · Cited by 221 · see citing works
Machine learning for the structure–energy–property landscapes of molecular crystals
Musil, F., De, S., Yang, J., Campbell, J. E., Day, G. M., & Ceriotti, M. (2018) · Chemical Science · doi:10.1039/c7sc04665k · Cited by 216 · see citing works
Self-citationKarpen, M. E., Tobias, D., & Brooks, C. (1993) · Biochemistry · doi:10.1021/bi00053a005 · Cited by 211 · see citing works
Automatic identification and representation of protein binding sites for molecular docking
Ruppert, J., Welch, W., & Jain, A. N. (1997) · Protein Science · doi:10.1002/pro.5560060302 · Cited by 209 · see citing works
Accurate molecular polarizabilities with coupled cluster theory and machine learning
Wilkins, D. M., Grisafi, A., Yang, Y., Lao, K. U., DiStasio, R. A., & Ceriotti, M. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1816132116 · Cited by 204 · see citing works
Self-citationUsing sketch-map coordinates to analyze and bias molecular dynamics simulations
Tribello, G. A., Ceriotti, M., & Parrinello, M. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1201152109 · Cited by 202 · see citing works
Self-citationPietrucci, F., & Laio, A. (2009) · Journal of Chemical Theory and Computation · doi:10.1021/ct900202f · Cited by 196 · see citing works
Mode-finding for mixtures of Gaussian distributions
Carreira-Perpiñán, M. Á. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.888716 · Cited by 192 · see citing works
Atom-density representations for machine learning
Willatt, M. J., Musil, F., & Ceriotti, M. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5090481 · Cited by 179 · see citing works
Self-citationNguyen, T. T., Székely, E., Imbalzano, G., Behler, J., Csányi, G., Ceriotti, M., Götz, A. W., & Paesani, F. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5024577 · Cited by 171 · see citing works
Self-citationNguyen, T. T. M., Székely, E., Imbalzano, G., Behler, J., Cśanyi, G., Ceriotti, M., Götz, A. W., & Paesani, F. (2018) · Apollo (University of Cambridge) · doi:10.17863/cam.22160 · Cited by 168 · see citing works
Self-citationAccelerated materials property predictions and design using motif-based fingerprints
Huan, T. D., Mannodi‐Kanakkithodi, A., & Ramprasad, R. (2015) · Physical Review B · doi:10.1103/physrevb.92.014106 · Cited by 166 · see citing works
Systematic determination of order parameters for chain dynamics using diffusion maps
Ferguson, A. L., Panagiotopoulos, A. Z., Debenedetti, P. G., & Kevrekidis, I. G. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1003293107 · Cited by 165 · see citing works
Noé, F., & Clementi, C. (2017) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2017.02.006 · Cited by 161 · see citing works
Pietrucci, F., & Andreoni, W. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.085504 · Cited by 154 · see citing works
Efficient nonparametric n -body force fields from machine learning
Glielmo, A., Zeni, C., & Vita, A. D. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.184307 · Cited by 143 · see citing works
Metrics for measuring distances in configuration spaces
Sadeghi, A., Ghasemi, S. A., Schaefer, B., Mohr, S., Lill, M. A., & Goedecker, S. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4828704 · Cited by 141 · see citing works
Willatt, M. J., Musil, F., & Ceriotti, M. (2018) · Physical Chemistry Chemical Physics · doi:10.1039/c8cp05921g · Cited by 141 · see citing works
Self-citationStochastic Neural Network Approach for Learning High-Dimensional Free Energy Surfaces
Schneider, E., Dai, L., Topper, R. Q., Drechsel‐Grau, C., & Tuckerman, M. E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.150601 · Cited by 139 · see citing works
Fast recovery of free energy landscapes via diffusion-map-directed molecular dynamics
Preto, J., & Clementi, C. (2014) · Physical Chemistry Chemical Physics · doi:10.1039/c3cp54520b · Cited by 132 · see citing works
GAtor: A First-Principles Genetic Algorithm for Molecular Crystal Structure Prediction
Curtis, F., Li, X., Rose, T., Vázquez‐Mayagoitia, Á., Bhattacharya, S., Ghiringhelli, L. M., & Marom, N. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.7b01152 · Cited by 132 · see citing works
A fingerprint based metric for measuring similarities of crystalline structures
Zhu, L., Amsler, M., Fuhrer, T., Schaefer, B., Faraji, S., Rostami, S., Ghasemi, S. A., Sadeghi, A., Grauzinyte, M., Wolverton, C., et al. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4940026 · Cited by 127 · see citing works
Demonstrating the Transferability and the Descriptive Power of Sketch-Map
Ceriotti, M., Tribello, G. A., & Parrinello, M. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct3010563 · Cited by 126 · see citing works
Self-citationIntrinsic map dynamics exploration for uncharted effective free-energy landscapes
Chiavazzo, E., Covino, R., Coifman, R. R., Gear, C. W., Georgiou, A. S., Hummer, G., & Kevrekidis, I. G. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1621481114 · Cited by 125 · see citing works
Predicting polymorphism in molecular crystals using orientational entropy
Piaggi, P. M., & Parrinello, M. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1811056115 · Cited by 118 · see citing works
Yang, J., De, S., Campbell, J. E., Li, S., Ceriotti, M., & Day, G. M. (2018) · Chemistry of Materials · doi:10.1021/acs.chemmater.8b01621 · Cited by 113 · see citing works
Self-citationSolid-liquid interface free energy through metadynamics simulations
Angioletti‐Uberti, S., Ceriotti, M., Lee, P. D., & Finnis, M. W. (2010) · Physical Review B · doi:10.1103/physrevb.81.125416 · Cited by 110 · see citing works
Self-citationAlgorithms for clustering molecular dynamics configurations
Torda, A. E., & van Gunsteren, W. F. (1994) · Journal of Computational Chemistry · doi:10.1002/jcc.540151203 · Cited by 106 · see citing works
Exploration, Sampling, And Reconstruction of Free Energy Surfaces with Gaussian Process Regression
Mones, L., Bernstein, N., & Csányi, G. (2016) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6b00553 · Cited by 91 · see citing works
Zimmermann, N. E. R., Horton, M. K., Jain, A., & Harańczyk, M. (2017) · Frontiers in Materials · doi:10.3389/fmats.2017.00034 · Cited by 85 · see citing works
Locating landmarks on high-dimensional free energy surfaces
Chen, M., Yu, T.-Q., & Tuckerman, M. E. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1418241112 · Cited by 84 · see citing works
Network and graph analyses of folding free energy surfaces
Caflisch, A. (2006) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2006.01.002 · Cited by 74 · see citing works
Gasparotto, P., & Ceriotti, M. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4900655 · Cited by 72 · see citing works
Self-citationNonlinear dimensionality reduction and mapping of compound libraries for drug discovery
Reutlinger, M., & Schneider, G. (2012) · Journal of Molecular Graphics and Modelling · doi:10.1016/j.jmgm.2011.12.006 · Cited by 72 · see citing works
Metadynamics in the conformational space nonlinearly dimensionally reduced by Isomap
Spiwok, V., & Králová, B. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3660208 · Cited by 70 · see citing works
Generalized Density-Functional Tight-Binding Repulsive Potentials from Unsupervised Machine Learning
Kranz, J. J., Kubillus, M., Ramakrishnan, R., von Lilienfeld, O. A., & Elstner, M. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.7b00933 · Cited by 63 · see citing works
Free energy surface reconstruction from umbrella samples using Gaussian process regressionPreprint
Stecher, T., Bernstein, N., Cśanyi, G., et al. (2016) · Cited by 57 · see citing works
Free Energy Surface Reconstruction from Umbrella Samples Using Gaussian Process Regression
Stecher, T., Bernstein, N., & Csányi, G. (2014) · Journal of Chemical Theory and Computation · doi:10.1021/ct500438v · Cited by 56 · see citing works
Recognizing Local and Global Structural Motifs at the Atomic Scale
Gasparotto, P., Meißner, R. H., & Ceriotti, M. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.7b00993 · Cited by 50 · see citing works
Self-citationGeneralized convex hull construction for materials discovery
Anelli, A., Engel, E. A., Pickard, C. J., & Ceriotti, M. (2018) · Physical Review Materials · doi:10.1103/physrevmaterials.2.103804 · Cited by 48 · see citing works
Self-citationModeling lithium-ion solid-state electrolytes with a pinball model
Kahle, L., Marcolongo, A., & Marzari, N. (2018) · Physical Review Materials · doi:10.1103/physrevmaterials.2.065405 · Cited by 48 · see citing works
The inefficiency of re-weighted sampling and the curse of system size in high-order path integration
Ceriotti, M., Brain, G. A. R., Riordan, O. M., & Manolopoulos, D. E. (2011) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2011.0413 · Cited by 44 · see citing works
Self-citationMapping and classifying molecules from a high-throughput structural database
De, S., Musil, F., Ingram, T., Baldauf, C., & Ceriotti, M. (2017) · Journal of Cheminformatics · doi:10.1186/s13321-017-0192-4 · Cited by 42 · see citing works
Self-citationMansbach, R. A., & Ferguson, A. L. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4914144 · Cited by 39 · see citing works
Delineation of Folding Pathways of a β-Sheet Miniprotein
Zheng, W., Qi, B., Rohrdanz, M. A., Caflisch, A., Dinner, A. R., & Clementi, C. (2011) · The Journal of Physical Chemistry B · doi:10.1021/jp2076935 · Cited by 39 · see citing works
Automated crystal characterization with a fast neighborhood graph analysis method
Reinhart, W. F., & Panagiotopoulos, A. Z. (2018) · Soft Matter · doi:10.1039/c8sm00960k · Cited by 37 · see citing works
Jung, H., Covino, R., & Hummer, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.04595 · Cited by 36 · see citing works
A chirality‐based metrics for free‐energy calculations in biomolecular systems
Pietropaolo, A., Branduardi, D., Bonomi, M., & Parrinello, M. (2011) · Journal of Computational Chemistry · doi:10.1002/jcc.21842 · Cited by 30 · see citing works
Pietrucci, F., & Martoňák, R. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4914138 · Cited by 24 · see citing works
Learning Sparse Latent Representations with the Deep Copula Information BottleneckPreprint
Wieczorek, A., Wieser, M., Murezzan, D., & Röth, V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.06216 · Cited by 23 · see citing works
Positive Definite Kernels in Machine LearningPreprint
Cuturi, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0911.5367 · Cited by 13 · see citing works
Preface: Special Topic on Materials Genome
Phillips, C. L., & Littlewood, P. B. (2016) · APL Materials · doi:10.1063/1.4952608 · Cited by 11 · see citing works
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
Machine Learning Interatomic Potentials as Emerging Tools for Materials Science
Deringer, V. L., Caro, M. A., & Cśanyi, G. (2019) · Advanced Materials · doi:10.1002/adma.201902765 · Cited by 1,051 · see citing works
Combining Machine Learning and Computational Chemistry for Predictive Insights Into Chemical Systems
Keith, J. A., Vassilev-Galindo, V., Cheng, B., Chmiela, S., Gastegger, M., Müller, K.-R., & Tkatchenko, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00107 · Cited by 849 · see citing works
Big-Data Science in Porous Materials: Materials Genomics and Machine Learning
Jablonka, K. M., Ongari, D., Moosavi, S. M., & Smit, B. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00004 · Cited by 636 · see citing works
Physics-Inspired Structural Representations for Molecules and Materials
Musil, F., Grisafi, A., Bartók, A. P., Ortner, C., Cśanyi, G., & Ceriotti, M. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00021 · Cited by 556 · see citing works
Self-citationPhysics-Inspired Structural Representations for Molecules and Materials
Musil, F., Grisafi, A., Bartók, A., Ortner, C., Cśanyi, G., Ceriotti, M., et al. (2021) · Cambridge University Engineering Department Publications Database · Cited by 440 · see citing works
Self-citationBottom-up Coarse-Graining: Principles and Perspectives
Jin, J., Pak, A. J., Durumeric, A. E. P., Loose, T. D., & Voth, G. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00643 · Cited by 296 · see citing works
Machine learning approaches for the prediction of materials properties
Chibani, S., & Coudert, F. (2020) · APL Materials · doi:10.1063/5.0018384 · Cited by 258 · see citing works
Amici, J., Asinari, P., Ayerbe, E., Barboux, P., Bayle‐Guillemaud, P., Behm, R. J., Berecibar, M., Berg, E. J., Bhowmik, A., Bodoardo, S., et al. (2022) · Advanced Energy Materials · doi:10.1002/aenm.202102785 · Cited by 238 · see citing works
Perspective on integrating machine learning into computational chemistry and materials science
Westermayr, J., Gastegger, M., Schütt, K. T., & Maurer, R. J. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0047760 · Cited by 209 · see citing works
How Machine Learning Will Revolutionize Electrochemical Sciences
Mistry, A. N., Franco, A. A., Cooper, S. J., Roberts, S. A., & Viswanathan, V. (2021) · ACS Energy Letters · doi:10.1021/acsenergylett.1c00194 · Cited by 191 · see citing works
Deep Learning for Deep Chemistry: Optimizing the Prediction of Chemical Patterns
Cova, T. F. G. G., & Pais, A. A. C. C. (2019) · Frontiers in Chemistry · doi:10.3389/fchem.2019.00809 · Cited by 182 · see citing works
Taking the leap between analytical chemistry and artificial intelligence: A tutorial review
Ayres, L. B., Gómez, F. J. V., Linton, J. R., Silva, M. F., & García, C. D. (2021) · Analytica Chimica Acta · doi:10.1016/j.aca.2021.338403 · Cited by 178 · see citing works
Material machine learning for alloys: Applications, challenges and perspectives
Liu, X., Xu, P., Zhao, J., Lu, W., Li, M., & Wang, G. (2022) · Journal of Alloys and Compounds · doi:10.1016/j.jallcom.2022.165984 · Cited by 153 · see citing works
Human- and machine-centred designs of molecules and materials for sustainability and decarbonization
Peng, J., Schwalbe‐Koda, D., Akkiraju, K., Xie, T., Giordano, L., Yu, Y., Eom, C. J., Lunger, J. R., Zheng, D. J., Rao, R. R., et al. (2022) · Nature Reviews Materials · doi:10.1038/s41578-022-00466-5 · Cited by 143 · see citing works
Neural network potentials for chemistry: concepts, applications and prospects
Käser, S., Vazquez-Salazar, L. I., Meuwly, M., & Töpfer, K. (2022) · Digital Discovery · doi:10.1039/d2dd00102k · Cited by 130 · see citing works
Mapping Materials and Molecules
Cheng, B., Griffiths, R., Wengert, S., Künkel, C., Stenczel, T. K., Zhu, B., Deringer, V. L., Bernstein, N., Margraf, J. T., Reuter, K., et al. (2020) · Accounts of Chemical Research · doi:10.1021/acs.accounts.0c00403 · Cited by 124 · see citing works
Machine learning for condensed matter physics
Bedolla-Montiel, E. A., Padierna, L. C., & Castañeda-Priego, R. (2020) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/abb895 · Cited by 123 · see citing works
A bright future for engineering piezoelectric 2D crystals
Sherrell, P. C., Fronzi, M., Shepelin, N. A., Corletto, A., Winkler, D. A., Ford, M. J., Shapter, J. G., & Ellis, A. V. (2021) · Chemical Society Reviews · doi:10.1039/d1cs00844g · Cited by 120 · see citing works
First-principles study of alkali-metal intercalation in disordered carbon anode materials
Huang, J., Cśanyi, G., Zhao, J., Cheng, J. J., & Deringer, V. L. (2019) · Journal of Materials Chemistry A · doi:10.1039/c9ta05453g · Cited by 102 · see citing works
SchNetPack 2.0: A neural network toolbox for atomistic machine learning
Schütt, K. T., Hessmann, S. S. P., Gebauer, N. W. A., Lederer, J., & Gastegger, M. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0138367 · Cited by 98 · see citing works
Using Gaussian process regression to simulate the vibrational Raman spectra of molecular crystals
Raimbault, N., Grisafi, A., Ceriotti, M., & Rossi, M. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab4509 · Cited by 82 · see citing works
Self-citationBonati, L., Trizio, E., Rizzi, A., & Parrinello, M. (2023) · Journal of Chemical Physics · doi:10.1063/5.0156343 · Cited by 96 · see citing works
Zhai, C., Li, T., Shi, H., & Yeo, J. (2020) · Journal of Materials Chemistry B · doi:10.1039/d0tb00896f · Cited by 84 · see citing works
An accurate machine-learning calculator for optimization of Li-ion battery cathodes
Houchins, G., & Viswanathan, V. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0015872 · Cited by 82 · see citing works
In Silico Chemical Experiments in the Age of AI: From Quantum Chemistry to Machine Learning and Back
Aldossary, A., Campos-Gonzalez-Angulo, J. A., Pablo‐García, S., Leong, S. X., Rajaonson, E. M., Thiede, L., Tom, G., Wang, A., Avagliano, D., & Aspuru‐Guzik, A. (2024) · Advanced Materials · doi:10.1002/adma.202402369 · Cited by 84 · see citing works
Machine Learning-Guided Approach for Studying Solvation Environments
Basdogan, Y., Groenenboom, M. C., Henderson, E., De, S., Rempe, S. B., & Keith, J. A. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00605 · Cited by 70 · see citing works
Switching of Redox Levels Leads to High Reductive Stability in Water-in-Salt Electrolytes
Wang, F., Sun, Y., & Cheng, J. J. (2023) · Journal of the American Chemical Society · doi:10.1021/jacs.2c11793 · Cited by 74 · see citing works
Machine Learning for the Discovery, Design, and Engineering of Materials.
Duan, C., Nandy, A., & Kulik, H. J. (2022) · Annual Review of Chemical and Biomolecular Engineering · doi:10.1146/annurev-chembioeng-092320-120230 · Cited by 69 · see citing works
Ramanathan, A., Ma, H., Parvatikar, A., & Chennubhotla, C. S. (2021) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2020.12.001 · Cited by 58 · see citing works
Prediction and Construction of Energetic Materials Based on Machine Learning Methods
Zang, X., Zhou, X., Bian, H., Jin, W., Pan, X., Jiang, J., Koroleva, M. Y., & Shen, R. (2022) · Molecules · doi:10.3390/molecules28010322 · Cited by 54 · see citing works
Identifying and Tracking Defects in Dynamic Supramolecular Polymers
Gasparotto, P., Bochicchio, D., Ceriotti, M., & Pavan, G. M. (2019) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.9b11015 · Cited by 52 · see citing works
Self-citationEnhanced Sampling in the Age of Machine Learning: Algorithms and Applications
Zhu, K., Trizio, E., Zhang, J., Hu, R., Jiang, L., Hou, T., & Bonati, L. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.5c00700 · Cited by 54 · see citing works
Tetef, S., Govind, N., & Seidler, G. T. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp02903g · Cited by 52 · see citing works
Artificial neural networks for predicting charge transfer coupling
Wang, C.-I., Joanito, I., Lan, C., & Hsu, C. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0023697 · Cited by 49 · see citing works
Efficient implementation of atom-density representations
Musil, F., Veit, M., Goscinski, A., Fraux, G., Willatt, M. J., Stricker, M., Junge, T., & Ceriotti, M. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0044689 · Cited by 50 · see citing works
Self-citationMaking machine learning a useful tool in the accelerated discovery of transition metal complexes
Kulik, H. J. (2019) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1439 · Cited by 47 · see citing works
Edström, K., Dominko, R., Fichtner, M., & Perraud, S. (2020) · doi:10.33063/diva2-1452023 · Cited by 46 · see citing works
Structure-property maps with Kernel principal covariates regression
Helfrecht, B. A., Cersonsky, R. K., Fraux, G., & Ceriotti, M. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba9ef · Cited by 43 · see citing works
Self-citationEfficient implementation of atom-density representations
Musil, F., Veit, M., Goscinski, A., Fraux, G., Willatt, M. J., Stricker, M., Junge, T., & Ceriotti, M. (2022) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-34235 · Cited by 46 · see citing works
Self-citationA new kind of atlas of zeolite building blocks
Helfrecht, B. A., Semino, R., Pireddu, G., Auerbach, S. M., & Ceriotti, M. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5119751 · Cited by 43 · see citing works
Self-citationData-Driven Molecular Dynamics: A Multifaceted Challenge
Bernetti, M., Bertazzo, M., & Masetti, M. (2020) · Pharmaceuticals · doi:10.3390/ph13090253 · Cited by 43 · see citing works
Reaction coordinates in complex systems-a perspective
Rogal, J. (2021) · The European Physical Journal B · doi:10.1140/epjb/s10051-021-00233-5 · Cited by 43 · see citing works
E-Commerce System for Sale Prediction Using Machine Learning Technique
Singh, K., Marikannan, B. P., & Eaganathan, U. (2020) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1712/1/012042 · Cited by 45 · see citing works
Artificial intelligence interventions in 2D MXenes-based photocatalytic applications
Mahapatra, D. M., Kumar, A., Kumar, R., Gupta, N. K., Ethiraj, B., & Singh, L. (2025) · Coordination Chemistry Reviews · doi:10.1016/j.ccr.2025.216460 · Cited by 39 · see citing works
Litman, Y. E., Behler, J., & Rossi, M. (2019) · Faraday Discussions · doi:10.1039/c9fd00056a · Cited by 39 · see citing works
Rossi, K., Jurásková, V., Wischert, R., Garel, L., Corminbœuf, C., & Ceriotti, M. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00362 · Cited by 37 · see citing works
Self-citationDriving and characterizing nucleation of urea and glycine polymorphs in water
Zou, Z., Beyerle, E., Tsai, S.-T., & Tiwary, P. (2022) · Proceedings of the National Academy of Sciences of the United States of America · doi:10.1073/pnas.2216099120 · Cited by 39 · see citing works
Godeffroy, L., Lemineur, J., Shkirskiy, V., Vieira, M. M., Noël, J., & Kanoufi, F. (2022) · Small Methods · doi:10.1002/smtd.202200659 · Cited by 37 · see citing works
Classifying soft self-assembled materials via unsupervised machine learning of defects
Gardin, A., Perego, C., Doni, G., & Pavan, G. M. (2022) · Communications Chemistry · doi:10.1038/s42004-022-00699-z · Cited by 37 · see citing works
Duan, C., Liu, F., Nandy, A., & Kulik, H. J. (2020) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.0c02018 · Cited by 35 · see citing works
Offei-Danso, A., Hassanali, A. A., & Rodríguez, Á. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01292 · Cited by 34 · see citing works
Multiscale molecular modelling: from electronic structure to dynamics of nanosystems and beyond
Salahub, D. R. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp05928a · Cited by 32 · see citing works
Exploring structure-property relationships in magnesium dissolution modulators
Würger, T., Mei, D., Vaghefinazari, B., Winkler, D. A., Lamaka, S. V., Zheludkevich, M. L., Meißner, R. H., & Feiler, C. (2021) · npj Materials Degradation · doi:10.1038/s41529-020-00148-z · Cited by 30 · see citing works
A Comprehensive Survey on Knowledge-Defined Networking
Wijesekara, P. A. D. S. N., & Gunawardena, S. (2023) · Telecom · doi:10.3390/telecom4030025 · Cited by 32 · see citing works
Armaković, S. J., Armaković, S., Bilić, A., & Savanović, M. M. (2025) · Catalysts · doi:10.3390/catal15080793 · Cited by 30 · see citing works
Moses, O. A., Chen, W., Adam, M. L., Wang, Z., Liu, K., Shao, J., Li, Z., Li, W., Wang, C., Zhao, H., et al. (2021) · Materials Reports Energy · doi:10.1016/j.matre.2021.100049 · Cited by 29 · see citing works
Wang, F., & Cheng, J. J. (2022) · Chemical Science · doi:10.1039/d2sc04025e · Cited by 29 · see citing works
Uncertainty quantification for predictions of atomistic neural networks
Vazquez-Salazar, L. I., Boittier, E. D., & Meuwly, M. (2022) · Chemical Science · doi:10.1039/d2sc04056e · Cited by 27 · see citing works
Moulahoum, H., & Ghorbanizamani, F. (2024) · Food Chemistry · doi:10.1016/j.foodchem.2024.138800 · Cited by 28 · see citing works
Differentiable Molecular Simulations for Control and LearningPreprint
Wang, W., Axelrod, S., & Gómez‐Bombarelli, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.00868 · Cited by 38 · see citing works
Caruso, C., Cardellini, A., Crippa, M., Rapetti, D., & Pavan, G. M. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0147025 · Cited by 27 · see citing works
Nicholas, T. C., Goodwin, A. L., & Deringer, V. L. (2020) · Chemical Science · doi:10.1039/d0sc03287e · Cited by 26 · see citing works
Machine learning-based structure–property predictions in silica aerogels
Abdusalamov, R., Pandit, P., Milow, B., Itskov, M., & Rege, A. (2021) · Soft Matter · doi:10.1039/d1sm00307k · Cited by 26 · see citing works
Duan, C., Chu, D. B. K., Nandy, A., & Kulik, H. J. (2022) · Chemical Science · doi:10.1039/d2sc00393g · Cited by 26 · see citing works
Desgranges, C., & Delhommelle, J. (2020) · Molecular Systems Design & Engineering · doi:10.1039/d0me00134a · Cited by 22 · see citing works
Rimola, A., Ferrero, S., Germain, A., Corno, M., & Ugliengo, P. (2020) · Minerals · doi:10.3390/min11010026 · Cited by 15 · see citing works
Tetef, S., Kashyap, V., Holden, W. M., Velian, A., Govind, N., & Seidler, G. T. (2022) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.2c03635 · Cited by 22 · see citing works
Ligand additivity relationships enable efficient exploration of transition metal chemical space
Arunachalam, N., Gugler, S., Taylor, M. G., Duan, C., Nandy, A., Janet, J. P., Meyer, R., Oldenstaedt, J. A., Chu, D. B. K., & Kulik, H. J. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0125700 · Cited by 19 · see citing works
Mapping fluid structuration to flow enhancement in nanofluidic channels
Agarwal, A., Arya, V., Golani, B., Bakli, C., & Chakraborty, S. K. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0140765 · Cited by 22 · see citing works
Feng, J., Wang, H., Ji, Y., & Li, Y. (2021) · Nano Select · doi:10.1002/nano.202100006 · Cited by 21 · see citing works
Spectral Map: Embedding Slow Kinetics in Collective Variables
Rydzewski, J. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c01101 · Cited by 21 · see citing works
Machine learning of slow collective variables and enhanced sampling via spatial techniques
Gökdemir, T., & Rydzewski, J. (2025) · Chemical Physics Reviews · doi:10.1063/5.0245177 · Cited by 20 · see citing works
Application of Optimization Algorithms in Clusters
Srivastava, R. (2021) · Frontiers in Chemistry · doi:10.3389/fchem.2021.637286 · Cited by 20 · see citing works
Gaigeot, M. (2021) · Spectrochimica Acta Part A Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2021.119864 · Cited by 20 · see citing works
Manifold learning in atomistic simulations: a conceptual review
Rydzewski, J., Chen, M., & Valsson, Ó. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ace81a · Cited by 21 · see citing works
Valero, M. C., & Raybaud, P. (2020) · Journal of Catalysis · doi:10.1016/j.jcat.2020.09.006 · Cited by 19 · see citing works
Fanourgakis, G. S., Gkagkas, K., & Froudakis, G. E. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0075994 · Cited by 19 · see citing works
Unsupervised topological learning for identification of atomic structures
Becker, S., Devijver, É., Molinier, R., & Jakse, N. (2022) · Physical review. E · doi:10.1103/physreve.105.045304 · Cited by 1 · see citing works
Duan, C., Ladera, A., Liu, J. C. L., Taylor, M. G., Ariyarathna, I. R., & Kulik, H. J. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00468 · Cited by 18 · see citing works
Computational Design of Peptides for Biomaterials Applications
Wang, Y., Stebe, K. J., de la Fuente‐Núñez, C., & Radhakrishnan, R. (2023) · ACS Applied Bio Materials · doi:10.1021/acsabm.2c01023 · Cited by 18 · see citing works
Unsupervised topological learning approach of crystal nucleation
Becker, S., Devijver, É., Molinier, R., & Jakse, N. (2022) · Scientific Reports · doi:10.1038/s41598-022-06963-5 · Cited by 18 · see citing works
Unsupervised identification of crystal defects from atomistic potential descriptors
Kývala, L., de Hijes, P. M., & Christoph Dellago, A. (2025) · npj Computational Materials · doi:10.1038/s41524-025-01544-2 · Cited by 17 · see citing works
Wasserstein metric for improved quantum machine learning with adjacency matrix representations
Çaylak, O., von Lilienfeld, O. A., & Baumeier, B. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba048 · Cited by 15 · see citing works
Visualizing the Residue Interaction Landscape of Proteins by Temporal Network Embedding
Franke, L., & Peter, C. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c01228 · Cited by 18 · see citing works
Aquistapace, F., Amigó, N., Troncoso, J. F., Deluigi, O. R., & Bringa, E. M. (2023) · Computational Materials Science · doi:10.1016/j.commatsci.2023.112263 · Cited by 17 · see citing works
Machine learning a molecular Hamiltonian for predicting electron dynamics
Bhat, H. S., Ranka, K., & Isborn, C. M. (2020) · International Journal of Dynamics and Control · doi:10.1007/s40435-020-00699-8 · Cited by 16 · see citing works
Bougueroua, S., Bricage, M., Aboulfath, Y., Barth, D., & Gaigeot, M. (2023) · Molecules · doi:10.3390/molecules28072892 · Cited by 16 · see citing works
Understanding 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 International Edition · doi:10.1002/anie.202403842 · Cited by 15 · see citing works
Shi, W., Jia, T., & Li, A. (2020) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp01941k · Cited by 16 · see citing works
Classification of clusters in collision cascades
Bhardwaj, U., Sand, A. E., & Warrier, M. K. (2019) · Computational Materials Science · doi:10.1016/j.commatsci.2019.109364 · Cited by 15 · see citing works
Lewis, A. M., Lazzaroni, P., & Rossi, M. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0154710 · Cited by 15 · see citing works
Element similarity in high-dimensional materials representations
Onwuli, A., Hegde, A. V., Nguyen, K. V. T., Butler, K. T., & Walsh, A. (2023) · Digital Discovery · doi:10.1039/d3dd00121k · Cited by 15 · see citing works
Unsupervised Machine Learning in the Analysis of Nonadiabatic Molecular Dynamics Simulation
Zhu, Y., Peng, J., Xu, C., & Lan, Z. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c01751 · Cited by 15 · see citing works
Ranking the synthesizability of hypothetical zeolites with the sorting hat
Helfrecht, B. A., Pireddu, G., Semino, R., Auerbach, S. M., & Ceriotti, M. (2022) · Digital Discovery · doi:10.1039/d2dd00056c · Cited by 15 · see citing works
Self-citationMean-field density matrix decompositions
Eriksen, J. J. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0030764 · Cited by 15 · see citing works
Machine learning-driven insights into the microstructure and properties of high-entropy alloys
Zhang, X., Zhou, W., Li, X., Xu, T., Yu, Y., Zheng, L., Jin, G., & Zhang, S. (2025) · Advanced Powder Materials · doi:10.1016/j.apmate.2025.100331 · Cited by 14 · see citing works
Coarse-Grained Artificial Intelligence for Design of Brush Networks
Dobrynin, A. V., Stroujkova, A. F., Vatankhah‐Varnosfaderani, M., & Sheiko, S. S. (2023) · ACS Macro Letters · doi:10.1021/acsmacrolett.3c00479 · Cited by 14 · see citing works
Zhu, Y., Peng, J., Kang, X., Xu, C., & Lan, Z. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d2cp03323b · Cited by 13 · see citing works
Fabrizio, A., Meyer, B., & Corminbœuf, C. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0005039 · Cited by 13 · see citing works
Metric learning for kernel ridge regression: assessment of molecular similarity
Fabregat, R., van Gerwen, P., Haeberle, M., Eisenbrand, F., & Corminbœuf, C. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac8e4f · Cited by 12 · see citing works
- 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.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-08.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-08.
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