SEARCH · Engineering Papers

Results for “random matrix theory”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

25 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Triangle Method for Dense ReLU Layers [SWR-25-72]

This software is an implementation of the methods for initializing and training neural networks to be more efficient per parameter, described more fully below and in the related publication: In theory, depth should make a ReLU network EXPONENTIALLY more efficient by enabling it to produce an exponential number of piecewise linear sections in its output. This reasoning is largely based on the work of mathematicians that have hand-constructed networks that make good use of depth. In practice however, even very deep ReLU networks that have been randomly initialized will behave identically to their shallow counterparts - missing an entire exponential dimension of efficiency. The triangle method is a first attempt at realizing the exponential potential of deep networks. Instead of randomly setting weights, we force pairs of neurons in each layer learn to build triangles (i.e. functions from [0,1] -> [0,1] that look like triangles). This is a very efficient pattern for generating lots of linear pieces because composing two triangular functions doubles the number of pieces with each composition. The triangle method is more than just a different initialization, it is a new paradigm of training. Instead of making direct updates to the matrix weights, we do an extra step of backpropagation to collect the derivatives of the loss function with respect to the shapes of the triangles, training them to tilt left or right. This process essentially holds the networks hand throughout the loss landscape and forces it to always use depth effectively by producing triangular shapes internally. This can produce several orders of magnitude of improvement on convex one-dimensional regression problems. Much more theoretical work is needed to realize its full potential beyond this context, but the implementation in this repository will still work in arbitrary numbers of dimensions. The file Triangle_Method.py is a generalized form of the method that will build each neuron its own custom 1-d convex activation function (with exponential efficiency). Example usage on one dimensional problems can be found in Example_Usage.ipynb and an example of using this in a real neural network can be found in Example_VGG16_CIFAR10.ipynb.

Milkert, Max [National Renewable Energy Laboratory↗

DOE OSTI2025

Information theory optimization of signals from small-angle scattering measurements

Small-angle X-ray scattering (SAXS) of particles in solution informs on the conformational states and assemblies of biological macromolecules (bioSAXS) outside of cryo- and solid-state conditions. In bioSAXS, the SAXS measurement under dilute conditions is resolution limited, and through an inverse Fourier transform, the measured SAXS intensities directly relate to the physical space occupied by the particles via the P (r)-distribution. Yet, this inverse transform of SAXS data has been historically cast as an ill-posed, ill-conditioned problem requiring an indirect approach. Here, we show that through the applications of matrix and information theories, the inverse transform of SAXS intensity data is a well-conditioned problem. The so-called ill-conditioning of the inverse problem is directly related to the Shannon number. By exploiting the oversampling enabled by modern detectors, a direct inverse Fourier transform of the SAXS data is possible, provided the recovered information does not exceed the Shannon number. The Shannon limit corresponds to the maximum number of significant singular values that can be recovered in a SAXS experiment, suggesting this relationship is a fundamental property of band-limited inverse integral transform problems. This correspondence reduces the complexity of the inverse problem to the Shannon limit and maximum dimension. We propose a hybrid scoring function using an information theory framework that assesses both the quality of the model-data fit as well as the quality of the recovered P (r)-distribution. The hybrid score utilizes the Akaike information criteria and Durbin-Watson statistic that considers parameter-model complexity, i.e., degrees of freedom, and the randomness of the model-data residuals. The described tests and findings extend the boundaries for bioSAXS by completing the information theory formalism initiated by Peter B. Moore to enable a quantitative measure of resolution in SAXS, robustly determine maximum dimension, and more precisely define the best parameter model appropriately representing the observed scattering data.

Rambo, Robert P. [Science and Technology Facilitie↗

DOE OSTI2025

Open-closed 3d gravity as a random ensemble

We investigate an ensemble of boundary CFTs within the framework of a tensor model recently constructed to model 3d quantum gravity. The incorporation of CFT borders introduces new elements to the gravity theory. In particular, it leads to an open-closed extension of Virasoro TQFT, which in the classical limit gives rise to 3d gravity with tensionful end-of-the-world branes. It also provides predictions for off-shell manifolds with bordered asymptotic boundaries, such as the annulus wormhole. As an application, we construct a purely open variant of the tensor model to study a purely open bootstrap problem in the context of CFT triangulation. We also briefly discuss the extension to non-orientable CFTs.

AdS-CFT correspondence↗

DOE OSTI2026

Coherence-Induced Deep Thermalization Transition in Random Permutation Quantum Dynamics

We report a phase transition in the projected ensemble—the collection of postmeasurement wave functions of a local subsystem obtained by measuring its complement. The transition emerges in systems undergoing random permutation dynamics, a type of quantum time evolution wherein computational basis states are shuffled without creating superpositions. It separates a phase exhibiting deep thermalization, where the projected ensemble is distributed over Hilbert space in a maximally entropic fashion (Haar random), from a phase where it is minimally entropic (“classical bit-string ensemble”). Crucially, this deep thermalization transition is invisible to the subsystem’s density matrix, which always exhibits thermalization to infinite temperature across the phase diagram. Through a combination of analytical arguments and numerical simulations, we show that the transition is tuned by the total amount of injected by the input state and the measurement basis, and is exhibited robustly across different microscopic models. Our findings represent a novel form of ergodicity-breaking universality in quantum many-body dynamics, characterized not by a failure of regular thermalization, but rather by a failure of deep thermalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

A Black Hole Airy Tail

In Jackiw-Teitelboim (JT) gravity, which is dual to a random matrix ensemble, the annealed entropy differs from the quenched entropy at low temperatures and goes negative. However, computing the quenched entropy in JT gravity requires a replica limit that is poorly understood. To circumvent this, we define an intermediate quantity called the semi-quenched entropy, which has the positivity properties of the quenched entropy, while requiring a much simpler replica trick. We compute this in JT gravity in different regimes using i) a bulk calculation involving wormholes corresponding to the Airy limit of the dual matrix integral and ii) a boundary calculation involving one-eigenvalue instanton saddles proposed by Hernández-Cuenca, demonstrating consistency between these two calculations in their common regime of validity. We also clarify why similar one-eigenvalue instanton saddles cannot be used to compute the quenched entropy due to a breakdown of the saddle-point approximation for the one-eigenvalue instanton in the replica limit. Our results show how to use the gravitational path integral to prove that black holes in JT gravity have isolated ground states and to study their properties.

FOS: Physical sciences↗

DOE OSTI2025

Mind the crosscap: $τ$-scaling in non-orientable gravity and time-reversal-invariant systems

Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic CFTs, this is mirrored by the presence of non-orientable geometries in the dual gravitational path integral. In this work, we analyze general properties of these matrix models and their gravitational counterparts. First, we develop a formalism to express the universal level statistics in the canonical ensemble for arbitrary spectral curves, leading to a topological expansion with finite radius of convergence in the late-time $τ$-scaling limit. Then, we focus on topological gravity and study topological recursion on the moduli space of non-orientable surfaces. We find that the Weil-Petersson volumes display non-analytic behaviour multiplying polynomials in the boundary lengths. The volumes give rise to wormholes with late-time divergences, in contrast with the orientable case, which is finite. We identify systematic cancellations among WP volumes implied by the consistency and finiteness of the $τ$-scaling limit. In particular, the cancellation of late-time divergences requires a nontrivial genus resummation. Working in the gravitational microcanonical ensemble, we derive and resum all orders of the topological expansion matching the GOE matrix model in the high-energy regime.

Chaotic Dynamics (nlin.CD)↗

DOE OSTI2026

Spectral Properties and Coding Transitions of Haar-Random Quantum Codes

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical information is encoded in a random subspace of the physical Hilbert space. We focus on the spectrum of the encoded system density matrix as a function of the rate of uncorrelated, single-qudit errors. For low error rates, this spectrum consists of well-separated bands, representing errors of different weights. As the error rate increases, the bands for high-weight errors merge. The evolution of these bands with increasing error rate is well described by a simple analytic ansatz. Using this ansatz, as well as an explicit calculation, we show that the threshold for Haar-random quantum codes saturates the hashing bound, and thus coincides with that for random stabilizer codes. For error rates that exceed the hashing bound, typical errors are uncorrectable, but postselected error correction remains possible until a much higher detection threshold. Postselection can in principle be implemented by projecting onto subspaces corresponding to low-weight errors, which remain correctable past the hashing bound.

decoherence↗