Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jayson Luc Peterson

dblp:194/6246 · also J. Luc Peterson · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-5167-5708ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › explainable AI
model interpretation
0.412020
Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications · IEEE Trans. Vis. Comput. Graph. 2020
Visualization and visual analytics › information visualization › large-scale data visualization
scalable visualization
0.412020
Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications · IEEE Trans. Vis. Comput. Graph. 2020
Visualization and visual analytics
topological data analysis
0.412020
Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications · IEEE Trans. Vis. Comput. Graph. 2020
Computational science and engineering
scientific data analysis
0.112020
Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications · IEEE Trans. Vis. Comput. Graph. 2020

Methods — techniques the papers use, named apart from their topics

topology-aware datacubes · 0.9streaming neighborhood graph · 0.9
YearPublicationVenuePosition
2026 A terminology for scientific workflow systems
Frédéric Suter, Tainã Coleman, Ilkay Altintas, Rosa M. Badia, Bartosz Balis, Kyle Chard, Iacopo Colonnelli, Ewa Deelman, Paolo Di Tommaso, Thomas Fahringer, Carole A. Goble, Shantenu Jha, Daniel S. Katz, Johannes Köster, Ulf Leser, Kshitij Mehta, Hilary Oliver, Jayson Luc Peterson, Giovanni Pizzi, Loïc Pottier, Raül Sirvent, Eric Suchyta, Douglas Thain, Sean R. Wilkinson, Justin M. Wozniak, Rafael Ferreira da Silva
Future Gener. Comput. Syst.18
2022 Enabling machine learning-ready HPC ensembles with Merlin
Jayson Luc Peterson, Benjamin Bay, Joe Koning, Peter B. Robinson, Jessica Semler, Jeremy White, Rushil Anirudh, Kevin Athey, Peer-Timo Bremer, Francesco Di Natale, Jim Gaffney, Sam Ade Jacobs, Bhavya Kailkhura, Bogdan Kustowski, Steve H. Langer, Brian K. Spears, Jayaraman J. Thiagarajan, Brian Van Essen, Jae-Seung Yeom
Future Gener. Comput. Syst.1
2020 Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications
abstract
With the rapid adoption of machine learning techniques for large-scale applications in science and engineering comes the convergence of two grand challenges in visualization. First, the utilization of black box models (e.g., deep neural networks) calls for advanced techniques in exploring and interpreting model behaviors. Second, the rapid growth in computing has produced enormous datasets that require techniques that can handle millions or more samples. Although some solutions to these interpretability challenges have been proposed, they typically do not scale beyond thousands of samples, nor do they provide the high-level intuition scientists are looking for. Here, we present the first scalable solution to explore and analyze high-dimensional functions often encountered in the scientific data analysis pipeline. By combining a new streaming neighborhood graph construction, the corresponding topology computation, and a novel data aggregation scheme, namely topology aware datacubes, we enable interactive exploration of both the topological and the geometric aspect of high-dimensional data. Following two use cases from high-energy-density (HED) physics and computational biology, we demonstrate how these capabilities have led to crucial new insights in both applications.
Shusen Liu 0001, Jim Gaffney, Jayson Luc Peterson, Peter B. Robinson, Harsh Bhatia, Valerio Pascucci, Brian K. Spears, Peer-Timo Bremer, Dan Maljovec, Rushil Anirudh, Jayaraman J. Thiagarajan, Sam Ade Jacobs, Brian Van Essen, David Hysom, Jae-Seung Yeom
IEEE Trans. Vis. Comput. Graph.3
2019 Parallelizing Training of Deep Generative Models on Massive Scientific Datasets
abstract
Training deep neural networks on large scientific data is a challenging task that requires enormous compute power, especially if no pre-trained models exist to initialize the process. We present a novel tournament method to train traditional as well as generative adversarial networks built on LBANN, a scalable deep learning framework optimized for HPC systems. LBANN combines multiple levels of parallelism and exploits some of the worlds largest supercomputers.We demonstrate our framework by creating a complex predictive model based on multi-variate data from high-energy-density physics containing hundreds of millions of images and hundreds of millions of scalar values derived from tens of millions of simulations of inertial confinement fusion. Our approach combines an HPC workflow and extends LBANN with optimized data ingestion and the new tournament-style training algorithm to produce a scalable neural network architecture using a CORAL-class supercomputer. Experimental results show that 64 trainers (1024 GPUs) achieve a speedup of 70.2× over a single trainer (16 GPUs) baseline, and an effective 109% parallel efficiency.
Sam Ade Jacobs, Jim Gaffney, Tom Benson, Peter B. Robinson, Jayson Luc Peterson, Brian K. Spears, Brian Van Essen, David Hysom, Jae-Seung Yeom, Tim Moon, Rushil Anirudh, Jayaraman J. Thiagarajan, Shusen Liu 0001, Peer-Timo Bremer
CLUSTER5
2019 Deep Neural Network Initialization With Decision Trees
abstract
In this paper, a novel, automated process for constructing and initializing deep feedforward neural networks based on decision trees is presented. The proposed algorithm maps a collection of decision trees trained on the data into a collection of initialized neural networks with the structures of the networks determined by the structures of the trees. The tree-informed initialization acts as a warm-start to the neural network training process, resulting in efficiently trained, accurate networks. These models, referred to as "deep jointly informed neural networks" (DJINN), demonstrate high predictive performance for a variety of regression and classification data sets and display comparable performance to Bayesian hyperparameter optimization at a lower computational cost. By combining the user-friendly features of decision tree models with the flexibility and scalability of deep neural networks, DJINN is an attractive algorithm for training predictive models on a wide range of complex data sets.
Kelli D. Humbird, Jayson Luc Peterson, Ryan G. McClarren
IEEE Trans. Neural Networks Learn. Syst.2