Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gaussian Process”

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 127 records · Page 7

A Gaussian Process Regression Reveals No Evidence for Planets Orbiting Kapteyn’s Star

Radial–velocity (RV) planet searches are often polluted by signals caused by gas motion at the star’s surface. Stellar activity can mimic or mask changes in the RVs caused by orbiting planets, resulting in false positives or missed detections. Here we use Gaussian process regression to disentangle the contradictory reports of planets versus rotation artifacts from Kapteyn’s star. To model rotation, we use joint quasiperiodic kernels for the RV and Hα signals, requiring that their periods and correlation timescales be the same. We find that the rotation period of Kapteyn’s star is 125 days, while the characteristic active-region lifetime is 694 days. Adding a planet to the RV model produces a best-fit orbital period of 100 yr, or 10 times the observing time baseline, indicating that the observed RVs are best explained by star rotation only. We also find no significant periodic signals in residual RV data sets constructed by subtracting off realizations of the best-fit rotation model and conclude that both previously reported “planets” are artifacts of the star’s rotation and activity. Our results highlight the pitfalls of using sinusoids to model quasiperiodic rotation signals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Active Learning for Gaussian Process Classification by Error Reduction

Active learning sequentially selects the best instance for labeling by optimizing an acquisition function to enhance data/label efficiency. The selection can be either from a discrete instance set (pool-based scenario) or a continuous instance space (query synthesis scenario). In this work, we study both active learning scenarios for Gaussian Process Classification (GPC). The existing active learning strategies that maximize the Estimated Error Reduction (EER) aim at reducing the classification error after training with the new acquired instance in a onestep-look-ahead manner. The computation of EER-based acquisition functions is typically prohibitive as it requires retraining the GPC with every new query. Moreover, as the EER is not smooth, it can not be combined with gradient-based optimization techniques to efficiently explore the continuous instance space for query synthesis. To overcome these critical limitations, we develop computationally efficient algorithms for EER-based active learning with GPC. Further, we derive the joint predictive distribution of label pairs as a one-dimensional integral, as a result of which the computation of the acquisition function avoids retraining the GPC for each query, remarkably reducing the computational overhead. We also derive the gradient chain rule to efficiently calculate the gradient of the acquisition function, which leads to the first query synthesis active learning algorithm implementing EER-based strategies. Our experiments clearly demonstrate the computational efficiency of the proposed algorithms. We also benchmark our algorithms on both synthetic and real-world datasets, which show superior performance in terms of sampling efficiency compared to the existing state-of-the-art algorithms.

97 MATHEMATICS AND COMPUTING↗

Fast Characterization of Inducible Regions of Atrial Fibrillation Models With Multi-Fidelity Gaussian Process Classification

Computational models of atrial fibrillation have successfully been used to predict optimal ablation sites. A critical step to assess the effect of an ablation pattern is to pace the model from different, potentially random, locations to determine whether arrhythmias can be induced in the atria. In this work, we propose to use multi-fidelity Gaussian process classification on Riemannian manifolds to efficiently determine the regions in the atria where arrhythmias are inducible. We build a probabilistic classifier that operates directly on the atrial surface. We take advantage of lower resolution models to explore the atrial surface and combine seamlessly with high-resolution models to identify regions of inducibility. We test our methodology in 9 different cases, with different levels of fibrosis and ablation treatments, totalling 1,800 high resolution and 900 low resolution simulations of atrial fibrillation. When trained with 40 samples, our multi-fidelity classifier that combines low and high resolution models, shows a balanced accuracy that is, on average, 5.7% higher than a nearest neighbor classifier. We hope that this new technique will allow faster and more precise clinical applications of computational models for atrial fibrillation. All data and code accompanying this manuscript will be made publicly available at: https://github.com/fsahli/AtrialMFclass.

59 BASIC BIOLOGICAL SCIENCES↗

Gaussian Process Modeling For Experimental Procedure Uncertainty

Many laboratory experiments generate data that are characterized by a form of uncertainty that differs from noise: experimental procedure uncertainty. The origin of this type of uncertainty is the difficulty in controlling a subset of experimental conditions in such a way that the experiment is perfectly reproducible within noise. In this report, we describe a Gaussian Process modeling-based method that accounts for experimental procedure uncertainty. The method accounts for variations in conditions from experiment to experiment that are independent between experiments, but correlated within each experiment, and incorporates the resulting uncertainty into predictions at future experimental settings. The method is discussed in the context of a specific chemistry application in which Raman scattering spectra are measured from three-component mixtures.

42 ENGINEERING↗

Prediction of plasma simulation data with the Gaussian process method

The simulation of plasma-wall interactions of fusion plasmas is extremely costly in computer power and time - the running time for a single parameter setting is easily in the order of weeks or months. We propose to exploit the already gathered results in order to predict the outcome for parametric studies within the high dimensional parameter space. For this we utilize Gaussian processes within the Bayesian framework and perform validation with one and two dimensional test cases from which we learn how to assess the outcome. Finally, the newly implemented method is applied to simulated data from the scrape-off layer of a fusion plasma. Uncertainties of the predictions are provided which point the way to parameter settings of further (expensive) simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

O’Hare Airport Short-Term Ground Transportation Modal Demand Forecast Using Gaussian Processes

Here, the principal objective of this study is to analyze the spatial and temporal variation of ground transportation airport demand and provide demand forecast to inform planning capability and explore alternatives for investments to accommodate airport growth. Because of its good adaptability and strong generalization ability for dealing with high-dimensional input, small-sample, and nonlinear spatial data, Gaussian process (GP) regression is used to provide forecast estimates using data from transportation network company (TNC) trips and urban rail passengers at Chicago's O'Hare International Airport. TNC airport trips differ significantly, with three times more distance, more than twice the travel time, and half of the share requests compared with nonairport trips. This highlights the need for separate demand models. Hourly analysis of the rail service indicates that this is likely heavily used by airport workers, whereas TNC services focus on travelers because of variations in the peak demand hours. Heteroscedastic GP regression is implemented because of differences in trip variance between night and day hours. Estimates are given for weekdays and weekend trips, and the 95% confidence intervals are calculated. The introduction of flight schedule information into the models shows marginal improvements in their performance. However, fitting a GP regression becomes computationally expensive with increased sample size and the introduction of spatial components. Transportation planners and policymakers can use the results and methods implemented in this study to optimize transportation assets and provide long-range simulations of the current and future conditions in the area.

42 ENGINEERING↗

Scalable Gaussian Processes, GPyTorch Application Benchmarking, and Targeted Adaptive Design (TAD) on ThetaGPU

We aim at showcasing the scalability of Gaussian Process (GP). The naive GP implementation scales cubically with data size, which can be prohibitive, so GP has not heretofore been considered suitable for very large-scale problem settings. We take advantage of GPyTorch, a library for scalable GPs built on top of PyTorch that incorporates GPU acceleration. With GPyTorch, one can achieve nearly linear scaling with structured kernel interpolation (SKI) and constant-time predictive covariances computation with LanczOs Variance Estimates (LOVE) while preserving accuracy. We also take advantage of the computational power of ThetaGPU, a supercomputer of Argonne Leadership Computing Facility (ALCF). In addition, we implement a scalable, GPU-ready version of Targeted Adaptive Design (TAD), a GP-based data-driven algorithm that efficiently searches the control space of an advanced manufacturing experiment for settings capable of producing a required design within a specified tolerance, despite the poorly known mapping from control settings to design. We finally show our benchmarking for GPyTorch and TAD performance on CPU vs. ThetaGPU and discuss the results and implications.

97 MATHEMATICS AND COMPUTING↗

Implementing a Gaussian Process Learning Algorithm in Mixed Parallel Environment

In this paper, we present a scalability analysis of a parallel Gaussian process training algorithm to simultaneously analyze a massive number of time series. We study three different parallel implementations: using threads, MPI, and a hybrid implementation using threads and MPI. We compare the scalability for the multi-threaded implementation on three different hardware platforms: a Mac desktop with two quad-core Intel Xeon processors (16 virtual cores), a Linux cluster node with four quad-core 2.3 GHz AMD Opteron processors, and SGI Altix ICE 8200 cluster node with two quad-core Intel Xeon processors (16 virtual cores). We also study the scalability of the MPI based and the hybrid MPI and thread based implementations on the SGI cluster with 128 nodes (2048 cores). Experimental results show that the hybrid implementation scales better than the multi-threaded and MPI based implementations. The hybrid implementation, using 1536 cores, can analyze a remote sensing data set with over 4 million time series in nearly 5 seconds while the serial algorithm takes nearly 12 hours to process the same data set.

99 GENERAL AND MISCELLANEOUS↗

Exploring scalar field dynamics with Gaussian processes

The origin of the accelerated expansion of the Universe remains an unsolved mystery in Cosmology. In this work we consider a spatially flat Friedmann-Robertson-Walker (FRW) Universe with non-relativistic matter and a single scalar field contributing to the energy density of the Universe. Properties of this scalar field, like potential, kinetic energy, equation of state etc. are reconstructed from Supernovae and BAO data using Gaussian processes. We also reconstruct energy conditions and kinematic variables of expansion, such as the jerk and the slow roll parameter. We find that the reconstructed scalar field variables and the kinematic quantities are consistent with a flat ΛCDM Universe. Further, we find that the null energy condition is satisfied for the redshift range of the Supernovae data considered in the paper, but the strong energy condition is violated.

79 ASTRONOMY AND ASTROPHYSICS↗

Detection Limits of Low-mass, Long-period Exoplanets Using Gaussian Processes Applied to HARPS-N Solar Radial Velocities

Radial velocity (RV) searches for Earth-mass exoplanets in the habitable zone around Sun-like stars are limited by the effects of stellar variability on the host star. In particular, suppression of convective blueshift and brightness inhomogeneities due to photospheric faculae/plage and starspots are the dominant contribution to the variability of such stellar RVs. Gaussian process (GP) regression is a powerful tool for statistically modeling these quasi-periodic variations. We investigate the limits of this technique using 800 days of RVs from the solar telescope on the High Accuracy Radial velocity Planet Searcher for the Northern hemisphere (HARPS-N) spectrograph. These data provide a well-sampled time series of stellar RV variations. Into this data set, we inject Keplerian signals with periods between 100 and 500 days and amplitudes between 0.6 and 2.4 m s{sup −1}. We use GP regression to fit the resulting RVs and determine the statistical significance of recovered periods and amplitudes. We then generate synthetic RVs with the same covariance properties as the solar data to determine a lower bound on the observational baseline necessary to detect low-mass planets in Venus-like orbits around a Sun-like star. Our simulations show that discovering planets with a larger mass (∼0.5 m s{sup −1}) using current-generation spectrographs and GP regression will require more than 12 yr of densely sampled RV observations. Furthermore, even with a perfect model of stellar variability, discovering a true exo-Venus (∼0.1 m s{sup −1}) with current instruments would take over 15 yr. Therefore, next-generation spectrographs and better models of stellar variability are required for detection of such planets.

47 OTHER INSTRUMENTATION↗

Scalable and efficient learning from crowds with Gaussian processes

Over the last few years, multiply-annotated data has become a very popular source of information. Online platforms such as Amazon Mechanical Turk have revolutionized the labelling process needed for any classification task, sharing the effort between a number of annotators (instead of the classical single expert). This crowdsourcing approach has introduced new challenging problems, such as handling disagreements on the annotated samples or combining the unknown expertise of the annotators. Probabilistic methods, such as Gaussian Processes (GP), have proven successful to model this new crowdsourcing scenario. However, GPs do not scale up well with the training set size, which makes them prohibitive for medium-to-large datasets (beyond 10K training instances). This constitutes a serious limitation for current real-world applications. In this work, we introduce two scalable and efficient GP-based crowdsourcing methods that allow for processing previously-prohibitive datasets. The first one is an efficient and fast approximation to GP with squared exponential (SE) kernel. The second allows for learning a more flexible kernel at the expense of a heavier training (but still scalable to large datasets). Since the latter is not a GP-SE approximation, it can be also considered as a whole new scalable and efficient crowdsourcing method, useful for any dataset size. Both methods use Fourier features and variational inference, can predict the class of new samples, and estimate the expertise of the involved annotators. A complete experimentation compares them with state-of-the-art probabilistic approaches in synthetic and real crowdsourcing datasets of different sizes. Finally, they stand out as the best performing approach for large scale problems. Moreover, the second method is competitive with the current state-of-the-art for small datasets.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

O'Hare Airport roadway traffic prediction via data fusion and Gaussian process regression

This study proposes an approach of leveraging information gathered from multiple traffic data sources at different resolutions to obtain approximate inference on the traffic distribution of Chicago's O'Hare Airport area. Specifically, it proposes the ingestion of traffic datasets at different resolutions to build spatiotemporal models for predicting the distribution of traffic volume on the road network. Due to its good adaptability and flexibility for spatiotemporal data, the Gaussian process (GP) regression was employed to provide short-term forecasts using data collected by loop detectors (sensors) and supplemented by telematics data. The GP regression is used to make predictions of the distribution of the proportion of sensor data traffic volume represented by the telematics data for each location of the sensors. Consequently, the fitted GP model can be used to determine the approximate traffic distribution for a testing location outside of the training points. Policymakers in the transportation sector can find the results of this work helpful for making informed decisions relating to current and future transportation conditions in the area.

42 ENGINEERING↗

Joint Data Filtering and Labeling Using Gaussian Processes and Alternating Direction Method of Multipliers

Here, sequence labeling aims at assigning a label to every sample of a signal (or pixel of an image) while considering the sequentiality (or vicinity) of the samples. To perform this task, many works in the literature first filter and then label the data. Unfortunately, the filtering, which is performed independently from the labeling, is far from optimal and frequently makes the latter task harder. In this paper, a novel approach that trains a Gaussian process classifier and estimates the coefficients of an optimal filter jointly is presented. The new approach, based on Bayesian modeling and alternating direction method of multipliers (ADMMs) optimization, performs both tasks simultaneously. All unknowns are treated as stochastic variables, which are estimated using variational inference and filtering and labeling are linked with the use of ADMM. In the experimental section, synthetic and real experiments are presented to compare the proposed method with other existing approaches.

97 MATHEMATICS AND COMPUTING↗

Dynamical Mass Estimates of the β Pictoris Planetary System through Gaussian Process Stellar Activity Modeling

Nearly 15 yr of radial velocity (RV) monitoring and direct imaging enabled the detection of two giant planets orbiting the young, nearby star β Pictoris. The δ Scuti pulsations of the star, which overwhelm planetary signals, need to be carefully suppressed. In this work, we independently revisit the analysis of the RV data following a different approach than available in the literature to model the activity of the star. We show that a Gaussian process (GP) with a stochastically driven damped harmonic oscillator kernel can model the δ Scuti pulsations. It provides similar results to parametric models but with a simpler framework, using only three hyperparameters. It also enables us to model poorly sampled RV data that were excluded from previous analyses, hence extending the RV baseline by nearly five years. Altogether, the orbit and mass of both planets can be constrained from RV only, which was not possible with the parametric modeling. To characterize the system more accurately, we also perform a joint fit of all available relative astrometry and RV data. Our orbital solutions for β Pic b favor a low eccentricity of 0.029$_{−0.024}^{+0.061}$ and a relatively short period of 21.1$_{−0.8}^{+2.0}$ yr. The orbit of β Pic c is eccentric with 0.206$_{−0.063}^{+0.074}$ with a period of 3.36 ± 0.03 yr. We find model-independent masses of 11.7 ± 1.4 and 8.5 ± 0.5 M Jup for β Pic b and c, respectively, assuming coplanarity. The mass of β Pic b is consistent with the hottest start evolutionary models, at an age of 25 ± 3 Myr. A direct detection of β Pic c would provide a second calibration measurement in a coeval system.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast Gaussian Process Estimation for Large-Scale In Situ Inference using Convolutional Neural Networks

Exascale computing will bring with it significant I/O limitations. One foreseeable consequence of such restrictions is that the user can save only a small fraction of complex simulation data to disk for subsequent analysis. An alternative is to fit statistical models to data in situ, that is, inside the simulation as it runs. This option requires extremely fast statistical estimation to avoid slowing down the simulation. Gaussian processes (GPs) have state-of-the-art predictive performance for modeling spatial data. However, standard estimation methods for GPs scale quite poorly to large data sets as parameter estimation requires inverting a covariance matrix to the size of the data set. In the presented work, we use a convolutional neural network (CNN) to predict the GP parameters for a spatial data set, from a simulation or otherwise, rather than optimize the parameters directly. Here, our presented case study models spatial data from E3SM, the Department of Energy’s Exascale climate model. The CNN is trained on synthetic data simulated from GP models with known parameters and then applied to data from the climate simulation. In the presented examples, the neural network scheme produces parameter estimates that compare well with standard methods such as maximum likelihood estimation in predictive performance but is obtained four orders of magnitude faster.

big data↗

Multi-objective Bayesian alloy design using multi-task Gaussian processes

In design applications, correlations among material properties (such as the tendency for stronger materials to be less ductile) are often neglected. This approach is echoed in multi-objective optimization techniques which treat each performance characteristic as an independent objective, aiming to optimize scalar functions and find optimal Pareto fronts. However, this overlooks the statistical relationships between performance characteristics inherent in a material system. To address this, we propose the use of Bayesian optimization, a highly efficient black-box optimization algorithm known for constructing Gaussian processes (GPs) – uncorrelated surrogates - to model objective functions. Rather than evaluating multiple GPs for each objective function separately, we argue for a shift towards jointly modeling these objective functions, considering their statistical correlations. This integrated approach utilizes naturally occurring relationships among material properties, providing additional information to enhance the performance of the design framework. This requires the replacement of multiple independent GPs with a single multi-task GP, employing a correlation matrix to construct a multi-task kernel function, wherein each task corresponds to a single objective function. Here, we anticipate this refined methodology will better leverage material correlations, improving design optimization results.

36 MATERIALS SCIENCE↗

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗