Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed training”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Atomic cluster expansion potential for large scale simulations of hydrocarbons under shock compression

We present an Atomic Cluster Expansion (ACE) machine learned potential developed for high-fidelity atomistic simulations of hydrocarbons, targeting pressures and temperatures near and above supercritical fluid regimes for molecular fluids. A diverse set of stoichiometries were covered in training, including 1:0 (pure carbon), 1:4 (methane), and 1:1 (benzene), and rich bonding environments sampled at supercritical temperatures, hydrogen rich, reactive mixtures where metastable stoichiometries arise, including 1:2 (ethylene) and 1:3 (ethane). A high-fidelity training database was constructed by performing large-scale quantum molecular dynamic simulations [density functional theory (DFT) MD] of diamond, graphite, methane, and benzene. A novel approach to selecting structures from DFT MD is also presented, which allows for the rapid selection of unique DFT MD frames from complex trajectories. Comparisons to DFT and experimental data demonstrate that the presented ACE potential accurately reproduces isotherms, carbon melting curves, radial distribution functions, and shock Hugoniots for carbon and hydrocarbon systems for pressures up to 100 GPa and temperatures up to 6000 K for hydrocarbon systems and up to 9000 K for pure carbon systems. This work delivers a potential that can be used for accurate, large-scale simulations of shocked hydrocarbons and demonstrates a methodology for fitting and validating machine learning interatomic potentials to complex molecular environments, which can be applied to energetic materials in future works.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

A generative modeling approach to reconstructing 21 cm tomographic data

Abstract Analyses of the cosmic 21 cm signal are hampered by astrophysical foregrounds that are far stronger than the signal itself. These foregrounds, typically confined to a wedge-shaped region in Fourier space, often necessitate the removal of a vast majority of modes, thereby degrading the quality of the data anisotropically. To address this challenge, we introduce a novel deep generative model based on stochastic interpolants to reconstruct the 21 cm data lost to wedge filtering. Our method leverages the non-Gaussian nature of the 21 cm signal to effectively map wedge-filtered 3D lightcones to samples from the conditional distribution of wedge-recovered lightcones. We demonstrate how our method is able to restore spatial information effectively, considering both varying cosmological initial conditions and astrophysics. Furthermore, we discuss a number of future avenues where this approach could be applied in analyses of the 21 cm signal, potentially offering new opportunities to improve our understanding of the Universe during the epochs of cosmic dawn and reionization. Code, pre-trained models, and scripts for making plots in this paper can be found here .

Sabti, Nashwan (ORCID:000000027924546X)↗
DOE OSTI2021

The PAU Survey: narrow-band photometric redshifts using Gaussian processes

Here, we study the performance of the hybrid template machine learning photometric redshift (photo- z ) algorithm delight , which uses Gaussian processes, on a subset of the early data release of the Physics of the Accelerating Universe Survey (PAUS). We calibrate the fluxes of the 40 PAUS narrow bands with six broad-band fluxes ( uBVriz ) in the Cosmic Evolution Survey (COSMOS) field using three different methods, including a new method that utilizes the correlation between the apparent size and overall flux of the galaxy. We use a rich set of empirically derived galaxy spectral templates as guides to train the Gaussian process, and we show that our results are competitive with other standard photometric redshift algorithms. delight achieves a photo- z 68th percentile error of σ 68 = 0.0081(1 + z ) without any quality cut for galaxies with i auto < 22.5 as compared to 0.0089(1 + z ) and 0.0202(1 + z ) for the bpz and annz 2 codes, respectively. delight is also shown to produce more accurate probability distribution functions for individual redshift estimates than bpz and annz 2. Common photo- z outliers of delight and bcnz 2 (previously applied to PAUS) are found to be primarily caused by outliers in the narrow-band fluxes, with a small number of cases potentially indicating spectroscopic redshift failures in the reference sample. In the process, we introduce performance metrics derived from the results of bcnz 2 and delight , allowing us to achieve a photo- z quality of σ 68 < 0.0035(1 + z ) at a magnitude of i auto < 22.5 while keeping 50 per cent objects of the galaxy sample.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Time-Based CAN IDS Paper Results Code

Modern vehicles are complex cyber-physical systems made of hundreds of electronic control units (ECUs) that communicate over controller area networks (CANs). This inherited complexity has expanded the CAN attack surface which is vulnerable to message injection attacks. These injections change the overall timing characteristics of messages on the bus, and thus, to detect these malicious messages, time-based intrusion detection systems (IDSs) have been proposed. However, time-based IDSs are usually trained and tested on low-fidelity datasets with unrealistic, labeled attacks. This makes difficult the task of evaluating, comparing, and validating IDSs. Here we detail and benchmark four time-based IDSs against the newly published ROAD dataset, the first open CAN IDS dataset with real (non-simulated) stealthy attacks with physically verified effects. We found that methods that perform hypothesis testing by explicitly estimating message timing distributions have lower performance than methods that seek anomalies in a distribution related statistic. In particular, these “distribution-agnostic” based methods outperform “distribution-based” methods by at least 55% in area under the precision-recall curve (AUC-PR). Our results expand the body of knowledge of CAN time-based IDSs by providing details of these methods and reporting their results when tested on datasets with real advanced attacks. Finally, we develop an after-market plug-in detector using lightweight hardware, which can be used to deploy the best performing IDS method on nearly any vehicle.

Moriano, Pablo [Oak Ridge National Lab. (ORNL), Oa↗
DOE OSTI2024

Models, data, and scripts associated with “Prediction of Distributed River Sediment Respiration Rates using Community-Generated Data and Machine Learning”

This data package is associated with the publication “Prediction of Distributed River Sediment Respiration Rates using Community-Generated Data and Machine Learning’’ submitted to the Journal of Geophysical Research: Machine Learning and Computation (Scheibe et al. 2024). River sediment respiration observations are expensive and labor intensive to obtain and there is no physical model for predicting this quantity. The Worldwide Hydrobiogeochemisty Observation Network for Dynamic River Systems (WHONDRS) observational data set (Goldman et al.; 2020) is used to train machine learning (ML) models to predict respiration rates at unsampled sites. This repository archives training data, ML models, predictions, and model evaluation results for the purposes of reproducibility of the results in the associated manuscript and community reuse of the ML models trained in this project. One of the key challenges in this work was to find an optimum configuration for machine learning models to work with this feature-rich (i.e. 100+ possible input variables) data set. Here, we used a two-tiered approach to managing the analysis of this complex data set: 1) a stacked ensemble of ML models that can automatically optimize hyperparameters to accelerate the process of model selection and tuning and 2) feature permutation importance to iteratively select the most important features (i.e. inputs) to the ML models. The major elements of this ML workflow are modular, portable, open, and cloud-based, thus making this implementation a potential template for other applications. This data package is associated with the GitHub repository found at Please see the file level metadata (flmd; “sl-archive-whondrs_flmd.csv”) for a list of all files contained in this data package and descriptions for each. Please see the data dictionary (dd; “sl-archive-whondrs_dd.csv”) for a list of all column headers contained within comma separated value (csv) files in this data package and descriptions for each. The GitHub repository is organized into five top-level directories: (1) “input_data” holds the training data for the ML models; (2) “ml_models” holds machine learning models trained on the data in “input_data”; (3) “scripts” contains data preprocessing and postprocessing scripts and intermediate results specific to this data set that bookend the ML workflow; (4) “examples” contains the visualization of the results in this repository including plotting scripts for the manuscript (e.g., model evaluation, FPI results) and scripts for running predictions with the ML models (i.e., reusing the trained ML models); (5) “output_data” holds the overall results of the ML model on that branch. Each trained ML model resides on its own branch in the repository; this means that inputs and outputs can be different branch-to-branch. Furthermore, depending on the number of features used to train the ML models, the preprocessing and postprocessing scripts, and their intermediate results, can also be different branch-to-branch. The “main-*” branches are meant to be starting points (i.e. trunks) for each model branch (i.e. sprouts). Please see the Branch Navigation section in the top-level README.md in the GitHub repository for more details. There is also one hidden directory “.github/workflows”. This hidden directory contains information for how to run the ML workflow as an end-to-end automated GitHub Action but it is not needed for reusing the ML models archived here. Please the top-level README.md in the GitHub repository for more details on the automation.

13C↗
DOE OSTI2023

AI-Based Faster-Than-Real-Time Stability Assessment of Large Power Systems with Applications on WECC System

Achieving clean energy goals will require significant advances in regard to addressing the computational needs for next-generation renewable-dominated power grids. One critical obstacle that lies in the way of transitioning today’s power grid to a renewable-dominated power grid is the lack of a faster-than-real-time stability assessment technology for operating a fast-changing power grid. This paper proposes an artificial intelligence (AI) -based method that predicts the system’s stability margin information (e.g., the frequency nadir in the frequency stability assessment and the critical clearing time (CCT) value in the transient stability assessment) directly from the system operating conditions without performing the conventional time-consuming time-domain simulations over detailed dynamic models. Since the AI method shifts the majority of the computational burden to offline training, the online evaluation is extremely fast. This paper has tested the AI-based stability assessment method using multiple dispatch cases that are converted and tuned from actual dispatch cases of the Western Electricity Coordinating Council (WECC) system model with more than 20,000 buses. The results show that the AI-based method could accurately predict the stability margin of such a large power system in less than 0.2 milliseconds using the offline-trained AI agent. Therefore, the proposed method has great potential to achieve faster-than-real-time stability assessment for practical large power systems while preserving sufficient accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1989

Sources of error in thematic classification of remotely sensed imagery

From a statistician's point of view, the input datasets are rarely examined to determine their underlying frequency distribution; it is just assumed that the data are normal enough, and that the deviations from normality are unimportant. It is not clear how deviations from a hypothetical multivariate normal might affect the power of the classification process, and there is ample evidence in the literature that, at a minimum, the spectral channels are correlated. From a practioner's point of view, in a supervised classification the number of training fields for developing a statistical description of a given class is usually arbitrary. It is unclear how small changes in the details of the training field selection process affect the quality of the derived thematic information. The start of an examination of this latter problem is discussed.

Star, Jeffrey L.↗
NASA NTRS2010

Operational Dynamic Configuration Analysis

Sectors may combine or split within areas of specialization in response to changing traffic patterns. This method of managing capacity and controller workload could be made more flexible by dynamically modifying sector boundaries. Much work has been done on methods for dynamically creating new sector boundaries [1-5]. Many assessments of dynamic configuration methods assume the current day baseline configuration remains fixed [6-7]. A challenging question is how to select a dynamic configuration baseline to assess potential benefits of proposed dynamic configuration concepts. Bloem used operational sector reconfigurations as a baseline [8]. The main difficulty is that operational reconfiguration data is noisy. Reconfigurations often occur frequently to accommodate staff training or breaks, or to complete a more complicated reconfiguration through a rapid sequence of simpler reconfigurations. Gupta quantified a few aspects of airspace boundary changes from this data [9]. Most of these metrics are unique to sector combining operations and not applicable to more flexible dynamic configuration concepts. To better understand what sort of reconfigurations are acceptable or beneficial, more configuration change metrics should be developed and their distribution in current practice should be computed. This paper proposes a method to select a simple sequence of configurations among operational configurations to serve as a dynamic configuration baseline for future dynamic configuration concept assessments. New configuration change metrics are applied to the operational data to establish current day thresholds for these metrics. These thresholds are then corroborated, refined, or dismissed based on airspace practitioner feedback. The dynamic configuration baseline selection method uses a k-means clustering algorithm to select the sequence of configurations and trigger times from a given day of operational sector combination data. The clustering algorithm selects a simplified schedule containing k configurations based on stability score of the sector combinations among the raw operational configurations. In addition, the number of the selected configurations is determined based on balance between accuracy and assessment complexity.

Lai, Chok Fung↗
NASA NTRS2011

Using Ensemble Decisions and Active Selection to Improve Low-Cost Labeling for Multi-View Data

This paper seeks to improve low-cost labeling in terms of training set reliability (the fraction of correctly labeled training items) and test set performance for multi-view learning methods. Co-training is a popular multiview learning method that combines high-confidence example selection with low-cost (self) labeling. However, co-training with certain base learning algorithms significantly reduces training set reliability, causing an associated drop in prediction accuracy. We propose the use of ensemble labeling to improve reliability in such cases. We also discuss and show promising results on combining low-cost ensemble labeling with active (low-confidence) example selection. We unify these example selection and labeling strategies under collaborative learning, a family of techniques for multi-view learning that we are developing for distributed, sensor-network environments.

machine learning↗
NASA NTRS2020

Great Lakes Water Resources II: A Google Earth Engine Tool to Automate Wetland Mapping Using Optical and Radar Satellite Sensors in the Great Lakes Basin for Wetland Management and Monitoring

The Great Lakes Basin is one of the world’s largest freshwater ecosystems. The Basin harbors over 200,000 acres of wetlands. These wetlands provide a variety of environmental, ecological, and recreational functions to over 30 million people in the region. Some of these functions include improving water quality, mitigating flood impacts, providing wildlife habitat, and housing recreational activities. However, due to anthropogenic activities, habitat conversion and degradation threaten to disrupt or destroy remaining wetland ecosystems. Maps of wetland distribution based on ground surveys are costly and labor-intensive, prohibiting timely evaluations of wetland loss and gain. The Great Lakes Water Resources II team at the NASA Jet Propulsion Laboratory developed the Wetlands Extent Tool 2.0 (WET 2.0) in Google Earth Engine to automate mapping of wetland distribution in the Great Lakes Basin. The team partnered with the US Fish and Wildlife Service (USFWS), Environmental Protection Agency (EPA), Minnesota Department of Natural Resources (MDNR), the National Oceanic and Atmospheric Administration (NOAA), and Ducks Unlimited (DU). WET 2.0 incorporates Landsat 8 Operational Land Imager (OLI), Sentinel-1 C-band Synthetic Aperture Radar (C-SAR), and Sentinel-2 Multispectral Instrument (MSI) satellite data. WET 2.0 is trained to classify anywhere in the Great Lakes Basin. Utilizing a Random Forest classifier, WET 2.0 is capable of automatically mapping wetland extent in the entire Great Lakes Basin, achieving a mean overall accuracy of 80.12% when tested in Michigan. Findings and maps produced in WET 2.0 will enable our partners to identify areas of ecosystem degradation and wetland destruction in order to enact environmental practices and policy initiatives to maintain environmental and economic health in the area.

Water Resources↗
NASA NTRSDate not supplied

Image-to-Image Wildfire Detection via Quantum-Compatible Variational Segmentation from Remotely-sensed Data

Over the last decade, the incidence of wildfires has surged, causing widespread destruction globally. To better comprehend and manage these incidents, remote sensing and aerial missions have been implemented in recent efforts. However, this has resulted in an exponential rise in the amount of remote sensing data utilization, leading to a need for intelligent automation of data extraction in wildfire studies. Machine learning provides an accurate automated approach for detecting these natural anomalies and facilitates decision-makers to take prompt actions. To make insightful decisions in wildfire management, it is imperative to move beyond simple detection and explore the potential of probabilistic generative machine learning for creating "what-if" scenarios for various wildfire conditions. Such models offer improved representation of the stochastic nature of wildfire events. However, the optimization of these models can be computationally expensive, especially when using classical computers. Quantum computers have recently emerged as a promising solution to reduce the computational cost of training such models and improve their performance. In this study, we aim to utilize quantum-compatible machine learning techniques to implement our probabilistic generative approach. To that end, we propose a supervised probabilistic variational model consisting of a U-NET-based image-to-image component along with encoder and decoder networks which work as a variational autoencoder (VAE) component. Additionally, we explore the type of latent distribution type in the VAE component and implement different means for modeling the prior distribution. We further investigate the quantum-compatible versions of the model compared to the classical counterpart and benchmark potential benefits of quantum compatibility over the classical model.

quantum machine learning↗
DOE OSTI2021

Computational Framework for Machine-Learning-Enabled 13 C Fluxomics

13 C metabolic flux analysis (MFA) has emerged as a powerful tool for synthetic biology. This optimization-based approach suffers long computation time and unstable solutions depending on the initial guess. Here, we develop a machine-learning-based framework for 13 C fluxomics. Specifically, training and test data sets are generated by metabolic network decomposition and flux sampling, in which flux ratios at metabolic nodes and simulated labeling patterns of metabolites are used as training targets and features, respectively. To improve prediction accuracy and simplify the model, automated processes are developed for flux ratio selection based on solvability and feature screening based on importance. We found that predictive performance can be significantly improved using both amino acids and central carbon metabolites in comparison with amino acids alone. Together with measured external fluxes, the predicted flux ratios determine the mass balance system, yielding global flux distributions. This approach is validated by flux estimation using both simulated and experimental data in comparison with canonical 13 C MFA. The approach represents a reliable fluxomics method readily applicable to high-throughput metabolic phenotyping, which highlights the advances of intelligent learning algorithms in synthetic biology, specifically in the Test and Learn stage of the Design-Build-Test-Learn cycle.

13C metabolic flux analysis↗
DOE OSTI2022

Use of vision and sound to classify feller-buncher operational state

Productivity measures in logging involve simultaneous recognition and classification of event occurrence and timing, and the volume of stems being handled. In full-tree felling systems these measurements are difficult to implement in an autonomous manner because of the unfavorable working environment and the abundance of confounding extraneous events. This paper proposed a vision method that used a lowcost camera to recognize feller-buncher operational events including tree cutting and piling. It used a fine K-nearest neighbors (fKNN) algorithm as the final classifier based on both audio and video features derived from short video segments as inputs. The classifier’s calibration accuracy exceeds 94%. The trained model was tested on videos recorded under various conditions. The overall accurate rates for short segments were greater than 89%. Comparisons were made between the human- and algorithm derived event detection rates, events’ durations, and inter-event timing using continuously recorded videos taken during feller operation. Video results between the fKNN model and manual observation were similar. Statistical comparison using the Kolmogorov–Smirnov test to evaluate measured parameters’ distributions (manual versus automated event duration and inter-event timing) did not show significant differences with the lowest P-value among all Kolmogorov–Smirnov tests equal to 0.12. Here the result indicated the feasibility and potential of using the method for the automatic time study of drive-to-tree feller bunchers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improved detection of low-frequency within-host variants from deep sequencing: A case study with human papillomavirus

Abstract High-coverage sequencing allows the study of variants occurring at low frequencies within samples, but is susceptible to false-positives caused by sequencing error. Ion Torrent has a very low single nucleotide variant (SNV) error rate and has been employed for the majority of human papillomavirus (HPV) whole genome sequences. However, benchmarking of intrahost SNVs (iSNVs) has been challenging, partly due to limitations imposed by the HPV life cycle. We address this problem by deep sequencing three replicates for each of 31 samples of HPV type 18 (HPV18). Errors, defined as iSNVs observed in only one of three replicates, are dominated by C→T (G→A) changes, independently of trinucleotide context. True iSNVs, defined as those observed in all three replicates, instead show a more diverse SNV type distribution, with particularly elevated C→T rates in CCG context (CCG→CTG; CGG→CAG) and C→A rates in ACG context (ACG→AAG; CGT→CTT). Characterization of true iSNVs allowed us to develop two methods for detecting true variants: (1) VCFgenie, a dynamic binomial filtering tool which uses each variant’s allele count and coverage instead of fixed frequency cut-offs; and (2) a machine learning binary classifier which trains eXtreme Gradient Boosting models on variant features such as quality and trinucleotide context. Each approach outperforms fixed-cut-off filtering of iSNVs, and performance is enhanced when both are used together. Our results provide improved methods for identifying true iSNVs in within-host applications across sequencing platforms, specifically using HPV18 as a case study.

Virology↗
DOE OSTI2022

GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design

Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art graph learning model. However, it remains notoriously challenging to inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because real-world graphs can be extremely large and sparse. Furthermore, the node degree of GCNs tends to follow the power-law distribution and therefore have highly irregular adjacency matrices, resulting in prohibitive inefficiencies in both data processing and movement and thus substantially limiting the achievable GCN acceleration efficiency. To this end, this paper proposes the first GCN algorithm and accelerator Co-Design framework dubbed GCoD which can largely alleviate the aforementioned GCN irregularity and boost GCNs' inference efficiency. Specifically, on the algorithm level, GCoD integrates a divide and conquer GCN training strategy that polarizes the graphs to be either denser or sparser in local neighborhoods without compromising the model accuracy, resulting in graph adjacency matrices that (mostly) have merely two levels of workload and enjoys largely enhanced regularity and thus ease of acceleration. On the hardware level, we further develop a dedicated two-pronged accelerator with a separated engine to process each of the aforementioned workloads, further boosting the overall utilization and acceleration efficiency. Extensive experiments and ablation studies validate that our GCoD consistently outperforms state-of-the-art designs in terms of accelerator efficiency while maintaining or even improving the task accuracy. Additionally, we visualize GCoD trained graph adjacency matrices to better understand its advantages. All codes and pre-trained models will be released upon acceptance.

You, Haoran↗
DOE OSTI2021

Transition to Online Cable Insulation Condition Monitoring

Nuclear power plant cables were originally qualified for 40 year life and generally have not required specific test verification to assure service availability through the initial plant qualification period. However, license renewals to 60 and 80 years of operation require a cable aging management program that depends on some form of test and verification to assure fitness for service. Environmental stress (temperature, radiation, chemicals, water, and mechanical) varies dramatically within a nuclear power plant and, in some cases, cables have degraded and required repair or replacement before their qualified end-of-life period. In other cases, cable conditions have been mild and dependable cable performance confirmed to extend well beyond the initial qualified life. Most offline performance-based testing requires cables to be de-coupled and de-energized for specially trained technicians to perform testing. These offline tests constitute an expensive operational burden that limits the economic viability of nuclear power plants. Although initial investment may be higher, new online test practices are emerging as options or complements to offline testing that avoid or minimize the regularly scheduled offline test burden. These online methods include electrical and fiber-optic partial discharge measurement, spread spectrum time or frequency domain reflectometry, distributed temperature profile measurements, and local interdigital capacitance measurement of insulation characteristics. Introduction of these methods must be supported by research to confirm efficacy plus either publicly financed or market driven investment to support the start-up expense of cost-effective instrumentation to monitor cable condition and assure reliable operation. This work summarizes various online cable assessment technologies plus introduces a new cable motor test bed to assess some of these technologies in a controlled test environment.

Glass, Samuel W.↗
DOE OSTI2026

Continual Learning for Particle Accelerators

Particle accelerators operate under dynamically changing conditions, which often lead to data distribution drifts. These drifts pose significant challenges for Machine Learning (ML) models, which typically fail to maintain performance when faced with such non-stationary data. In particle accelerators, the primary sources of these data drifts include changes in accelerator settings and non-measured parameters such as machine degradation and environmental factors. Previous research has proposed conditional models to handle multiple beam configurations effectively; however, it is challenging to train the ML models on all possible configuration settings. Additionally, conditional models alone can not address performance degradation caused by drifts due to non-measured factors. These limitations contribute to a significant gap between ML development and its deployment in real-world operational settings. To bridge this gap, in this paper, we identify some of the key areas within particle accelerators where continual learning can help mitigate drift-induced performance degradation. In addition, we present a practical use case where a conditional Auto-Encoder model coupled with memory-based continual learning has been employed to demonstrate stable performance even when underlying data drifts.

Schram, Malachi [Thomas Jefferson National Acceler↗
DOE OSTI2026

A Nonparametric Method for the Inference of Halo Occupation Distributions

The galaxy–halo connection traces processes by which galaxies form and evolve. The halo occupation distribution (HOD) describes the relationship between galaxies and their host dark matter haloes. Measurements of the galaxy two-point correlation function (2PCF) allow us to extract information about the HODs of observed galaxy samples. Several parametric HOD models have been proposed in the literature, but the choice of parameterization restricts the space of possible HODs. To resolve this issue, we introduce a nonparametric HOD fitting method in which we train an emulator to learn the mappings among the galaxy 2PCF, physical properties used to select galaxy samples, and the HOD, all obtained from simulated past light cones constructed with the Santa Cruz semianalytic model. Implementing this emulator within a likelihood analysis framework, we derive constraints on the HOD of a galaxy sample when provided with a measurement of its 2PCF. Using the emulator to accelerate likelihood evaluations, we test the nonparametric HOD approach on a set of 2PCFs for mock galaxy samples drawn from the TNG100-1 simulation and selected above threshold values of stellar mass and star formation rate. Our framework is able to recover TNG100-1 HODs within 0.2 dex. We use the TNG100-1 mocks to tune the reported uncertainties to estimate those expected in the analysis of observations. Comparing to parametric HOD modelling routines applied to the same mock galaxy samples, our approach consistently infers the HOD with comparable or greater precision and accuracy.

Kennedy, Jacob [Rutgers Univ., Piscataway, NJ (Uni↗