Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dimensionality Reduction”

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

Dimensional degression in AdS{sub d}

We analyze the pattern of fields in (d+1)-dimensional anti-de Sitter space in terms of those in d-dimensional anti-de Sitter space. The procedure, which is neither dimensional reduction nor dimensional compactification, is called dimensional degression. The analysis is performed group theoretically for all totally symmetric bosonic and fermionic representations of the anti-de Sitter algebra. The field-theoretical analysis is done for a massive scalar field in AdS{sub d+d{sup '}} and massless spin-one-half, spin-one, and spin-two fields in AdS{sub d+1}. The mass spectra of the resulting towers of fields in AdS{sub d} are found. For the scalar field case, the obtained results extend to the shadow sector those obtained by Metsaev [Nucl. Phys. B, Proc. Suppl. 102, 100 (2001)] by a different method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗

Recovering missing CFD data for high-order discretizations using deep neural networks and dynamics learning

Data I/O poses a significant bottleneck in large-scale CFD simulations; thus, practitioners would like to significantly reduce the number of times the solution is saved to disk, yet retain the ability to recover any field quantity (at any time instance) a posteriori . The objective of this work is therefore to accurately recover missing CFD data a posteriori at any time instance, given that the solution has been written to disk at only a relatively small number of time instances. We consider in particular high-order discretizations (e.g., discontinuous Galerkin), as such techniques are becoming increasingly popular for the simulation of highly separated flows. To satisfy this objective, this work proposes a methodology consisting of two stages: 1) dimensionality reduction and 2) dynamics learning. For dimensionality reduction, we propose a novel hierarchical approach. First, the method reduces the number of degrees of freedom within each element of the high-order discretization by applying autoencoders from deep learning. Second, the methodology applies principal component analysis to compress the global vector of encodings. This leads to a low-dimensional state, which associates with a nonlinear embedding of the original CFD data. For dynamics learning, we propose to apply regression techniques (e.g., kernel methods) to learn the discrete-time velocity characterizing the time evolution of this low-dimensional state. In conclusion, a numerical example on a large-scale CFD example characterized by nearly 13 million degrees of freedom illustrates the suitability of the proposed method in an industrial setting.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗

Real homotopy theory and supersymmetric quantum mechanics

In the context of observing string backgrounds, much work has been devoted to the question of how similar a general quantum field theory (specifically, a two-dimensional superconformal field theory) is to a sigma model. Put differently, one would like to know how well or poorly one can understand the physics of string backgrounds in terms of concepts of classical geometry. Much attention has also been given of late to the question of how geometry can be encoded in a microscopic physical description that makes no explicit reference to space and time. We revisit the first question and review both well-known and less well-known results about geometry and sigma models from the perspective of dimensional reduction to supersymmetric quantum mechanics. The consequences of arising as the dimensional reduction of a d -dimensional theory for the resulting quantum mechanics are explored. In this context, we reinterpret the minimal models of rational (more precisely, complex) homotopy theory as certain supersymmetric Fock spaces, with unusual actions of the supercharges. The data of the Massey products appear naturally as supersymmetric vacuum states that are entangled between different degrees of freedom. This connection between entanglement and geometry is, as far as we know, not well known to physicists. In addition, we take note of an intriguing numerical coincidence in the context of string compactification on hyper-Kähler eight-manifolds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Interpretation of autoencoder-learned collective variables using Morse–Smale complex and sublevelset persistent homology: An application on molecular trajectories

Dimensionality reduction often serves as the first step toward a minimalist understanding of physical systems as well as the accelerated simulations of them. In particular, neural network-based nonlinear dimensionality reduction methods, such as autoencoders, have shown promising outcomes in uncovering collective variables (CVs). However, the physical meaning of these CVs remains largely elusive. In this work, we constructed a framework that (1) determines the optimal number of CVs needed to capture the essential molecular motions using an ensemble of hierarchical autoencoders and (2) provides topology-based interpretations to the autoencoder-learned CVs with Morse–Smale complex and sublevelset persistent homology. Furthermore, this approach was exemplified using a series of n-alkanes and can be regarded as a general, explainable nonlinear dimensionality reduction method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-Dimensional Scaling on Groups

Leveraging the intrinsic symmetries in data for clear and efficient analysis is an important theme in signal processing and other data-driven sciences. A basic example of this is the ubiquity of the discrete Fourier transform which arises from translational symmetry (i.e. time-delay/phase-shift). Particularly important in this area is understanding how symmetries inform the algorithms that we apply to our data. In this paper we explore the behavior of the dimensionality reduction algorithm multi-dimensional scaling (MDS) in the presence of symmetry. We show that understanding the properties of the underlying symmetry group allows us to make strong statements about the output of MDS even before applying the algorithm itself. In analogy to Fourier theory, we show that in some cases only a handful of fundamental ``frequencies'' (irreducible representations derived from the corresponding group) contribute information for the MDS Euclidean embedding.

Dimensionality reduction, Representation theory, D↗

State-space dimensionality in short-memory hidden-variable theories

Recently we have presented a hidden-variable model of measurements for a qubit where the hidden-variable state-space dimension is one-half the quantum-state manifold dimension. The absence of a short memory (Markov) dynamics is the price paid for this dimensional reduction. The conflict between having the Markov property and achieving the dimensional reduction was proved by Montina [A. Montina, Phys. Rev. A 77, 022104 (2008)] using an additional hypothesis of trajectory relaxation. Here we analyze in more detail this hypothesis introducing the concept of invertible process and report a proof that makes clearer the role played by the topology of the hidden-variable space. This is accomplished by requiring suitable properties of regularity of the conditional probability governing the dynamics. In the case of minimal dimension the set of continuous hidden variables is identified with an object living an N-dimensional Hilbert space whose dynamics is described by the Schroedinger equation. A method for generating the economical non-Markovian model for the qubit is also presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian estimation of Karhunen–Loève expansions; A random subspace approach

One of the most widely-used statistical procedures for dimensionality reduction of high dimensional random fields is Principal Component Analysis (PCA), which is based on the Karhunen-Lo eve expansion (KLE) of a stochastic process with finite variance. The KLE is analogous to a Fourier series expansion for a random process, where the goal is to find an orthogonal transformation for the data such that the projection of the data onto this orthogonal subspace is optimal in the L 2 sense, i.e, which minimizes the mean square error. In practice, this orthogonal transformation is determined by performing an SVD (Singular Value Decomposition) on the sample covariance matrix or on the data matrix itself. Sampling error is typically ignored when quantifying the principal components, or, equivalently, basis functions of the KLE. Furthermore, it is exacerbated when the sample size is much smaller than the dimension of the random field. In this paper, we introduce a Bayesian KLE procedure, allowing one to obtain a probabilistic model on the principal components, which can account for inaccuracies due to limited sample size. The probabilistic model is built via Bayesian inference, from which the posterior becomes the matrix Bingham density over the space of orthonormal matrices. We use a modified Gibbs sampling procedure to sample on this space and then build a probabilistic Karhunen-Lo eve expansions over random subspaces to obtain a set of low-dimensional surrogates of the stochastic process. We illustrate this probabilistic procedure with a finite dimensional stochastic process inspired by Brownian motion.

97 MATHEMATICS AND COMPUTING↗

MHz gravitational waves from short-term anisotropic inflation

We reveal the universality of short-term anisotropic inflation. As a demonstration, we study inflation with an exponential type gauge kinetic function which is ubiquitous in models obtained by dimensional reduction from higher dimensional fundamental theory. It turns out that an anisotropic inflation universally takes place in the later stage of conventional inflation. Remarkably, we find that primordial gravitational waves with a peak amplitude around 10{sup −26}∼10{sup −27} are copiously produced in high-frequency bands 10 MHz∼100 MHz. If we could detect such gravitational waves in future, we would be able to probe higher dimensional fundamental theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗

Twistor Actions for Integrable Systems

Many integrable systems can be reformulated as holomorphic vector bundles on twistor space. This is a powerful organizing principle in the theory of integrable systems. One shortcoming is that it is formulated at the level of the equations of motion. From this perspective, it is mysterious that integrable systems have Lagrangians. In this paper, we study a Chern-Simons action on twistor space and use it to derive the Lagrangians of some integrable sigma models. Our focus is on examples that come from dimensionally reduced gravity and supergravity. The dimensional reduction of general relativity to two spacetime dimensions is an integrable coset sigma model coupled to a dilaton and 2d gravity. The dimensional reduction of supergravity to two spacetime dimensions is an integrable coset sigma model coupled to matter fermions, a dilaton, and 2d supergravity. We derive Lax operators and Lagrangians for these 2d integrable systems using the Chern-Simons theory on twistor space. In the supergravity example, we use an extended setup in which twistor Chern-Simons theory is coupled to a pair of matter fermions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Unsupervised Machine Learning for Exploratory Data Analysis of Exoplanet Transmission Spectra

Abstract Transit spectroscopy is a powerful tool for decoding the chemical compositions of the atmospheres of extrasolar planets. In this paper, we focus on unsupervised techniques for analyzing spectral data from transiting exoplanets. After cleaning and validating the data, we demonstrate methods for: (i) initial exploratory data analysis, based on summary statistics (estimates of location and variability); (ii) exploring and quantifying the existing correlations in the data; (iii) preprocessing and linearly transforming the data to its principal components; (iv) dimensionality reduction and manifold learning; (v) clustering and anomaly detection; and (vi) visualization and interpretation of the data. To illustrate the proposed unsupervised methodology, we use a well-known public benchmark data set of synthetic transit spectra. We show that there is a high degree of correlation in the spectral data, which calls for appropriate low-dimensional representations. We explore a number of different techniques for such dimensionality reduction and identify several suitable options in terms of summary statistics, principal components, etc. We uncover interesting structures in the principal component basis, namely well-defined branches corresponding to different chemical regimes of the underlying atmospheres. We demonstrate that those branches can be successfully recovered with a K-means clustering algorithm in a fully unsupervised fashion. We advocate for lower-dimensional representations of the spectroscopic data in terms of the main principal components, in order to reveal the existing structure in the data and quickly characterize the chemical class of a planet.

Matchev, Konstantin T. (ORCID:0000000341829096)↗

An investigation of Newton-Sketch and subsampled Newton methods

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. In this work, we study two forms of sketching that perform dimensionality reduction in data space: Hessian subsampling and randomized Hadamard transformations. Each has its own advantages, and their relative tradeoffs have not been investigated in the optimization literature. Additionally, our study focuses on practical versions of the two methods in which the resulting linear systems of equations are solved approximately, at every iteration, using an iterative solver. The advantages of using the conjugate gradient method vs. a stochastic gradient iteration are revealed through a set of numerical experiments, and a complexity analysis of the Hessian subsampling method is presented.

97 MATHEMATICS AND COMPUTING↗

SHOULD ONE USE THE RAY-BY-RAY APPROXIMATION IN CORE-COLLAPSE SUPERNOVA SIMULATIONS?

We perform the first self-consistent, time-dependent, multi-group calculations in two dimensions (2D) to address the consequences of using the ray-by-ray+ transport simplification in core-collapse supernova simulations. Such a dimensional reduction is employed by many researchers to facilitate their resource-intensive calculations. Our new code (Fornax) implements multi-D transport, and can, by zeroing out transverse flux terms, emulate the ray-by-ray+ scheme. Using the same microphysics, initial models, resolution, and code, we compare the results of simulating 12, 15, 20, and 25 M {sub ⊙} progenitor models using these two transport methods. Our findings call into question the wisdom of the pervasive use of the ray-by-ray+ approach. Employing it leads to maximum post-bounce/pre-explosion shock radii that are almost universally larger by tens of kilometers than those derived using the more accurate scheme, typically leaving the post-bounce matter less bound and artificially more “explodable.” In fact, for our 25 M {sub ⊙} progenitor, the ray-by-ray+ model explodes, while the corresponding multi-D transport model does not. Therefore, in two dimensions, the combination of ray-by-ray+ with the axial sloshing hydrodynamics that is a feature of 2D supernova dynamics can result in quantitatively, and perhaps qualitatively, incorrect results.

79 ASTRONOMY AND ASTROPHYSICS↗

Note about unstable M3-brane action

We construct an action for an unstable M3-brane in M theory. We argue that, in order to find M3-brane action that upon direct dimensional reduction leads to non-Bogomol'nyi-Prasad-Sommerfield D3-brane action in type IIA theory, we have to presume that the background possesses Killing isometry and that this isometry has to be gauged on the world volume of the M3-brane. Then we construct a singular tachyon kink on the world volume of the M3-brane, and we show that the dynamics of the resulting topological defect is governed by an action that upon direct dimensional reduction leads to a D2-brane in type IIA theory and that is equivalent to standard M2-brane action in a flat background.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ag 2 Se to KAg 3 Se 2 : Suppressing Order–Disorder Transitions via Reduced Dimensionality

Here we report an order–disorder phase transition in the 2D semiconductor KAg 3 Se 2 , which is a dimensionally reduced derivative of 3D Ag 2 Se. At ~695 K, the room temperature β-phase (CsAg 3 S 2 structure type, monoclinic space group C2/m) transforms to the high temperature α-phase (new structure type, hexagonal space group R$ \overline{3}\ $m, a = 4.5638(5) Å, c = 25.4109(6) Å), as revealed by in situ temperature-dependent X-ray diffraction. Significant Ag + ion disorder accompanies the phase transition, which resembles the low temperature (~400 K) superionic transition in the 3D parent compound. Ultralow thermal conductivity of ~0.4 W m –1 K –1 was measured in the “ordered” β-phase, suggesting anharmonic Ag motion efficiently impedes phonon transport even without extensive disordering. The optical and electronic properties of β-KAg 3 Se 2 are modified as expected in the context of the dimensional reduction framework. UV–vis spectroscopy shows an optical band gap of ~1 eV that is indirect in nature as confirmed by electronic structure calculations. Electronic transport measurements on β-KAg 3 Se 2 yielded n-type behavior with a high electron mobility of ~400 cm 2 V –1 s –1 at 300 K due to a highly disperse conduction band. Finally, our results thus imply that dimensional reduction may be used as a design strategy to frustrate order–disorder phenomena while retaining desirable electronic and thermal properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Prediction of epigenetically regulated genes in breast cancer cell lines

Methylation of CpG islands within the DNA promoter regions is one mechanism that leads to aberrant gene expression in cancer. In particular, the abnormal methylation of CpG islands may silence associated genes. Therefore, using high-throughput microarrays to measure CpG island methylation will lead to better understanding of tumor pathobiology and progression, while revealing potentially new biomarkers. We have examined a recently developed high-throughput technology for measuring genome-wide methylation patterns called mTACL. Here, we propose a computational pipeline for integrating gene expression and CpG island methylation profles to identify epigenetically regulated genes for a panel of 45 breast cancer cell lines, which is widely used in the Integrative Cancer Biology Program (ICBP). The pipeline (i) reduces the dimensionality of the methylation data, (ii) associates the reduced methylation data with gene expression data, and (iii) ranks methylation-expression associations according to their epigenetic regulation. Dimensionality reduction is performed in two steps: (i) methylation sites are grouped across the genome to identify regions of interest, and (ii) methylation profles are clustered within each region. Associations between the clustered methylation and the gene expression data sets generate candidate matches within a fxed neighborhood around each gene. Finally, the methylation-expression associations are ranked through a logistic regression, and their significance is quantified through permutation analysis. Our two-step dimensionality reduction compressed 90% of the original data, reducing 137,688 methylation sites to 14,505 clusters. Methylation-expression associations produced 18,312 correspondences, which were used to further analyze epigenetic regulation. Logistic regression was used to identify 58 genes from these correspondences that showed a statistically signifcant negative correlation between methylation profles and gene expression in the panel of breast cancer cell lines. Subnetwork enrichment of these genes has identifed 35 common regulators with 6 or more predicted markers. In addition to identifying epigenetically regulated genes, we show evidence of differentially expressed methylation patterns between the basal and luminal subtypes. Our results indicate that the proposed computational protocol is a viable platform for identifying epigenetically regulated genes. Our protocol has generated a list of predictors including COL1A2, TOP2A, TFF1, and VAV3, genes whose key roles in epigenetic regulation is documented in the literature. Subnetwork enrichment of these predicted markers further suggests that epigenetic regulation of individual genes occurs in a coordinated fashion and through common regulators.

59 BASIC BIOLOGICAL SCIENCES↗