Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

The Analysis of Dimensionality Reduction Techniques in Cryptographic Object Code Classification

This paper compares the application of three different dimension reduction techniques to the problem of locating cryptography in compiled object code. A simple classi?er is used to compare dimension reduction via sorted covariance, principal component analysis, and correlation-based feature subset selection. The analysis concentrates on the classi?cation accuracy as the number of dimensions is increased.

97 MATHEMATICS AND COMPUTING↗

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗

Effective and exact holographies from symmetries and dualities

The theoretical basis of the phenomenon of effective and exact dimensional reduction, or holographic correspondence, is investigated in a wide variety of physical systems. We first derive general inequalities linking quantum systems of different spatial (or spatio-temporal) dimensionality, thus establishing bounds on arbitrary correlation functions. These bounds enforce an effective dimensional reduction and become most potent in the presence of certain symmetries. Exact dimensional reduction can stem from a duality that (i) follows from properties of the local density of states, and/or (ii) from properties of Hamiltonian-dependent algebras of interactions. Dualities of the first type (i) are illustrated with large-n vector theories whose local density of states may remain invariant under transformations that change the dimension. We argue that a broad class of examples of dimensional reduction may be understood in terms of the functional dependence of observables on the local density of states. Dualities of the second type (ii) are obtained via bond algebras, a recently developed algebraic tool. We apply this technique to systems displaying topological quantum order, and also discuss the implications of dimensional reduction for the storage of quantum information. - Highlights: Black-Right-Pointing-Pointer Study the phenomenon of dimensional reduction from symmetries and dualities. Black-Right-Pointing-Pointer Derive general (dimensional reduction) correlation inequalities. Black-Right-Pointing-Pointer Show that a duality exists whenever the inequalities become equalities. Black-Right-Pointing-Pointer Apply inequalities and bond algebraic techniques to establish topological order in various systems. Black-Right-Pointing-Pointer Show implications of dimensional reduction for the storage of quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamics of cosmic strings with higher-dimensional windings

We consider F-strings with arbitrary configurations in the Minkowski directions of a higher-dimensional spacetime, which also wrap and spin around S{sup 1} subcycles of constant radius in an arbitrary internal manifold, and determine the relation between the higher-dimensional and the effective four-dimensional quantities that govern the string dynamics. We show that, for any such configuration, the motion of the windings in the compact space may render the string effectively tensionless from a four-dimensional perspective, so that it remains static with respect to the large dimensions. Such a critical configuration occurs when (locally) exactly half the square of the string length lies in the large dimensions and half lies in the compact space. The critical solution is then seen to arise as a special case, in which the wavelength of the windings is equal to their circumference. As examples, long straight strings and circular loops are considered in detail, and the solutions to the equations of motion that satisfy the tensionless condition are presented. These solutions are then generalized to planar loops and arbitrary three-dimensional configurations. Under the process of dimensional reduction, in which higher-dimensional motion is equivalent to an effective worldsheet current (giving rise to a conserved charge), this phenomenon may be seen as the analogue of the tensionless condition which arises for superconducting and chiral-current carrying cosmic strings.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗