Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian methods”

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 469 records · Page 26

DeepONet-grid-UQ: A trustworthy deep operator framework for predicting the power grid’s post-fault trajectories

This paper proposes a novel data-driven method for the reliable prediction of the power grid’s post-fault trajectories, i.e., the power grid’s dynamic response after a disturbance or fault. Here, the proposed method is based on the recently proposed concept of Deep Operator Networks (DeepONets). Unlike traditional neural networks that learn to approximate functions, DeepONets are designed to approximate nonlinear operators, i.e., mappings between infinite-dimensional spaces. Under this operator framework, we design a novel and efficient DeepONet that (i) takes as inputs the trajectories collected before and during the fault and (ii) outputs the predicted post-fault trajectories. In addition, we endow our method with the much-needed ability to balance efficiency with reliable/trustworthy predictions via uncertainty quantification. To this end, we propose and compare two novel methods that enable quantifying the predictive uncertainty. First, we propose a Bayesian DeepONet (B-DeepONet) that uses stochastic gradient Hamiltonian Monte-Carlo to sample from the posterior distribution of the DeepONet trainable parameters. Then, we design a Probabilistic DeepONet (Prob-DeepONet) that uses a probabilistic training strategy to enable quantifying uncertainty at virtually no extra computational cost. Finally, we validate the proposed methods’ predictive power and uncertainty quantification capability using the New York-New England power grid model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hypothesis-Agnostic Network-Based Analysis of Real-World Data Suggests Ondansetron is Associated with Lower COVID-19 Any Cause Mortality

Background: The COVID-19 pandemic generated a massive amount of clinical data, which potentially hold yet undiscovered answers related to COVID-19 morbidity, mortality, long-term effects, and therapeutic solutions.Objectives: The objectives of this study were (1) to identify novel predictors of COVID-19 any cause mortality by employing artificial intelligence analytics on real-world data through a hypothesis-agnostic approach and (2) to determine if these effects are maintained after adjusting for potential confounders and to what degree they are moderated by other variables.Methods: A Bayesian statistics-based artificial intelligence data analytics tool (bAIcis®) within the Interrogative Biology® platform was used for Bayesian network learning and hypothesis generation to analyze 16,277 PCR+ patients from a database of 279,281 inpatients and outpatients tested for SARS-CoV-2 infection by antigen, antibody, or PCR methods during the first pandemic year in Central Florida. This approach generated Bayesian networks that enabled unbiased identification of significant predictors of any cause mortality for specific COVID-19 patient populations. These findings were further analyzed by logistic regression, regression by least absolute shrinkage and selection operator, and bootstrapping.Results: We found that in the COVID-19 PCR+ patient cohort, early use of the antiemetic agent ondansetron was associated with decreased any cause mortality 30 days post-PCR+ testing in mechanically ventilated patients.Conclusions: The results demonstrate how a real-world COVID-19-focused data analysis using artificial intelligence can generate unexpected yet valid insights that could possibly support clinical decision making and minimize the future loss of lives and resources.

60 APPLIED LIFE SCIENCES↗

GIS-Based Modeling of Contaminated Soil Volumes at Multiple Sites in the Formerly Utilized Sites Remedial Action Program - 20149

The remediation of hazardous, toxic, and radioactive waste (HTRW) sites produces cost-related risks associated with the estimation of contaminated soil or debris volumes. Historical risk-management techniques include cost contingencies to cover volume uncertainties that affect project budgeting and decision-making. The Buffalo District teamed with project partners to lessen volume uncertainty and reduce project risks at multiple HTRW sites managed under the Formerly Utilized Sites Remedial Action Program (FUSRAP). Historical remedial investigations under FUSRAP commonly identified the presence of radiological material in site media, the associated human health risk, and then areas of remediation. To manage remedial execution and reduce risk, pre-design or remediation-phase sampling essentially 'chased' contamination, which was not conducive to efficient predictive budgeting derived from Feasibility Study (FS) cost analyses. The Buffalo District first optimized their approach to better understand volume uncertainty by utilizing the Argonne National Laboratory's Bayesian Approaches for Adaptive Spatial Sampling (BAASS) software [1]. BAASS processed soft data (e.g., gamma walk-over data) and spatial sampling data to estimate the lateral extent of contaminated soil irrespective of depth (i.e., gross contamination extent) and define areas of contaminant uncertainty. The software performed a binary transformation of contaminant concentrations at all sampling points based upon remedial action goals or a sum of ratios approach (i.e., clean, impacted, or range of impacts in soil). The model produced two-dimensional (horizontal) contaminant probability contours and statistical uncertainty in the sampling coverage and resulting contaminant extents. This method was translated vertically by partitioning the sampling data into depth brackets that produced a stacked representation of contaminant extents and uncertainty in the subsurface (i.e., similar to construction lifts). The results commonly led to a better understanding of project uncertainty and the need for sampling strategies that produce high-confidence soil volumes, which control costs. The BAASS-based delineations were eventually replaced by Empirical Bayesian Kriging (EBK) methods available in ArcGIS Spatial or 3D Analysts [2]. The EBK method calculates contaminant probability zones derived from user-controlled semivariograms of the spatial datasets. The resulting probability zones (e.g., 50% or 80% of contaminant probability) represent the two-dimensional surface delineation of the overall horizontal remedial area, similarly to BAASS. However, unlike BAASS, the vertical sampling data within these probability zones became vertical control points to contour a subterranean surface that connects subsurface points to the land-surface delineations of contamination. The resulting representation of horizontal and vertical impacts within an enclosed envelop (volume) of soil included uncertainty distributions that are used to plan uncertainty-reduction sampling. These data-driven and math-based models of three-dimensional sampling results produced well-bounded remedial volumes for project planning and better uncertainty predictions during project budgeting. The EBK method was applied to several FUSRAP sites managed by the Buffalo District and compared to less rigorously modeled sites previously remediated by the District. The comparison of modeled to actual remediated volumes provide a basis for validating the volume-estimation method. This comparison is important to ensure modeled volumes match physical boundaries of site remediation. FUSRAP sites with denser investigative sampling and lesser volume uncertainty proved useful in remedial planning and contracting. The Buffalo District noted that historical sites with sparser sampling arrays had greater disparity between estimated volumes and final remedial volumes. The benefit achieved over the cost of detailed soil sampling appears positive for FUSRAP projects, especially where impacts vary widely and appear unbounded by investigation-phase sampling. The subsequent Empirical Bayesian Kriging of contamination coupled with vertical contouring for soil estimations reduces uncertainty in soil volumes or indicates where sampling is required to reduce uncertainty, which together optimize remedial planning and budgeting. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Future projections and uncertainty assessment of precipitation extremes in the Korean peninsula from the CMIP5 ensemble

Abstract Projections of changes in extreme climate are sometimes predicted by multimodel ensemble methods that combine forecasts from individual simulation models using weighted averaging. One method to assign weight to each model is the Bayesian model averaging (BMA) in which posterior probability is used. For the cases of extreme climate, the generalized extreme value distribution (GEVD) is typically used. We applied the approach of GEV‐embedded BMA to a series of 35 years of the annual maximum daily precipitation data (both historical data and data gathered from simulation experiments for future periods) over the Korean peninsula as simulated by the models in the Coupled Model Intercomparison Project Phase 5 (CMIP5). Simulation data under two Representative Concentration Pathway (RCP) scenarios, namely RCP4.5 and RCP8.5, were used. Observed data and 17 CMIP5 models for 12 gird cells in Korea have been examined to predict future changes in precipitation extremes. A simple regional frequency analysis of pooling observations from three stations in each cell was employed to reduce the estimation variance and local fluctuations. A bias correction technique using the regression‐type transfer function was applied to these simulation data. Return levels spanning over 20 and 50 years, as well as the return periods relative to the reference years (1971–2005), were estimated for two future periods, namely Period 1 (2021–2050) and Period 2 (2066–2095). From these analyses, relative increase observed in the spatially averaged 20‐year (50‐year) return level was approximately 23% (16%) and 45% (36%) in the RCP4.5 and RCP8.5 experiments, respectively, by the end of the 21st century. We concluded that extreme rainfalls will likely occur two times and four times more frequently in the RCP4.5 and RCP8.5 scenarios, respectively, as compared to in the reference years by the end of the 21st century.

Lee, Youngsaeng↗

Ecological connectivity and habitat loss shape patterns of genetic diversity in a threatened salamander

Context The maintenance of genetic diversity is essential for preserving adaptive potential in populations, yet it is increasingly threatened by landscape alteration. The field of landscape genetics offers a framework for assessing how patch-level landscape conditions, modeled at multiple scales, influence genetic diversity. Objectives We sought to assess how local environmental features and connectivity influence genetic diversity across 74 four-toed salamander (Hemidactylium scutatum) breeding wetlands in the southeastern United States. Methods Using next-generation sequencing data and hierarchical Bayesian models, we examined genome-wide heterozygosity in relation to local landscape features and ecological connectivity. We also assessed the scale of effect of landscape features and tested for temporal lag effects. Results Genetic diversity was lower in wetlands with higher levels of historic deforestation and lower connectivity. An interaction between deforestation and connectivity indicated that deforestation had stronger negative effects in isolated wetlands but weaker effects in well-connected wetlands. Accounting for scale of effect and temporal lags was critical for detecting these relationships. Conclusions Our analyses highlight the importance of assessing the spatial scale (scale of effect) and temporal lag of landscape features to detect key drivers of genetic diversity. In line with population genetic theory, our results indicate that the genetic consequences of habitat loss do not affect populations uniformly and are most severe in isolated populations where gene flow cannot buffer against loss of diversity. Altogether, we highlight the importance of considering the interaction of habitat loss and connectivity in conservation genetic management.

Hemidactylium scutatum↗

Uncertainty-aware molecular dynamics from Bayesian active learning for phase transformations and thermal transport in SiC

Abstract Machine learning interatomic force fields are promising for combining high computational efficiency and accuracy in modeling quantum interactions and simulating atomistic dynamics. Active learning methods have been recently developed to train force fields efficiently and automatically. Among them, Bayesian active learning utilizes principled uncertainty quantification to make data acquisition decisions. In this work, we present a general Bayesian active learning workflow, where the force field is constructed from a sparse Gaussian process regression model based on atomic cluster expansion descriptors. To circumvent the high computational cost of the sparse Gaussian process uncertainty calculation, we formulate a high-performance approximate mapping of the uncertainty and demonstrate a speedup of several orders of magnitude. We demonstrate the autonomous active learning workflow by training a Bayesian force field model for silicon carbide (SiC) polymorphs in only a few days of computer time and show that pressure-induced phase transformations are accurately captured. The resulting model exhibits close agreement with both ab initio calculations and experimental measurements, and outperforms existing empirical models on vibrational and thermal properties. The active learning workflow readily generalizes to a wide range of material systems and accelerates their computational understanding.

36 MATERIALS SCIENCE↗

BeyondPlanck: V. Minimal ADC Corrections for Planck LFI

We describe the correction procedure for Analog-to-Digital Converter (ADC) differential non-linearities (DNL) adopted in the Bayesian end-to-end BEYONDPLANCK analysis framework. This method is nearly identical to that developed for the official Planck Low Frequency Instrument (LFI) Data Processing Center (DPC) analysis, and relies on the binned rms noise profile of each detector data stream. However, rather than building the correction profile directly from the raw rms profile, we first fit a Gaussian to each significant ADC-induced rms decrement, and then derive the corresponding correction model from this smooth model. The main advantage of this approach is that only samples which are significantly affected by ADC DNLs are corrected, as opposed to the DPC approach in which the correction is applied to all samples, filtering out signals not associated with ADC DNLs. The new corrections are only applied to data for which there is a clear detection of the non-linearities, and for which they perform at least comparably with the DPC corrections. Out of a total of 88 LFI data streams (sky and reference load for each of the 44 detectors) we apply the new minimal ADC corrections in 25 cases, and maintain the DPC corrections in 8 cases. All these corrections are applied to 44 or 70 GHz channels, while, as in previous analyses, none of the 30 GHz ADCs show significant evidence of non-linearity. By comparing the BEYONDPLANCK and DPC ADC correction methods, we estimate that the residual ADC uncertainty is about two orders of magnitude below the total noise of both the 44 and 70 GHz channels, and their impact on current cosmological parameter estimation is small. However, we also show that non-idealities in the ADC corrections can generate sharp stripes in the final frequency maps, and these could be important for future joint analyses with the Planck High Frequency Instrument (HFI), Wilkinson Microwave Anisotropy Probe (WMAP), or other datasets. We therefore conclude that, although the existing corrections are adequate for LFI-based cosmological parameter analysis, further work on LFI ADC corrections is still warranted.

79 ASTRONOMY AND ASTROPHYSICS↗

Cosmology From CMB Lensing and Delensed EE Power Spectra Using 2019-2020 SPT-3G Polarization Data

From CMB polarization data alone we reconstruct the CMB lensing power spectrum, comparable in overall constraining power to previous temperature-based reconstructions, and an unlensed E -mode power spectrum, with clear detections of the third through tenth acoustic peaks. The observations, taken in 2019 and 2020 with the South Pole Telescope (SPT) and the SPT-3G camera, cover 1500 deg 2 at 95, 150, and 220 GHz with arcminute resolution and roughly 4.9 µ K-arcmin coadded noise in polarization. The power spectrum estimates, together with systematic parameter estimates and a joint covariance matrix, follow from a Bayesian analysis using the Marginal Unbiased Score Expansion (MUSE) method. The E -mode spectrum at ℓ > 2000 and lensing spectrum at L > 350 are the most precise to date. Assuming the ΛCDM model, and using only these SPT data and priors on τ and absolute calibration from Planck, we find H 0 = 66.81 ± 0.81 km/s/Mpc, comparable in precision to the Planck determination and in 5.4 σ tension with the most precise H 0 inference derived via the distance ladder. We also find S 8 ≡ σ 8 (Ω m /0.3) 0.5 = 0.850 ± 0.017, providing further independent evidence of a slight tension with low-redshift structure probes. The ΛCDM model provides a good simultaneous fit to the combined Planck, ACT, and SPT data, and thus passes a powerful test. Combining these CMB datasets with BAO observations, we explore extensions to the ΛCDM model. We find that the effective number of neutrino species, spatial curvature, and primordial helium fraction are consistent with standard model values, and that the 95% confidence upper limit on the neutrino mass sum is 0.075 eV, close to the minimum sum expected from observations of solar and atmospheric neutrino oscillations. The SPT data are consistent with the somewhat weak (< 3 σ ) preference for excess lensing power seen in Planck and ACT data relative to predictions of the ΛCDM model given the combined Planck, ACT, and BAO data sets. Finally, we also detect at greater than 3 σ the influence of non-linear evolution in the CMB lensing power spectrum and discuss it in the context of the S 8 tension. Forthcoming SPT-3G analyses will feature deeper and wider observations in temperature and polarization, providing even tighter constraints and more powerful tests of the ΛCDM model.

79 ASTRONOMY AND ASTROPHYSICS↗

Multivariate Testing of Sampling Techniques to Address Class Imbalance in Building Use Type Classification

This study addresses the challenges inherent in building use type classification, particularly focusing on the issue of class imbalance in the training datasets for machine learning classifiers. We comprehensively analyze the efficacy of various class-balancing sampling techniques. Employing Monte Carlo simulations and Bayesian optimization, we evaluated the performance of multiple sampling methods, including Random Oversampling, Random Undersampling, SMOTE, Borderline-SMOTE, and ADASYN, across a dataset encompassing nine southeastern coastal states of the United States. Our findings reveal that simple random over- and undersampling techniques outperform more sophisticated methods. Additionally, we show inherent value in creating an imbalance in training data to effectively train a machine learning classifier for distinguishing between residential and nonresidential buildings. This study provides valuable guidance for future research on building use type classification research and lays essential groundwork for developing attribute-rich building stock datasets.

Adams, Daniel↗

Efficient Sampling Allocation Procedures for Optimal Quantile Selection

We propose a dynamic sampling allocation and selection paradigm for finding the alternative with the optimal quantile in a Bayesian framework. Myopic allocation policies (MAPs), analogous to existing methods in classic ranking and selection for selecting the alternative with the optimal mean, and computationally efficient selection policies are derived for selecting the alternative with the optimal quantile. Under certain conditions, we prove that the proposed MAPs and selection procedures are consistent, which means that the best quantile would be eventually correctly selected as the sample size goes to infinity. Numerical experiments demonstrate that the proposed schemes can significantly improve the performance.

Computer Science↗

We Know Where We Don't Know: 3D Bayesian CNNs for Credible Geometric Uncertainty

Deep learning has been successfully applied to the segmentation of 3D Computed Tomography (CT) scans. Establishing the credibility of these segmentations requires uncertainty quantification (UQ) to identify untrustworthy predictions. Recent UQ architectures include Monte Carlo dropout networks (MCDNs), which approximate deep Gaussian processes, and Bayesian neural networks (BNNs), which learn the distribution of the weight space. BNNs are advantageous over MCDNs for UQ but are thought to be computationally infeasible in high dimension, and neither architecture has produced interpretable geometric uncertainty maps. We propose a novel 3D Bayesian convolutional neural network (BCNN), the first deep learning method which generates statistically credible geometric uncertainty maps and scales for application to 3D data. We present experimental results on CT scans of graphite electrodes and laser-welded metals and show that our BCNN outperforms an MCDN in recent uncertainty metrics. The geometric uncertainty maps generated by our BCNN capture distributions of sigmoid values that are interpretable as confidence intervals, critical for applications that rely on deep learning for high-consequence decisions.

97 MATHEMATICS AND COMPUTING↗

Mapping Stochastic Devices to Probabilistic Algorithms

Probabilistic and Bayesian neural networks have long been proposed as a method to incorporate uncertainty about the world (both in training data and operation) into artificial intelligence applications. One approach to making a neural network probabilistic is to leverage a Monte Carlo sampling approach that samples a trained network while incorporating noise. Such sampling approaches for neural networks have not been extensively studied due to the prohibitive requirement of many computationally expensive samples. While the development of future microelectronics platforms that make this sampling more efficient is an attractive option, it has not been immediately clear how to sample a neural network and what the quality of random number generation should be. This research aimed to start addressing these two fundamental questions by examining basic “off the shelf” neural networks can be sampled through a few different mechanisms (including synapse “dropout” and neuron “dropout”) and examine how these sampling approaches can be evaluated both in terms of evaluating algorithm effectiveness and the required quality of random numbers.

97 MATHEMATICS AND COMPUTING↗

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Developing a Continuous Nuclear Data Evaluation Method for the Resolved and Unresolved Resonance Regions With FITAPI and SAMMY [Poster]

SAMMY is an R-matrix Bayesian fitting program used in the analysis of nuclear cross section data. SAMMY produces separate cross section models in the resolved and unresolved resonance regions. This project develops a new method of continuous evaluation joining both energy regions with FITAPI. Full energy spectrum model introduces cross covariance between physics models allowing more accurate description of uncertainty. Consistency developed between physics models by the use of a unique set of prior parameters. An unresolved region cross section developed with sensitivity to resolved cross section. Incorporation into ORNL FITAPI provides access to greater number of parameter estimation algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Variational inference of effective range parameters for 3 He− 4 He scattering

We use two different methods, Monte Carlo sampling and variational inference (VI), to perform a Bayesian calibration of the effective-range parameters in 3 He– 4 He elastic scattering. The parameters are calibrated to data from a recent set of 3 He– 4 He elastic scattering differential cross section measurements. Analysis of these data for E lab ≤ 4.3 MeV yields a unimodal posterior for which both methods obtain the same structure. However, the effective-range expansion amplitude does not account for the 7/2 − state of 7 Be so, even after calibration, the description of data at the upper end of this energy range is poor. The data up to E lab = 2.6 MeV can be well described, but calibration to this lower-energy subset of the data yields a bimodal posterior. After adapting VI to treat such a multi-modal posterior we find good agreement between the VI results and those obtained with parallel-tempered Monte Carlo sampling.

effective field theory↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

Automated integration gate selection for Gaussian mixture model pulse shape discrimination

Pulse shapes differ between neutron and gamma particles when measured with detector devices employing pulse shape discriminating (PSD) scintillators. Digitized waveforms can be used in detection systems to perform pulse shape discrimination for this application. Prior Gaussian Mixture Model (GMM) methods require access to the pulse full-waveform. Reducing the waveform to a smaller set of combined samples reduces computational cost while affecting PSD performance. In this work, we develop a method for selecting the best performing combination of integration gates, or contiguous summed segments of the digitized pulse for PSD. The method uses a discrimination score based on the GMM PSD approach. Furthermore, the final selection is performed using Bayesian Optimization. PSD detection results are compared with varying numbers of selected gates on time-of-flight (TOF) data. This method can be used to fully automate the selection of gates in an unsupervised (without ground truth labels) setting.

42 ENGINEERING↗