Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomizer”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
DOE OSTI2026

Experimental quantum Bernoulli factories via Bell-basis measurements

Randomness processing in the Bernoulli factory framework provides a concrete setting in which quantum resources can outperform classical ones. We experimentally demonstrate quantum randomness processing based on Bell-basis measurements of two identical input quoins prepared on IBM superconducting hardware. Using only the measurement outcomes (and no external classical randomness source), we realize the classically inconstructible Bernoulli doubling primitive f(p)=2p, and, as intermediate outputs from the same Bell-measurement statistics, an exact fair coin f(p)=1/2 and the classically inconstructible function f(p)=4p(1−p). We benchmark the measured output biases against ideal predictions and discuss the impact of device noise. Our results establish a simple resource-efficient experimental primitive for quantum-to-classical randomness processing and support the viability of quantum Bernoulli factories for quantum-enhanced stochastic simulation and sampling tasks.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Disorder Enhanced Thermalization in Interacting Many-Particle System

We introduce an extension of the non-equilibrium dynamical mean field theory to incorporate the effects of static random disorder in the dynamics of a many-particle system by integrating out different disorder configurations resulting in an effective time-dependent density-density interaction. We use this method to study the non-equilibrium transient dynamics of a system described by the Fermi Anderson-Hubbard model following an interaction and disorder quench. The method recovers the solution of the disorder-free case for which the system exhibits qualitatively distinct dynamical behaviors in the weak-coupling (prethermalization) and strong-coupling regimes (collapse-and-revival oscillations). However, we find that weak random disorder promotes thermalization. In the weak coupling regime, the jump in the quasiparticle weight in the prethermal regime is suppressed by random disorder while in the strong-coupling regime, random disorder reduces the amplitude of the quasiparticle weight oscillations. These results highlight the importance of disorder in the dynamics of realistic many-particle systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
DOE OSTI2025

Demystifying the Resilience of Large Language Models: An End-to-End Perspective

Deep neural networks are known to be resilient to random bit-wise faults in their parameters. However, this resilience has primarily been established through evaluations of classification models. The extent to which this claim holds for large-language models remains underexplored. In this work, we conduct an extensive measurement study on the impact of random bitwise faults in commercial-scale language models. We perform an in-depth analysis of the resulting generation outputs. We first expose that these language models are not truly resilient to random bit-flips. While aggregate metrics such as accuracy may suggest resilience, an in-depth inspection of the generated outputs shows significant degradation in text quality. Our analysis also shows that tasks requiring more complex reasoning suffer more from performance and quality degradation. Moreover, we extend our analysis to models with augmented reasoning capabilities, such as Chain-of-Thought or Mixture of Experts architectures, and characterize their failure scenarios under random bit-flips.

Sun, Yu↗
DOE OSTI2025

Graph-based design of irregular metamaterials

In the field of metamaterial research, random structures offer a novel and less conventional approach compared to traditional periodic designs. Designing random metamaterials is challenging when it comes to ensuring intercon- nectivity, which is essential for manufacturability. This study introduces an innovative framework for generating random metamaterials using graph al- gorithms, ensuring connectivity and adaptability across various base shapes, including cylinders, triangles, pyramids, and cubes. By employing graph algorithms, our framework enhances the intuitiveness and efficiency of de- sign representation and manipulation, streamlining the design process. The framework generates families of designs that exhibit a wide range of prop- erty magnitudes that can be adjusted intuitively by modifying the input parameters. The rapid design process allows many designs to be generated, offering the user a multitude of solutions around the target property range. The designs can be effectively implemented in various fields and subjected to diverse analytical studies, including static, dynamic, and eigenfrequency assessments. We illustrate computational results for two key properties (stiff- ness and acoustic impedance), showcasing the method’s effectiveness through examples ranging from rod-based to cube-based designs. Here, the framework not only advances metamaterial research but also creates new opportunities for innovation in fields requiring customized material properties.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference↗
DOE OSTI2024

Evaluating disease surveillance strategies for early outbreak detection in contact networks with varying community structure

Disease surveillance systems allow public health agencies to respond to emerging diseases before they become widespread. Developing such systems requires identifying optimal ways to monitor in the context of an epidemic outbreak; this problem is known as sensor selection. Contact networks represent the dynamics of interaction in a population and are used to model how a disease spreads in a population and to explore strategies of sensor selection. We evaluated five sensor selection strategies on their ability to provide an early warning of a COVID-like outbreak in synthetic contact networks encapsulated in four network scenarios. Three of these scenarios assessed different aspects of community structure. The fourth scenario employed a contact network representing the population and interactions of 6.8 million people in New York City, constructed from an agent-based simulation using census and transportation data. This scenario exemplifies how sensor selection strategies may perform in a real-world, urban context. Our findings suggest that the choice of the optimal strategy depends heavily on the community structure of the network. Strategies that select highly connected nodes or maximize network coverage are the optimal surveillance strategy for outbreak detection in many network community structures. However, a naive implementation of these strategies may fail to provide an early warning at all—including in the New York City scenario. Moreover, these methods are impractical for real-world use as they require knowledge of the underlying contact network. Instead, a selection strategy that starts with a set of random nodes and then performs a random walk through a chain of neighbors reliably provides early warnings without requiring prior knowledge of the network. We find this method, called “random chain”, to be the most pragmatic for implementation in a real-world disease surveillance context.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
DOE OSTI2025

Bottlebrush Block Copolymer Thin Films

The self-assembly of block copolymers (BCPs) in thin films is governed by interfacial interactions (enthalpy) between the blocks and interfaces (at both the substrate and the surface). Advantage can also be taken of entropy to control the polymer orientation. Here, we synthesized a series of bottlebrush block copolymers (BBCPs), with deuterated polystyrene (DPS) as the core block and poly­(solketal acrylate) (PSA) as the corona block, where the backbone length (N BB) and grafting densities (GDs) were varied. The hydrophobic PSA block was converted to a hydrophilic poly­(glyceryl acrylate) (PGA) block by solid-state hydrolysis, bringing the BBCP from a disordered state into an ordered state with a lamellar microdomain morphology. The orientation of the morphology as a function of distance from the interfaces was systematically investigated by atomic force microscopy (AFM), interference microscopy, grazing-incidence small-angle X-ray scattering (GISAXS), and grazing-incidence small angle neutron scattering (GISANS). For N BB = 1 (diblock BCP), a mixed lamellar orientation was found. For N BB = 5 (star-like BBCP), a vertical orientation of the lamellar microdomains was found dominantly at the interfaces that propagated into the bulk of the film due to the entropic penalty associated with constraints on the junction points. Increasing the N BB to 50 (rod-like BBCP) and 100 (worm-like BBCP) yielded a random orientation, as the side chains became overcrowded when aligned in the same direction. By reducing the grafting density (GD) of a N BB = 50 BBCP from 100% to 75% and 50% by the incorporation of spacers into the backbone, the steric hindrance of side chains is reduced markedly, facilitating a vertical orientation of the lamellar microdomains. However, the vertical orientation becomes more random within the bulk of the thin film for different BBCP architectures. By modifying the substrate with a layer of PS, the preferential interactions between the core block of the BBCP and the interfaces induce a reconfiguration of the BBCP, drawing the core block out to contact substrate directly driven by enthalpy. Under these conditions, N BB = 5 showed a predominantly parallel orientation of the lamellar microdomains with the corona block minimizing contact with the substrate. Higher N BB values of 50 and 100 showed a more random orientation of the lamellar microdomains at different depths on the PS-modified substrate. Overall, thin-film morphology was regulated by tuning the configuration of the BBCP, varying the entropic contribution to the microdomain orientation.

Chen, Zhan↗
DOE OSTI2024

Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations

Abstract Large‐scale discrete fracture network (DFN) simulators are standard fare for studies involving the sub‐surface transport of particles since direct observation of real world underground fracture networks is generally infeasible. While these simulators have successfully been used in several engineering applications, estimates of output quantities of interest (QoI) — such as breakthrough time of particles reaching the edge of the system — suffer from two distinct types of uncertainty. A run of a DFN simulator requires several parameters to be set that dictate the placement and size of fractures, the density of fractures, and the overall permeability of the system; uncertainty on the proper parameters will lead to uncertainty in the QoI, called epistemic uncertainty. Furthermore, since these input settings to DFN simulators control the stochastic processes which place fractures and govern flow, understanding how this randomness affects the QoI requires several runs of the simulator at distinct random seeds. The uncertainty in the QoI attributed to different realizations (i.e., different seeds) of the same random process (i.e., identical input parameters) leads to a second type of uncertainty, called aleatoric uncertainty. In this paper, we perform a Sensitivity Analysis, which directly attributes the uncertainty observed in the QoI to the epistemic uncertainty from each input parameter and to the aleatoric uncertainty. Beyond the specific takeaways on which input variables influence uncertainty in the QoI the most, a major contribution of this paper is the introduction of a statistically rigorous workflow for characterizing the uncertainty in DFN flow simulations that exhibit heteroskedasticity.

58 GEOSCIENCES↗
DOE OSTI2025

How Representative Are Uncrewed Aircraft System Measurements of the Convective Boundary Layer?

Abstract Uncrewed aircraft systems (UAS) demonstrate significant potential for filling data gaps in the atmospheric boundary layer. However, the extent to which UAS observations—typically vertical profiles taken over 15 min—are representative of the boundary layer as a whole remains poorly characterized. Using large eddy simulations (LES) of the daytime convective boundary layer (CBL), we quantify random errors in UAS measurements that occur due to insufficient statistical convergence of the time average to the true ensemble mean. Random errors in first‐order moments increase as the CBL becomes increasingly unstable, and are largest near the surface for most quantities. Errors are on the order of 2–6 m for wind speed, 15–60 for wind direction, 0.2–3 K for potential temperature, and 0.1–1 g for specific humidity, with errors in turbulent fluxes on the order of 50%–100%. Sampling strategies that mitigate random errors are discussed in light of our results.

Greene, Brian R. [Now at Verisk Extreme Event Solu↗
DOE OSTI2024

Direct numerical simulation of open-channel flow over a heterogeneous particle bed at low relative submergence

In this article, this study investigates turbulent open-channel flows over beds of irregularly arranged particles, using direct numerical simulations at a friction Reynolds number of Re T = 300⁠. Two distinct cases are examined: a polydisperse bed (P800) composed of multiple layers of randomly distributed spheres of varying sizes, and a monodisperse bed (M1015) formed by a random distribution of uniform sized spheres, with a bottommost single layer of varied-sized particles to introduce realistic randomness. Our investigation unveils a rich network of low- and high-speed streaks within the flow field, exhibiting distinctive behaviors in different bed configurations. The P800 case presents a poorly organized flow pattern induced by the varied particle sizes and arrangements, while the M1015 case shows a more regular flow pattern, marked by larger streaks. We also observe that total wall shear stress is substantially influenced by surface roughness-induced drag, extending beyond the effects documented in existing studies of open-channel flows. The present study reveals intricate secondary flow patterns over irregular particle beds. Large-scale circulations are discerned around particle crests in the P800 case and localized circulations with increased turbulence in the M1015 case. Furthermore, analysis of Reynolds stress tensor components indicates that roughness disrupts coherent turbulent eddies, consequently mitigating peak stress. We quantify correlations between drag force and local fluid velocity fluctuations. Notably, a larger deviation in drag is observed in the P800 case compared to M1015, accentuating the influence of particle size and distribution on fluid–particle interactions.

42 ENGINEERING↗
DOE OSTI2024

Inertia-induced mixing and reaction maximization in laminar porous media flows

Solute transport and biogeochemical reactions in porous and fractured media flows are controlled by mixing, as are subsurface engineering operations such as contaminant remediation, geothermal energy production, and carbon sequestration. Porous media flows are generally regarded as slow, so the effects of fluid inertia on mixing and reaction are typically ignored. Here, we demonstrate through microfluidic experiments and numerical simulations of mixing-induced reaction that inertial recirculating flows readily emerge in laminar porous media flows and dramatically alter mixing and reaction dynamics. An optimal Reynolds number that maximizes the reaction rate is observed for individual pore throats of different sizes. This reaction maximization is attributed to the effects of recirculation flows on reactant availability, mixing, and reaction completion, which depend on the topology of recirculation relative to the boundary of the reactants or mixing interface. Recirculation enhances mixing and reactant availability, but a further increase in flow velocity reduces the residence time in recirculation, leading to a decrease in reaction rate. The reaction maximization is also confirmed in a flow channel with grain inclusions and randomized porous media. Interestingly, the domain-wide reaction rate shows a dramatic increase with increasing Re in the randomized porous media case. This is because fluid inertia induces complex three-dimensional flows in randomized porous media, which significantly increases transverse spreading and mixing. This study shows how inertial flows control reaction dynamics at the pore scale and beyond, thus having major implications for a wide range of environmental systems.

Chen, Michael A. (ORCID:0000000294614710)↗
DOE OSTI2025

The construction of large-scale structure catalogs for the Dark Energy Spectroscopic Instrument

We present the technical details on how large-scale structure (LSS) catalogs are constructed from redshifts measured from spectra observed by the Dark Energy Spectroscopic Instrument (DESI). The LSS catalogs provide the information needed to determine the relative number density of DESI tracers as a function of redshift and celestial coordinates and, e.g., determine clustering statistics. We produce catalogs that are weighted subsamples of the observed data, each matched to a weighted `random' catalog that forms an unclustered sampling of the probability density that DESI could have observed those data at each location. Precise knowledge of the DESI observing history and associated hardware performance allows for a determination of the DESI footprint and the number of times DESI has covered it at sub-arcsecond level precision. This enables the completeness of any DESI sample to be modeled at this same resolution. The pipeline developed to create LSS catalogs has been designed to easily allow robustness tests and enable future improvements. We describe how it allows ongoing work improving the match between galaxy and random catalogs, such as including further information when assigning redshifts to randoms, accounting for fluctuations in target density, accounting for variation in the redshift success rate, and accommodating blinding schemes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Selection of high-redshift Lyman-Break Galaxies from broadband and wide photometric surveys

Here, in this paper, we investigate the possibility of selecting high-redshift Lyman-Break Galaxies (LBG) using current and future broadband wide photometric surveys, such as the Ultraviolet Near Infrared Optical Northern Survey (UNIONS) or the Vera C. Rubin Legacy Survey of Space and Time (LSST), using a Random Forest algorithm. This work is conducted in the context of future large-scale structure spectroscopic surveys like DESI-II, the next phase of the Dark Energy Spectroscopic Instrument (DESI), which will start around 2029. We use deep imaging data from the Hyper Suprime Camera (HSC) and the Canada-France-Hawaii Telescope Large Area U-band Deep Survey (CLAUDS) on the COSMOS and XMM-LSS fields. To predict the selection performance of LBGs with image quality similar to UNIONS, we degrade the u,g,r,i and z bands to UNIONS depth. The Random Forest algorithm is trained with the u,g,r,i and z bands to classify LBGs in the 2.5 < z < 3.5 range. We find that fixing a target density budget of 1,100 deg -2 , the Random Forest approach gives a density of z > 2 targets of 873 deg -2 , and a density of 493 deg -2 of confirmed LBGs after spectroscopic confirmation with DESI. This UNIONS-like selection was tested in a dedicated spectroscopic observation campaign of 1,000 targets with DESI on the COSMOS field, providing a safe spectroscopic sample with a mean redshift of 3. This sample is used to derive forecasts for DESI-II, assuming a sky coverage of 5,000 deg 2 . We predict uncertainties on Alcock-Paczynski parameters α ⊥ and α ∥ to be 0.7% and 1% for 2.6 < z < 3.2, resulting in a potential 2% measurement of the dark energy fraction at high redshift. Additionally, we estimate the uncertainty in local non-Gaussianity and predict σ fNL ≈ 7, which would be comparable to the current best precision achieved by Planck. The latter forecast suggests that achieving the precision required to place stringent constraints on inflationary models (σ fNL ≈ 1) using spectroscopic galaxy surveys necessitates the development of a next-generation (Stage V) spectroscopic survey.

cosmological parameters from LSS↗
DOE OSTI2026

Diagonal state designs with reconfigurable real-time circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗