Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonparametric”

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 415 records · Page 23

Code for multi-shape Gaussian process (GP) fitting with uncertainty quantification (UQ)

This is code associated with the publication “Nonparametric Multi-shape Modeling with Uncertainty Quantification,” authored by Hengrui Luo (Lawrence Berkeley National Laboratory) and Justin Strait (Los Alamos National Laboratory). The code is used to fit multiple-output Gaussian process (GP) models of planar closed curves to collections of ordered point sets, allowing for flexible nonlinear prediction of the underlying curve under dense or sparse point set samplings and with or without noise, as well as tractable uncertainty quantification. To do this, we employ use of a periodic kernel to account for the nonlinear input space of closed curves, and combine with coregionalization models to account for dependence both (i) between curve coordinates, and (ii) between pairs of curves. Functions in the code are capable of fitting these models, as well as performing additional tasks with the fitted curves such as (a) shape registration and alignment, (b) shape averaging, and (c) fitting for curve sub-populations / clusters.

Strait, Justin↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Bayesian projection pursuit regression

In projection pursuit regression (PPR), a univariate response variable is approximated by the sum of $M$ “ridge functions,” which are flexible functions of one-dimensional projections of a multivariate input variable. Traditionally, optimization routines are used to choose the projection directions and ridge functions via a sequential algorithm, and $M$ is typically chosen via cross-validation. Here, we introduce a novel Bayesian version of PPR, which has the benefit of accurate uncertainty quantification. To infer appropriate projection directions and ridge functions, we apply novel adaptations of methods used for the single ridge function case ($M$=1), called the Bayesian Single Index Model; and use a Reversible Jump Markov chain Monte Carlo algorithm to infer the number of ridge functions $M$. We evaluate the predictive ability of our model in 20 simulated scenarios and for 23 real datasets, in a bake-off against an array of state-of-the-art regression methods. Finally, we generalize this methodology and demonstrate the ability to accurately model multivariate response variables. Its effective performance indicates that Bayesian Projection Pursuit Regression is a valuable addition to the existing regression toolbox.

97 MATHEMATICS AND COMPUTING↗

Electron parallel closures for various ion charge numbers

Electron parallel closures for the ion charge number Z = 1 [J.-Y. Ji and E. D. Held, Phys. Plasmas 21, 122116 (2014)] are extended for 1 ≤ Z ≤ 10. Parameters are then computed for various Z with the same form of the Z = 1 kernels adopted. The parameters are smoothly varying in Z and hence can be used to interpolate parameters and closures for noninteger, effective ion charge numbers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Autoregressive distributed lag-based dynamic uniformity modeling and monitoring approaches for superconductor manufacturing

High-temperature superconductors (HTS), known for their high efficiency and low energy loss, have found profound applications across various fields, driving the demand for long, uniformly performing tapes. However, ensuring uniform performance over extended lengths of HTS tapes, often characterized by the consistency of critical current, remains challenging due to fluctuations in growth conditions during manufacturing. Here, to elucidate the mechanisms underlying variations in tape uniformity and enable real-time monitoring of associated parameters, we propose an Autoregressive Distributed Lag (ADL)-based Dynamic Uniformity Modeling and Monitoring (ADUM2) approach. This method integrates uniformity measurement, the identification of critical process parameters and real-time monitoring within the manufacturing process. The ADUM2 approach is applied to the advanced metal organic chemical vapor deposition (A-MOCVD) process, a pilot-scale method for superconductor manufacturing. Our model demonstrates superior performance compared to benchmark methods, accounting for over 80% of the total variance in the data and identifying 13 key process parameters influencing the uniformity of HTS tapes. This study offers significant insights into the high-temperature superconductor manufacturing process and holds the potential to facilitate the production of cost-effective, uniformly performing long superconducting tapes in the future.

autoregressive distributed lag analysis↗

Morse–Smale Regression

This paper introduces a novel partition-based regression approach that incorporates topological information. Partition-based regression typically introduces a quality-of-fit-driven decomposition of the domain. The emphasis in this work is on a topologically meaningful segmentation. Thus, the proposed regression approach is based on a segmentation induced by a discrete approximation of the Morse–Smale complex. This yields a segmentation with partitions corresponding to regions of the function with a single minimum and maximum that are often well approximated by a linear model. This approach yields regression models that are amenable to interpretation and have good predictive capacity. Typically, regression estimates are quantified by their geometrical accuracy. For the proposed regression, an important aspect is the quality of the segmentation itself. Thus, this article introduces a new criterion that measures the topological accuracy of the estimate. The topological accuracy provides a complementary measure to the classical geometrical error measures and is very sensitive to overfitting. The Morse–Smale regression is compared to state-of-the-art approaches in terms of geometry and topology and yields comparable or improved fits in many cases. Finally, a detailed study on climate-simulation data demonstrates the application of the Morse–Smale regression. Supplementary Materials are available online and contain an implementation of the proposed approach in the R package msr, an analysis and simulations on the stability of the Morse–Smale complex approximation, and additional tables for the climate-simulation study.

97 MATHEMATICS AND COMPUTING↗

Techniques for Analyzing Lens Manufacturing Data with Optical Design Applications

Optical designers assume a mathematically derived statistical distribution of the relevant design parameters for their Monte Carlo tolerancing simulations. However, there may be significant differences between the assumed distributions and the likely outcomes from manufacturing. Of particular interest for this study are the data analysis techniques and how they may be applied to optical and mechanical tolerance decisions. The effect of geometric factors and mechanical glass properties on lens manufacturability will be also be presented. Although the present work concerns lens grinding and polishing, some of the concepts and analysis techniques could also be applied to other processes such molding and single-point diamond turning.

optical design, statistics, optomechanical, manufa↗

Learning Functions Varying along a Central Subspace

Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗

Comparative Study of Differentially Private Data Synthesis Methods

When sharing data among researchers or releasing data for public use, there is a risk of exposing sensitive information of individuals in the data set. Data synthesis is a statistical disclosure limitation technique for releasing synthetic data sets with pseudo individual records. Traditional data synthesis techniques often rely on strong assumptions of a data intruder’s behaviors and background knowledge to assess disclosure risk. Differential privacy (DP) formulates a theoretical approach for a strong and robust privacy guarantee in data release without having to model intruders’ behaviors. Efforts have been made aiming to incorporate the DP concept in the data synthesis process. Here, we examine current DIfferentially Private Data Synthesis (DIPS) techniques for releasing individual-level surrogate data for the original data, compare the techniques conceptually and evaluate the statistical utility and inferential properties of the synthetic data via each DIPS technique through extensive simulation studies. Our work sheds light on the practical feasibility and utility of the various DIPS approaches, and suggests future research directions for DIPS.

97 MATHEMATICS AND COMPUTING↗

The Attraction Indian Buffet Distribution

We propose the attraction Indian buffet distribution (AIBD), a distribution for binary feature matrices influenced by pairwise similarity information. Binary feature matrices are used in Bayesian models to uncover latent variables (i.e., features) that explain observed data. The Indian buffet process (IBP) is a popular exchangeable prior distribution for latent feature matrices. In the presence of additional information, however, the exchangeability assumption is not reasonable or desirable. The AIBD can incorporate pairwise similarity information, yet it preserves many properties of the IBP, including the distribution of the total number of features. Thus, much of the interpretation and intuition that one has for the IBP directly carries over to the AIBD. A temperature parameter controls the degree to which the similarity information affects feature-sharing between observations. Unlike other nonexchangeable distributions for feature allocations, the probability mass function of the AIBD has a tractable normalizing constant, making posterior inference on hyperparameters straight-forward using standard MCMC methods. A novel posterior sampling algorithm is proposed for the IBP and the AIBD. We demonstrate the feasibility of the AIBD as a prior distribution in feature allocation models and compare the performance of competing methods in simulations and an application.

97 MATHEMATICS AND COMPUTING↗

Multiclass Classification Using Bayesian Multivariate Adaptive Regression Splines

We present a new Bayesian model for the problem of multiclass classification. In this model, the probabilities of class membership of a given observation are determined by the mean of a latent Gaussian distribution. The mean functions of this latent distribution consist of combinations of highly flexible basis functions of the inputs: multivariate adaptive regression splines (MARS), first developed for multiple regression. We use reversible jump Markov chain Monte Carlo to make inference on the classification model, including the number of basis functions. We compare the probabilistic classification performance of our proposed approach to existing methods on simulated and benchmark data, and compare uncertainty estimates on simulated data. Our proposed method compares favorably with existing Bayesian and frequentist multiclass classification methods in out-of-sample probabilistic classification, and uncertainty estimation of these probabilistic classifications. We examine the fit of the proposed method to a data set of hurricane storm surge levels near Delaware Bay, US, and conclude that sea level rise is a key contributor to damage delivered by storm surge.

97 MATHEMATICS AND COMPUTING↗

TBASS: A Robust Adaptation of Bayesian Adaptive Spline Surfaces

The R package TBASS is an extension of the BASS package created by Francom and Sansó (2019). The package is used to fit a Bayesian multivariate adaptive spline to a dataset that either follows a Student’s t-distribution or has outliers. Much of the framework for TBASS is adapted from the concepts of Bayesian Multivariate Adaptive Regression Splines (BMARS), specifically the work done by Denison, Mallick, and Smith (1998). The spline function is fit using a Reversible-Jump Markov Chain Monte Carlo algorithm,. By including this more robust generalization, a dataset with outliers can be accurately fit using the BMARS model, without the possibility of overfitting or variance inflation.

97 MATHEMATICS AND COMPUTING↗

Lumbar spine disc heights and curvature: upright posture vs. supine compression harness

INTRODUCTION: Spinal lengthening in microgravity is thought to cause back pain in astronauts. A spinal compression harness can compress the spine to eliminate lengthening but the loading condition with harness is different than physiologic conditions. Our purpose was to compare the effect of spine compression with a harness in supine position on disk height and spinal curvature in the lumbar spine to that of upright position as measured using a vertically open magnetic resonance imaging system. METHODS: Fifteen healthy subjects volunteered. On day 1, each subject lay supine for an hour and a baseline scan of the lumbar spine was performed. After applying a load of fifty percent of body weight with the harness for thirty minutes, the lumbar spine was scanned again. On day 2, after a baseline scan, a follow up scan was performed after kneeling for thirty minutes within the gap between two vertically oriented magnetic coils. Anterior and posterior disk heights, posterior disk bulging, and spinal curvature were measured from the baseline and follow up scans. RESULTS: Anterior disk heights increased and posterior disk heights decreased compared with baseline scans both after spinal compression with harness and upright posture. The spinal curvature increased by both loading conditions of the spine. DISCUSSION: The spinal compression with specially designed harness has the same effect as the physiologic loading of the spine in the kneeling upright position. The harness shows some promise as a tool to increase the diagnostic capabilities of a conventional MR system.

Non-NASA Center↗

Angiogenesis and osteogenesis in an orthopedically expanded suture

The purpose of this study was to examine the angiogenic and the subsequent osteogenic responses during a 96-hour time-course after sutural expansion. Fifty rats were divided into: (1) a control group that received only angiogenic induction through injection of 5 ng/gm recombinant human endothelial cell growth factor (rhECGF); (2) an experimental group that received orthopedic expansion and rhECGF; (3) a sham group that received expansion and sodium chloride (NaCl) injection; and (4) a baseline group that received no expansion or injection. All rats were injected with 3H-thymidine (1.0 microCi/gm) 1 hour before death to label the DNA of S-phase cells. Demineralized sections (4 microm thick) were stained with hematoxylin and eosin. Angiogenesis and cell migration were analyzed with a previously established cell kinetics model. Analysis of variance was used to test the hypothesis that enhancement of angiogenesis stimulates reestablishment of osteogenic capability. Blood vessel number, area, and endothelial cell-labeled index significantly increased in experimental groups, but no difference was found between control and baseline groups. Labeled-pericyte index and activated pericyte numbers in the experimental group were also higher than in the sham groups. These results show that supplemental rhECGF enhances angiogenesis in expanded sutures but not in nonexpanded sutures. Data also suggest that pericytes are the source of osteoblasts in an orthopedically expanded suture.

NASA Discipline Musculoskeletal↗

Statistical Distributions from Lens Manufacturing Data

Optical designers assume a mathematically derived statistical distribution of the relevant design parameters for their Monte Carlo tolerancing simulation. Presented are measured distributions using lens manufacturing data to better inform the decision-making process.

optical design, statistics, optomechanical, manufa↗