Jenna Pope

Dr. Jenna Pope

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2025 in npj Computational Materials
Verified
Journal Article
Open access
PDF file
JPJenna Pope
Jenna Pope
JFJesun S. Firoz
Jesun S. Firoz
MLMal-Soon Lee
Mal-Soon Lee
SCSutanay Choudhury
Sutanay Choudhury
For neural network potentials (NNPs) to gain widespread use, researchers must be able to trust model outputs. However, the blackbox nature of neural networks and their inherent stochasticity are often deterrents, especially for foundation models trained over broad swaths of chemical space. Uncertainty information provided at the time of prediction can help reduce aversion to NNPs. In this work, we detail two uncertainty quantification (UQ) methods. Readout ensembling, by finetuning the readout layers of an ensemble of foundation models, provides information about model uncertainty, while quantile regression, by replacing point predictions with distributional predictions, provides information about uncertainty within the underlying training data. We demonstrate our approach with the MACE-MP-0 model, applying UQ to the foundation model and a series of finetuned models. The uncertainties produced by the readout ensemble and quantile methods are demonstrated to be distinct measures by which the quality of the NNP output can be judged.

29 October 2025 in npj Computational Materials
Verified
Journal Article
Open access
PDF file
MTM. F. N. Taufique
M. F. N. Taufique
JNJulia Nguyen
Julia Nguyen
JEJulian D. Escobar
Julian D. Escobar
MPMayur Pole
Mayur Pole
DGDavid Garcia
David Garcia
JPJenna Pope
Jenna Pope
We demonstrate generalizable semantic segmentation using minimal ground truth data. Correlated scanning electron microscopy (SEM) images and electron backscatter diffraction (EBSD) measurements of friction-stir processed 316L stainless steel plates were used to train deep learning models for grain boundary segmentation. Secondary electron (SE) imaging taken at 10 keV correlated to EBSD-derived grain boundaries produced the best performing model. Notably, an ensemble of three models trained on a single SE image produced accurate segmentation over a series of backscatter electron (BSE) images of samples manufactured under different processing parameters, with a mean absolute error in grain size of 0.34 µm. The generalizability of the models likely results from the similar escape depths of the SE training input and the EBSD training output and the reduced probability of stored strain artifacts appearing in the image. This highlights the importance of considering the physical principles behind imaging to develop robust models for microstructure characterization.

15 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
ATArman H Ter-Petrosyan
Arman H Ter-Petrosyan
JPJenna Pope
Jenna Pope
CDChristina M Doty
Christina M Doty
BMBethany E Matthews
Bethany E Matthews
LWLe Wang
Le Wang
SSSteven R Spurgeon
Steven R Spurgeon
We present a method for the unsupervised segmentation of electron microscopy images, which are powerful descriptors of materials and chemical systems. Images are oversegmented into overlapping chips, and similarity graphs are generated from embeddings extracted from a domain$\unicode{x2010}$pretrained convolutional neural network (CNN). The Louvain method for community detection is then applied to perform segmentation. The graph representation provides an intuitive way of presenting the relationship between chips and communities. We demonstrate our method to track irradiation$\unicode{x2010}$induced amorphous fronts in thin films used for catalysis and electronics. This method has potential for "on$\unicode{x2010}$the$\unicode{x2010}$fly" segmentation to guide emerging automated electron microscopes.

8 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
JPJenna Pope
Jenna Pope
KHKristina M. Herman
Kristina M. Herman
HSHenry Sprueill
Henry Sprueill
SXSoritis S. Xantheas
Soritis S. Xantheas
PDPayel Das
Payel Das
SCSutanay Choudhury
Sutanay Choudhury
The demonstrated success of transfer learning has popularized approaches that involve pretraining models from massive data sources and subsequent finetuning towards a specific task. While such approaches have become the norm in fields such as natural language processing, implementation and evaluation of transfer learning approaches for chemistry are in the early stages. In this work, we demonstrate finetuning for downstream tasks on a graph neural network (GNN) trained over a molecular database containing 2.7 million water clusters. The use of Graphcore IPUs as an AI accelerator for training molecular GNNs reduces training time from a reported 2.7 days on 0.5M clusters to 1.2 hours on 2.7M clusters. Finetuning the pretrained model for downstream tasks of molecular dynamics and transfer to a different potential energy surface took only 8.3 hours and 28 minutes, respectively, on a single GPU.

14 April 2025 in arXiv
Verified
Preprint
Open access
PDF file
JFJesun Firoz
Jesun Firoz
FPFranco Pellegrini
Franco Pellegrini
MGMario Geiger
Mario Geiger
DHDarren Hsu
Darren Hsu
JPJenna Pope
Jenna Pope
SCSutanay Choudhury
Sutanay Choudhury
Chemistry Foundation Models (CFMs) that leverage Graph Neural Networks (GNNs) operating on 3D molecular graph structures are becoming indispensable tools for computational chemists and materials scientists. These models facilitate the understanding of matter and the discovery of new molecules and materials. In contrast to GNNs operating on a large homogeneous graphs, GNNs used by CFMs process a large number of geometric graphs of varying sizes, requiring different optimization strategies than those developed for large homogeneous GNNs. This paper presents optimizations for two critical phases of CFM training: data distribution and model training, targeting MACE - a state-of-the-art CFM. We address the challenge of load balancing in data distribution by formulating it as a multi-objective bin packing problem. We propose an iterative algorithm that provides a highly effective, fast, and practical solution, ensuring efficient data distribution. For the training phase, we identify symmetric tensor contraction as the key computational kernel in MACE and optimize this kernel to improve the overall performance. Our combined approach of balanced data distribution and kernel optimization significantly enhances the training process of MACE. Experimental results demonstrate a substantial speedup, reducing per-epoch execution time for training from 12 to 2 minutes on 740 GPUs with a 2.6M sample dataset.