The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Reliable and explainable machine-learning methods for accelerated material discovery
Open accessAbstract
Despite ML’s impressive performance in commercial applications, several unique challenges exist when applying ML in materials science applications. In such a context, the contributions of this work are twofold. First, we identify common pitfalls of existing ML techniques when learning from underrepresented/imbalanced material data. Specifically, we show that with imbalanced data, standard methods for assessing quality of ML models break down and lead to misleading conclusions. Furthermore, we find that the model’s own confidence score cannot be trusted and model introspection methods (using simpler models) do not help as they result in loss of predictive performance (reliability-explainability trade-off). Second, to overcome these challenges, we propose a general-purpose explainable and reliable machine-learning framework. Specifically, we propose a generic pipeline that employs an ensemble of simpler models to reliably predict material properties. We also propose a transfer learning technique and show that the performance loss due to models’ simplicity can be overcome by exploiting correlations among different material properties. A new evaluation metric and a trust score to better quantify the confidence in the predictions are also proposed. To improve the interpretability, we add a rationale generator component to our framework which provides both model-level and decision-level explanations. Finally, we demonstrate the versatility of our technique on two applications: (1) predicting properties of crystalline compounds and (2) identifying potentially stable solar cell materials. We also point to some outstanding issues yet to be resolved for a successful application of ML in material science.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
Gaussian Approximation Potentials: The Accuracy of Quantum Mechanics, without the Electrons
Bartók, A. P., Payne, M. C., Kondor, R., & Csányi, G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.136403 · Cited by 3,242
Learning from imbalanced data: open challenges and future directions
Krawczyk, B. (2016) · Progress in Artificial Intelligence · doi:10.1007/s13748-016-0094-0 · Cited by 2,459
QSAR Modeling: Where have you been? Where are you going to?
Cherkasov, A., Muratov, E. N., Fourches, D., Varnek, A., Baskin, I. I., Cronin, M., Dearden, J., Gramatica, P., Martin, Y. C., Todeschini, R., et al. (2014) · Journal of Medicinal Chemistry · doi:10.1021/jm4004285 · Cited by 2,164
Belsky, A., Hellenbrandt, M., Karen, V. L., & Luksch, P. (2002) · Acta Crystallographica Section B Structural Science · doi:10.1107/s0108768102006948 · Cited by 1,379
Understanding Random Forests: From Theory to Practice
Louppe, G. (2014) · arXiv · doi:10.48550/arxiv.1407.7502 · Cited by 693
Machine learning bandgaps of double perovskites
Pilania, G., Mannodi-Kanakkithodi, A., Uberuaga, B. P., Ramprasad, R., Gubernatis, J. E., & Lookman, T. (2016) · Scientific Reports · doi:10.1038/srep19375 · Cited by 518
Data Mined Ionic Substitutions for the Discovery of New Compounds
Hautier, G., Fischer, C., Ehrlacher, V., Jain, A., & Ceder, G. (2011) · Inorganic Chemistry · doi:10.1021/ic102031h · Cited by 394
Interpretable classification models for recidivism prediction
Zeng, J., Ustun, B., & Rudin, C. (2017) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/rssa.12227 · Cited by 220
Cited by
Explainable machine learning for scientific insights and discoveries
Roscher, R., Bohn, B., Duarte, M. F., & Garcke, J. (2020) · IEEE Access · doi:10.1109/access.2020.2976199 · Cited by 1,040
“For example, [78] discusses explainable ML for scien-”
BackgroundExplainable machine learning in materials science
Zhong, X., Gallagher, B., Liu, S., Kailkhura, B., Hiszpanski, A., & Han, T. Y.-J. (2022) · npj Computational Materials · doi:10.1038/s41524-022-00884-7 · Cited by 501
Self-citationPredicting Materials Properties with Little Data Using Shotgun Transfer Learning
Yamada, H., Liu, C., Wu, S., Koyama, Y., Ju, S., Shiomi, J., Morikawa, J., & Yoshida, R. (2019) · ACS Central Science · doi:10.1021/acscentsci.9b00804 · Cited by 393
Machine learning in materials science: From explainable predictions to autonomous design
Pilania, G. (2021) · Computational Materials Science · doi:10.1016/j.commatsci.2021.110360 · Cited by 281
A quantitative uncertainty metric controls error in neural network-driven chemical discovery
Janet, J. P., Duan, C., Yang, T., Nandy, A., & Kulik, H. J. (2019) · Chemical Science · doi:10.1039/c9sc02298h · Cited by 243
Metadata
- Authors
- Kailkhura, B., Gallagher, B., Kim, S., Hiszpanski, A., & Han, T. Y.-J.
- Venue
- npj Computational Materials
- Published
- 2019-11-14
- Volume
- 5
- Issue
- 1
- ISSN
- 2057-3960 (ISSN-L)
- OpenAlex
- W2909765544
- Cited by
- 211
- References
- 11
- FWCI
- 8.16
- Type
- journal article
- Language
- en
- Open access
- gold
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.
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reliable and explainable machine-learning methods for accelerated material discovery. https://app.cochat.ai/papers/10.1038/s41524-019-0248-2
- The paper
- Kailkhura, B., Gallagher, B., Kim, S., Hiszpanski, A., & Han, T. Y.-J. (2019). Reliable and explainable machine-learning methods for accelerated material discovery. npj Computational Materials. https://doi.org/10.1038/s41524-019-0248-2
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.