Search NASA⌕ Search

SEARCH · Search NASA

Results for “low-dimensional models”

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

Low-dimensional Representation of Error Covariance

Ensemble and reduced-rank approaches to prediction and assimilation rely on low-dimensional approximations of the estimation error covariances. Here stability properties of the forecast/analysis cycle for linear, time-independent systems are used to identify factors that cause the steady-state analysis error covariance to admit a low-dimensional representation. A useful measure of forecast/analysis cycle stability is the bound matrix, a function of the dynamics, observation operator and assimilation method. Upper and lower estimates for the steady-state analysis error covariance matrix eigenvalues are derived from the bound matrix. The estimates generalize to time-dependent systems. If much of the steady-state analysis error variance is due to a few dominant modes, the leading eigenvectors of the bound matrix approximate those of the steady-state analysis error covariance matrix. The analytical results are illustrated in two numerical examples where the Kalman filter is carried to steady state. The first example uses the dynamics of a generalized advection equation exhibiting nonmodal transient growth. Failure to observe growing modes leads to increased steady-state analysis error variances. Leading eigenvectors of the steady-state analysis error covariance matrix are well approximated by leading eigenvectors of the bound matrix. The second example uses the dynamics of a damped baroclinic wave model. The leading eigenvectors of a lowest-order approximation of the bound matrix are shown to approximate well the leading eigenvectors of the steady-state analysis error covariance matrix.

Tippett, Michael K.↗

Epitaxy of Emerging Materials and Advanced Heterostructures for Microelectronics and Quantum Sciences

Abstract Epitaxy, a process to prepare crystalline materials in nanostructures and thin films, is the core technology for preparing high‐quality materials as a key enabler of next‐generation microelectronics and quantum information system. Progress in epitaxy has been expanding the choice of materials and their heterostructures beyond the combinations limited by materials compatibility. However, the improvement of material quality, physical implementation of materials with unique properties, and integration of incommensurate materials in an architecture have been the challenging issues. Emerging materials, including 2D materials and quantum materials, have opened opportunities to study epitaxy mechanisms and realize various functional devices. Acceleration of discovery and progress in epitaxy research should be accomplished by “understanding of epitaxy under various circumstances at multiple length scales” and “integration of experiments and models.” In the perspective, a basic summary of the status of epitaxially grown materials, the challenges in epitaxy research, and integration of modeling epitaxy and ultimate control of the epitaxy process with advanced characterization techniques are discussed.

Materials Science↗

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗

Visualization and efficient generation of constrained high-dimensional theoretical parameter spaces

We describe a set of novel methods for efficiently sampling high-dimensional parameter spaces of physical theories defined at high energies, but constrained by experimental measurements made at lower energies. Often, theoretical models such as supersymmetry are defined by many parameters, $\mathcal{O}$(10 – 100), expressed at high energies, while relevant experimental constraints are often defined at much lower energies, preventing them from directly ruling out portions of the space. Instead, the low-energy constraints define a complex, potentially non-contiguous subspace of the theory parameters. Naive scanning of the theory space for points which satisfy the low-energy constraints is hopelessly inefficient due to the high dimensionality, and the inverse problem is considered intractable. As a result, many theoretical spaces remain under-explored. We introduce a class of modified generative autoencoders, which attack this problem by mapping the high-dimensional parameter space to a structured low-dimensional latent space, allowing for easy visualization and efficient generation of theory points which satisfy experimental constraints. An extension without dimensional compression, which focuses on limiting potential information loss, is also introduced.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enhancing Interpretability in Generative Modeling: Statistically Disentangled Latent Spaces Guided by Generative Factors in Scientific Datasets

This study addresses the challenge of statistically extracting generative factors from complex, high-dimensional datasets in unsupervised or semi-supervised settings. We investigate encoder-decoder-based generative models for nonlinear dimensionality reduction, focusing on disentangling low-dimensional latent variables corresponding to independent physical factors. Introducing Aux-VAE, a novel architecture within the classical Variational Autoencoder framework, we achieve disentanglement with minimal modifications to the standard VAE loss function by leveraging prior statistical knowledge through auxiliary variables. These variables guide the shaping of the latent space by aligning latent factors with learned auxiliary variables. We validate the efficacy of Aux-VAE through comparative assessments on multiple datasets, including astronomical simulations.

97 MATHEMATICS AND COMPUTING↗

Deep nonparametric estimation of intrinsic data structures by chart autoencoders: Generalization error and robustness

Autoencoders have demonstrated remarkable success in learning low-dimensional latent features of high-dimensional data across various applications. Assuming that data are sampled near a low-dimensional manifold, we employ chart autoencoders, which encode data into low-dimensional latent features on a collection of charts, preserving the topology and geometry of the data manifold. Our paper establishes statistical guarantees on the generalization error of chart autoencoders, and we demonstrate their denoising capabilities by considering n noisy training samples, along with their noise-free counterparts, on a d-dimensional manifold. By training autoencoders, we show that chart autoencoders can effectively denoise the input data with normal noise. We prove that, under proper network architectures, chart autoencoders achieve a squared generalization error in the order of n–$\frac{2}{d+2}$log 4 n, which depends on the intrinsic dimension of the manifold and only weakly depends on the ambient dimension and noise level. We further extend our theory on data with noise containing both normal and tangential components, where chart autoencoders still exhibit a denoising effect for the normal component. As a special case, our theory also applies to classical autoencoders, as long as the data manifold has a global parametrization. Furthermore, our results provide a solid theoretical foundation for the effectiveness of autoencoders, which is further validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗

Unsupervised multimodal fusion of in-process sensor data for advanced manufacturing process monitoring

Effective monitoring of manufacturing processes is crucial for maintaining product quality and operational efficiency. Modern manufacturing environments often generate vast amounts of complementary multimodal data, including visual imagery from various perspectives and resolutions, hyperspectral data, and machine health monitoring information such as actuator positions, accelerometer readings, and temperature measurements. However, fusing and interpreting this complex, high-dimensional data presents significant challenges, particularly when labeled datasets are unavailable or impractical to obtain. This paper presents a novel approach to multimodal sensor data fusion in manufacturing processes, inspired by the Contrastive Language-Image Pre-training (CLIP) model. We leverage contrastive learning techniques to correlate different data modalities without the need for labeled data, overcoming limitations of traditional supervised machine learning methods in manufacturing contexts. Our proposed method demonstrates the ability to handle and learn encoders for five distinct modalities: visual imagery, audio signals, laser position (x and y coordinates), and laser power measurements. By compressing these high-dimensional datasets into low-dimensional representational spaces, our approach facilitates downstream tasks such as process control, anomaly detection, and quality assurance. The unsupervised nature of our method makes it broadly applicable across various manufacturing domains, where large volumes of unlabeled sensor data are common. We evaluate the effectiveness of our approach through a series of experiments, demonstrating its potential to enhance process monitoring capabilities in advanced manufacturing systems. This research contributes to the field of smart manufacturing by providing a flexible, scalable framework for multimodal data fusion that can adapt to diverse manufacturing environments and sensor configurations. The proposed method paves the way for more robust, data-driven decision-making in complex manufacturing processes.

Contrastive Learning↗

Insights into the Growth Orientation and Phase Stability of Chemical-Vapor-Deposited Two-Dimensional Hybrid Halide Perovskite Films

Chemical vapor deposition (CVD) offers a large-area, scalable, and conformal growth of perovskite thin films without the use of solvents. Low-dimensional organic–inorganic halide perovskites, with alternating layers of organic spacer groups and inorganic perovskite layers, are promising for enhancing the stability of optoelectronic devices. Moreover, their multiple quantum-well structures provide a powerful platform for tuning excitonic physics. Here, in this work, we show that the CVD process is conducive to the growth of 2D hybrid halide perovskite films. Using butylammonium (BA) and phenylethylammonium (PEA) cations, the growth parameters of BA 2 PbI 4 and PEA 2 PbI 4 and mixed halide perovskite films were first optimized. These films are characterized by well-defined grain boundaries and display characteristic absorption and emission features of the 2D quantum wells. X-ray diffraction (XRD) and a noninteger dimensionality model of the absorption spectrum provide insights into the orientation of the crystalline planes. Unlike BA 2 PbI 4 , temperature-dependent photoluminescence measurements from PEA 2 PbI 4 show a single excitonic peak throughout the temperature range from 20 to 350 K, highlighting the lack of defect states. These results further corroborate the temperature-dependent synchrotron-based XRD results. Furthermore, the nonlinear optical properties of the CVD-grown perovskite films are investigated, and a high third harmonic generation efficiency is observed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Revealing the hidden structure of disordered materials by parameterizing their local structural manifold

Abstract Durable interest in developing a framework for the detailed structure of glassy materials has produced numerous structural descriptors that trade off between general applicability and interpretability. However, none approach the combination of simplicity and wide-ranging predictive power of the lattice-grain-defect framework for crystalline materials. Working from the hypothesis that the local atomic environments of a glassy material are constrained by enthalpy minimization to a low-dimensional manifold in atomic coordinate space, we develop a generalized distance function, the Gaussian Integral Inner Product (GIIP) distance, in connection with agglomerative clustering and diffusion maps, to parameterize that manifold. Applying this approach to a two-dimensional model crystal and a three-dimensional binary model metallic glass results in parameters interpretable as coordination number, composition, volumetric strain, and local symmetry. In particular, we show that a more slowly quenched glass has a higher degree of local tetrahedral symmetry at the expense of cyclic symmetry. While these descriptors require post-hoc interpretation, they minimize bias rooted in crystalline materials science and illuminate a range of structural trends that might otherwise be missed.

36 MATERIALS SCIENCE↗

Discriminative versus generative approaches to simulation-based inference

Most of the fundamental, emergent, and phenomenological parameters of particle and nuclear physics are determined through parametric template fits. Simulations are used to populate histograms which are then matched to data. This approach is inherently lossy, since histograms are binned and low-dimensional. Deep learning has enabled unbinned and high-dimensional parameter estimation through neural likelihood(-ratio) estimation. We compare two approaches for neural simulation-based inference (NSBI): one based on discriminative learning (classification) and one based on generative modeling. These two approaches are directly evaluated on the same datasets, with a similar level of hyperparameter optimization in both cases. In addition to a Gaussian dataset, we study NSBI using a Higgs boson dataset from the FAIR Universe Challenge. We find that both the direct likelihood and likelihood ratio estimation are able to effectively extract parameters with reasonable uncertainties. For the numerical examples and within the set of hyperparameters studied, we found that the likelihood ratio method is more accurate and/or precise. Both methods have a significant spread from the network training and would require ensembling or other mitigation strategies in practice.

high energy physics↗

Quasi-One-Dimensional Spin Excitations in the Iron Pnictide NaFe 0.53 ⁢Cu 0.47 ⁢As

Spectroscopic measurements in model 1D correlated systems offer insights for understanding their two-dimensional counterparts, which include the cuprate and iron pnictide/chalcogenide superconductors. A major challenge is the identification of such correlated systems with dominantly 1D physics. Here, in this Letter, inelastic neutron scattering measurements on NaFe 0.53⁢ Cu 0.47 ⁢As single crystal directly reveal quasi-1D spin excitations, resulting from atomic order that leads to magnetic Fe and nonmagnetic Cu chains. The dominant exchange interaction is antiferromagnetic along the chain [𝑆⁢𝐽 ∥ ≈ 90.1⁢(3) meV], whereas the inter-chain couplings are much weaker [𝑆⁢𝐽 ⊥ ≈ −2.4⁢(1) meV and 𝑆⁢𝐽 c ≈ 0.15⁢(5) meV]. The quasi-1D spin excitations in NaFe 0.53 ⁢Cu 0.47⁢ As stem from both the Néel and stripe vectors, with Néel excitations sensitive to Fe impurities on the Cu site. The spin excitations in quasi-1D NaFe 0.53 ⁢Cu 0.47⁢ As and quasi-2D FeSe exhibit a striking resemblance, suggesting a common origin for their coexistent stripe and Néel excitations. Our findings demonstrate magnetic dilution in NaFeAs leads to dimension reduction of its magnetic degree of freedom, presenting a strategy for discovering low-dimensional quantum materials.

Wang, Yifan [Zhejiang Univ., Hangzhou (China)]↗

Nonreciprocal Coulomb drag between quantum wires in the quasi-one-dimensional regime

Coulomb drag experiments have been an essential tool to study strongly interacting low-dimensional systems. Historically, this effect has been explained in terms of momentum transfer between electrons in the active and the passive layer. We report Coulomb drag measurements between laterally coupled GaAs/AlGaAs quantum wires in the multiple one-dimensional (1D) sub-band regime that break Onsager's reciprocity upon both layer and current direction reversal, in contrast to prior 1D Coulomb drag results. The drag signal shows nonlinear current-voltage (I-V) characteristics, which are well characterized by a third-order polynomial fit. These findings are qualitatively consistent with a rectified drag signal induced by charge fluctuations. However, the nonmonotonic temperature dependence of this drag signal suggests that strong electron-electron interactions, expected within the Tomonaga-Luttinger liquid framework, remain important and standard interaction models are insufficient to capture the qualitative nature of rectified 1D Coulomb drag.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quasi-one-dimensional Pb 5 Re 3 O 15 : A 5 d realization of the Heisenberg antiferromagnetic spin-1/2 chain

Quasi-one-dimensional (1D) magnetic compounds connect the exact solutions of low-dimensional magnetic geometries, which promise quantum spin liquid behavior and exotic quasiparticles, with real-world materials, in which competing magnetic interactions affect their implementation in quantum information science. Here, the structural determination and quasi-1D magnetic behavior of a previously unreported compound, Pb 5 ⁢Re 3 ⁡O 15 , is presented. Like the anisotropic triangular A 3 ⁢ReO 5 ⁢Cl 2 (A = Ba, Sr, Ca) materials, Pb 5 ⁢Re 3 ⁡O 15 contains [ReO 5 ] square pyramids inserted into anion-centered quasi-two-dimensional layers and hosts spin-1/2 moments on the Re 6+ ions. Pb 5 ⁢Re 3 ⁡O 15 , however, has a more ideal quasi-1D geometry than the A 3 ⁢ReO 5 ⁢Cl 2 materials, with larger interchain distances and interlayer spacing. Quasi-1D magnetic behavior in Pb 5 ⁢Re 3 ⁡O 15 is confirmed by fitting the temperature-dependent magnetic susceptibility with the Bonner-Fisher model for a spin-1/2 antiferromagnetically coupled chain, yielding an intrachain coupling constant of |J|/k B =54.5K. Pb 5 ⁢Re 3 ⁡O 15 is highly insulating at room temperature, and heat capacity data below 10 K reveal a linear-T contribution that suggests the presence of low-temperature spinon excitations. Finally, with a lack of three-dimensional ordering down to at least 0.6 K, Pb 5 ⁢Re 3 ⁡O 15 is proposed as a model system for studying the quantum magnetism of quasi-1D Heisenberg chains in a real-world 5d 1 antiferromagnetic material.

36 MATERIALS SCIENCE↗

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗

Scalable Bayesian Physics-Informed Kolmogorov-Arnold Networks

Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.

97 MATHEMATICS AND COMPUTING↗

High-dimensional and permutation invariant anomaly detection

Methods for anomaly detection of new physics processes are often limited to low-dimensional spaces due to the difficulty of learning high-dimensional probability densities. Particularly at the constituent level, incorporating desirable properties such as permutation invariance and variable-length inputs becomes difficult within popular density estimation methods. In this work, we introduce a permutation-invariant density estimator for particle physics data based on diffusion models, specifically designed to handle variable-length inputs. We demonstrate the efficacy of our methodology by utilizing the learned density as a permutation-invariant anomaly detection score, effectively identifying jets with low likelihood under the background-only hypothesis. To validate our density estimation method, we investigate the ratio of learned densities and compare to those obtained by a supervised classification algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗