Earl Lawrence
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Earl Lawrence has a total of 131 co-authors. Here are the top co-authors by number of shared publications:
David Higdon
8 shared publicationsSalman Habib
HEP Division, Argonne National Laboratory, Lemont, IL 60439, USA
6 shared publications- Scott Vander Wiel
Los Alamos National Laboratory
6 shared publications - Ayan Biswas
Los Alamos National Laboratory, USA
4 shared publications Katrin Heitmann
High Energy Physics Division, Argonne National Laboratory, Lemont, IL 60439, USA
4 shared publications- Katrin Heitmann
Argonne National Laboratory
4 shared publications
Latest Publications
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (1) , 1021-1031
VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization
We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specific and dynamically generated modules. Users initially access core functionalities-such as threshold-based filtering, slice extraction, and statistical analysis-through pre-existing tools. For tasks beyond this baseline, VizGenie autonomously employs LLMs to generate new visualization scripts (e.g., VTK Python code), expanding its capabilities on-demand. Each generated script undergoes automated backend validation and is seamlessly integrated upon successful testing, continuously enhancing the system's adaptability and robustness. A distinctive feature of VizGenie is its intuitive natural language interface, allowing users to issue high-level feature-based queries (e.g., “visualize the skull” or “highlight tissue boundaries”). The system leverages image-based analysis and visual question answering (VQA) via fine-tuned vision models to interpret these queries precisely, bridging domain expertise and technical implementation. Additionally, users can interactively query generated visualizations through VQA, facilitating deeper exploration. Reliability and reproducibility are further strengthened by Retrieval-Augmented Generation (RAG), providing context-driven responses while maintaining comprehensive provenance records. Evaluations on complex volumetric datasets demonstrate significant reductions in cognitive overhead for iterative visualization tasks. By integrating curated domain-specific tools with LLM-driven flexibility, VizGenie not only accelerates insight generation but also establishes a sustainable, continuously evolving visualization practice. The resulting platform dynamically learns from user interactions, consistently enhancing support for feature-centric exploration and reproducible research in scientific visualization.
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (1) , 1021-1031
VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization
We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specific and dynamically generated modules. Users initially access core functionalities-such as threshold-based filtering, slice extraction, and statistical analysis-through pre-existing tools. For tasks beyond this baseline, VizGenie autonomously employs LLMs to generate new visualization scripts (e.g., VTK Python code), expanding its capabilities on-demand. Each generated script undergoes automated backend validation and is seamlessly integrated upon successful testing, continuously enhancing the system's adaptability and robustness. A distinctive feature of VizGenie is its intuitive natural language interface, allowing users to issue high-level feature-based queries (e.g., “visualize the skull” or “highlight tissue boundaries”). The system leverages image-based analysis and visual question answering (VQA) via fine-tuned vision models to interpret these queries precisely, bridging domain expertise and technical implementation. Additionally, users can interactively query generated visualizations through VQA, facilitating deeper exploration. Reliability and reproducibility are further strengthened by Retrieval-Augmented Generation (RAG), providing context-driven responses while maintaining comprehensive provenance records. Evaluations on complex volumetric datasets demonstrate significant reductions in cognitive overhead for iterative visualization tasks. By integrating curated domain-specific tools with LLM-driven flexibility, VizGenie not only accelerates insight generation but also establishes a sustainable, continuously evolving visualization practice. The resulting platform dynamically learns from user interactions, consistently enhancing support for feature-centric exploration and reproducible research in scientific visualization.
- Open Access
- 16 October 2024
- Published by Office of Scientific and Technical Information (OSTI)
Implications of new Reasoning Capabilities for Science and Security: Results from a quick initial study
The U.S. Department of Energy's Office of Scientific and Technical Information
- 16 October 2024
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessImplications of new Reasoning Capabilities for Science and Security: Results from a quick initial study
The U.S. Department of Energy's Office of Scientific and Technical Information
- Open Access
A New Method for Multinomial Inference using Dempster-Shafer Theory
A new method for multinomial inference is proposed by representing the cell probabilities as unordered segments on the unit interval and following Dempster-Shafer (DS) theory. The resulting DS posterior is then strengthened to improve symmetry and learning properties with the final posterior model being characterized by a Dirichlet distribution. In addition to computational simplicity, the new model has desirable invariance properties related to category permutations, refinements, and coarsenings. Furthermore, posterior inference on relative probabilities amongst certain cells depends only on data for the cells in question. Finally, the model is quite flexible with regard to parameterization and the range of testable assertions. Comparisons are made to existing methods and illustrated with two examples.
Open AccessA New Method for Multinomial Inference using Dempster-Shafer Theory
A new method for multinomial inference is proposed by representing the cell probabilities as unordered segments on the unit interval and following Dempster-Shafer (DS) theory. The resulting DS posterior is then strengthened to improve symmetry and learning properties with the final posterior model being characterized by a Dirichlet distribution. In addition to computational simplicity, the new model has desirable invariance properties related to category permutations, refinements, and coarsenings. Furthermore, posterior inference on relative probabilities amongst certain cells depends only on data for the cells in question. Finally, the model is quite flexible with regard to parameterization and the range of testable assertions. Comparisons are made to existing methods and illustrated with two examples.
- Open Access
- 23 June 2024
- Published by The Open Journal in JuliaCon Proceedings
- Vol. 6 (60) , 134
Julia for HPC: In Situ Data Analysis with Julia for Climate Simulations at Large Scale
- 23 June 2024
- Published by The Open Journal in JuliaCon Proceedings
- Vol. 6 (60) , 134
Open AccessJulia for HPC: In Situ Data Analysis with Julia for Climate Simulations at Large Scale
- 13 February 2024
- Published by Office of Scientific and Technical Information (OSTI)
The Director’s Initiative Project on AI [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information
- 13 February 2024
- Published by Office of Scientific and Technical Information (OSTI)
The Director’s Initiative Project on AI [Slides]
The U.S. Department of Energy's Office of Scientific and Technical Information
- Open Access
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12227, 21-125
Fast emulation of density functional theory simulations using approximate Gaussian processes
Fitting a theoretical model to experimental data in a Bayesian manner using Markov chain Monte Carlo typically requires one to evaluate the model thousands (or millions) of times. When the model is a slow-to-compute physics simulation, Bayesian model fitting becomes infeasible. To remedy this, a second statistical model that predicts the simulation output – an “emulator” – can be used in lieu of the full simulation during model fitting. A typical emulator of choice is the Gaussian process (GP), a flexible, non-linear model that provides both a predictive mean and variance at each input point. Gaussian process regression works well for small amounts of training data (n < 103), but becomes slow to train and use for prediction when the data set size becomes large. Various methods can be used to speed up the Gaussian process in the medium-to-large data set regime (n < 105), trading away predictive accuracy for drastically reduced runtime. This work examines the accuracy-runtime trade-off of several approximate Gaussian process models – the sparse variational GP, stochastic variational GP, and deep kernel learned GP – when emulating the predictions of density functional theory (DFT) models. Additionally, we use the emulators to calibrate, in a Bayesian manner, the DFT model parameters using observed data, resolving the computational barrier imposed by the data set size, and compare calibration results to previous work. The utility of these calibrated DFT models is to make predictions, based on observed data, about the properties of experimentally unobserved nuclides of interest e.g. super-heavy nuclei.
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12227, 21-125
Open AccessFast emulation of density functional theory simulations using approximate Gaussian processes
Fitting a theoretical model to experimental data in a Bayesian manner using Markov chain Monte Carlo typically requires one to evaluate the model thousands (or millions) of times. When the model is a slow-to-compute physics simulation, Bayesian model fitting becomes infeasible. To remedy this, a second statistical model that predicts the simulation output – an “emulator” – can be used in lieu of the full simulation during model fitting. A typical emulator of choice is the Gaussian process (GP), a flexible, non-linear model that provides both a predictive mean and variance at each input point. Gaussian process regression works well for small amounts of training data (n < 103), but becomes slow to train and use for prediction when the data set size becomes large. Various methods can be used to speed up the Gaussian process in the medium-to-large data set regime (n < 105), trading away predictive accuracy for drastically reduced runtime. This work examines the accuracy-runtime trade-off of several approximate Gaussian process models – the sparse variational GP, stochastic variational GP, and deep kernel learned GP – when emulating the predictions of density functional theory (DFT) models. Additionally, we use the emulators to calibrate, in a Bayesian manner, the DFT model parameters using observed data, resolving the computational barrier imposed by the data set size, and compare calibration results to previous work. The utility of these calibrated DFT models is to make predictions, based on observed data, about the properties of experimentally unobserved nuclides of interest e.g. super-heavy nuclei.
- Open Access
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12227, 23-138
A hierarchical sparse Gaussian process for in situ inference in expensive physics simulations
High-fidelity physics simulations, such as the Energy Exascale Earth System Model (E3SM), are generating ever increasing quantities of data. In the near future, it will be infeasible to store the full computation after the simulation. To facilitate the training of complex machine learning models in the future, there is a glaring need for in-situ inference algorithms. In this work, we focus on the need for spatio-temporal inference models which are (i) highly scalable, (ii) distributed, (iii) able to capture small-scale, high-resolution structures, and (iv) longrange global structure. One possible approach is to leverage algorithms for fast approximate Gaussian process regression, such as the sparse variational Gaussian process (SVGP). In this work, we present a Hierarchical SVGP (HSVGP) model in which local models capture small-scale structures in-situ, while large-scale structures are captured and communicated by a global SVGP. We also consider the simpler approach in which independent, parallel sparse Gaussian processes are fit to each local region with no additional global information. Using both synthetic data and E3SM model output, we show the success of the HSVGP approach in some settings, but also the surprisingly good performance of the independent approach.
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12227, 23-138
Open AccessA hierarchical sparse Gaussian process for in situ inference in expensive physics simulations
High-fidelity physics simulations, such as the Energy Exascale Earth System Model (E3SM), are generating ever increasing quantities of data. In the near future, it will be infeasible to store the full computation after the simulation. To facilitate the training of complex machine learning models in the future, there is a glaring need for in-situ inference algorithms. In this work, we focus on the need for spatio-temporal inference models which are (i) highly scalable, (ii) distributed, (iii) able to capture small-scale, high-resolution structures, and (iv) longrange global structure. One possible approach is to leverage algorithms for fast approximate Gaussian process regression, such as the sparse variational Gaussian process (SVGP). In this work, we present a Hierarchical SVGP (HSVGP) model in which local models capture small-scale structures in-situ, while large-scale structures are captured and communicated by a global SVGP. We also consider the simpler approach in which independent, parallel sparse Gaussian processes are fit to each local region with no additional global information. Using both synthetic data and E3SM model output, we show the success of the HSVGP approach in some settings, but also the surprisingly good performance of the independent approach.
- Open Access
The Mira-Titan Universe IV. High Precision Power Spectrum Emulation
Modern cosmological surveys are delivering datasets characterized by unprecedented quality and statistical completeness; this trend is expected to continue into the future as new ground- and space-based surveys come online. In order to maximally extract cosmological information from these observations, matching theoretical predictions are needed. At low redshifts, the surveys probe the nonlinear regime of structure formation where cosmological simulations are the primary means of obtaining the required information. The computational cost of sufficiently resolved large-volume simulations makes it prohibitive to run very large ensembles. Nevertheless, precision emulators built on a tractable number of high-quality simulations can be used to build very fast prediction schemes to enable a variety of cosmological inference studies. We have recently introduced the Mira-Titan Universe simulation suite designed to construct emulators for a range of cosmological probes. The suite covers the standard six cosmological parameters $\{\omega_m,\omega_b, \sigma_8, h, n_s, w_0\}$ and, in addition, includes massive neutrinos and a dynamical dark energy equation of state, $\{\omega_{\nu}, w_a\}$. In this paper we present the final emulator for the matter power spectrum based on 111 cosmological simulations, each covering a (2.1Gpc)$^3$ volume and evolving 3200$^3$ particles. An additional set of 1776 lower-resolution simulations and TimeRG perturbation theory results for the power spectrum are used to cover scales straddling the linear to mildly nonlinear regimes. The emulator provides predictions at the two to three percent level of accuracy over a wide range of cosmological parameters and is publicly released as part of this paper.Open AccessThe Mira-Titan Universe IV. High Precision Power Spectrum Emulation
Modern cosmological surveys are delivering datasets characterized by unprecedented quality and statistical completeness; this trend is expected to continue into the future as new ground- and space-based surveys come online. In order to maximally extract cosmological information from these observations, matching theoretical predictions are needed. At low redshifts, the surveys probe the nonlinear regime of structure formation where cosmological simulations are the primary means of obtaining the required information. The computational cost of sufficiently resolved large-volume simulations makes it prohibitive to run very large ensembles. Nevertheless, precision emulators built on a tractable number of high-quality simulations can be used to build very fast prediction schemes to enable a variety of cosmological inference studies. We have recently introduced the Mira-Titan Universe simulation suite designed to construct emulators for a range of cosmological probes. The suite covers the standard six cosmological parameters $\{\omega_m,\omega_b, \sigma_8, h, n_s, w_0\}$ and, in addition, includes massive neutrinos and a dynamical dark energy equation of state, $\{\omega_{\nu}, w_a\}$. In this paper we present the final emulator for the matter power spectrum based on 111 cosmological simulations, each covering a (2.1Gpc)$^3$ volume and evolving 3200$^3$ particles. An additional set of 1776 lower-resolution simulations and TimeRG perturbation theory results for the power spectrum are used to cover scales straddling the linear to mildly nonlinear regimes. The emulator provides predictions at the two to three percent level of accuracy over a wide range of cosmological parameters and is publicly released as part of this paper. - 3 July 2021
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 116 (535) , 1201-1203
Comment on “A Gibbs Sampler for a Class of Random Convex Polytopes”
We thank the authors for this work and the editors for the chance to participate in a discussion about it. Dempster-Shafer theory is an intriguing but difficult topic. Our interest has been driven ...
- 3 July 2021
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 116 (535) , 1201-1203
Comment on “A Gibbs Sampler for a Class of Random Convex Polytopes”
We thank the authors for this work and the editors for the chance to participate in a discussion about it. Dempster-Shafer theory is an intriguing but difficult topic. Our interest has been driven ...