Search NASA⌕ Search

SEARCH · Search NASA

Results for “noisy optimization”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

A stopping theoretic approach to minimal time detection of system parameter change

The problem of minimal time detection of abrupt parameter changes in linear stochastic systems considered. The problem is posed as an optimal stopping problem for the detection in change of the induced probability measure. Under the assumption of a prior distribution for the time of change (or disruption) a stopping rule is given which minimizes the average detection delay when there is knowledge of the new measure after the change. When the new induced measure is unknown, a stopping rule is given, based only on the noisy observations and is shown to be better than the a priori knowlege of the disruption time.

Mazumdar, Ravi R.↗
DOE OSTI2020

DeepGrid: Robust Deep Reinforcement Learning-based Contingency Management

Increasing uncertainty raised by the integration of renewable energy resources requires an enormous number of simulations to be carried out for the security assessment of the power grid. However, it is challenging to assess the steady-state and dynamic security indices for different system contingency events by doing an exhaustive analysis in real-time due to the computational and communication constraints. One promising solution is using data-driven techniques along with the system models to train an intelligent contingency management framework to better handle the contingencies in real-time. Nevertheless, implementing a data-driven technique to obtain the best remedial actions necessitates to account for the effect of the measurement noise on the performance of the contingency management. To tackle these challenges, we leverage a robust deep reinforcement learning (DRL) algorithm called Double Deep Q-Network (DDQN) to design a recommender system capable of prescribing optimal control actions with the help of the real-time digital simulator (RTDS). The use of RTDS system in combination with the advanced DRL algorithm allows to explore a wide variety of system contingencies in order to derive better remedial actions. The performance of the proposed algorithm is evaluated in IEEE 9-bus system under different loading conditions, and different network configurations in presence of noisy measurements.

Ghasemkhani, Amir↗
DOE OSTI2023

NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training

This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.

Lu, Binghang (ORCID:0009000160016632)↗
NASA NTRS2022

A New Organization Metric for Synoptic Scale Tropical Convective Aggregation

Organization metrics were originally developed to measure how densely convective clouds are arranged at mesoscales. In this work, we apply organization metrics to describe tropical synoptic scale convective activity. Such activity is identified by cloud-precipitation (hybrid) regimes defined at 1-degree and 1-hourly resolution. Existing metrics were found to perform inadequately for such convective regime aggregates because the large domain size and co-existence of sparse aggregate occurrences with noisy isolated convection often violate assumptions inherent in these metrics. In order to capture these characteristics, in this study the existing “convective organization potential” (COP) metric was modified so as to focus on local organization and provide increased weight to aggregate size. The resulting “area-based COP” (ABCOP) follows the principle that the more numerous the objects, the higher the chance of organization. It is thus optimized to capture large-scale convective events occurring during phenomena such as ENSO and MJO, while also performs as well as existing metrics for small domain sizes.

Synoptic scales↗
DOE OSTI2024

Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms

The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost .

Tomesh, Teague↗
DOE OSTI2021

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Realizable optimal control for a remotely piloted research vehicle

The design of a control system using the linear-quadratic regulator (LQR) control law theory for time invariant systems in conjunction with an incremental gradient procedure is presented. The incremental gradient technique reduces the full-state feedback controller design, generated by the LQR algorithm, to a realizable design. With a realizable controller, the feedback gains are based only on the available system outputs instead of being based on the full-state outputs. The design is for a remotely piloted research vehicle (RPRV) stability augmentation system. The design includes methods for accounting for noisy measurements, discrete controls with zero-order-hold outputs, and computational delay errors. Results from simulation studies of the response of the RPRV to a step in the elevator and frequency analysis techniques are included to illustrate these abnormalities and their influence on the controller design.

Dunn, H. J.↗
DOE OSTI2018

Systematic Layout Planning of a Radiology Reporting Area to Optimize Radiologists’ Performance

Optimizing radiologists’ performance is a major priority for managers of health services/systems, since the radiologists’ reporting activity imposes a severe constraint on radiology productivity. Despite that, methods to optimize radiologists’ reporting workplace layout are scarce in the literature. This study was performed in the Radiology Division (RD) of an 850-bed University-based general hospital. The analysis of the reporting workplace layout was carried out using the systematic layout planning (SLP) method, in association with cluster analysis as a complementary tool in early stages of SLP. Radiologists, architects, and hospital managers were the stakeholders consulted for the completion of different stages of the layout planning process. A step-by-step description of the proposed methodology to plan an RD reporting layout is presented. Clusters of radiologists were defined using types of exams reported and their frequency of occurrence as clustering variables. Sectors with high degree of interaction were placed in proximity in the new RD layout, with separation of noisy and quiet areas. Four reporting cells were positioned in the quiet area, grouping radiologists by subspecialty, as follows: cluster 1-abdomen; cluster 2-musculoskeletal; cluster 3-neurological, vascular and head & neck; cluster 4-thoracic and cardiac. The creation of reporting cells has the potential to limit unplanned interruptions and enhance the exchange of knowledge and information within cells, joining radiologists with the same expertise. That should lead to improvements in productivity, allowing managers to more easily monitor radiologists’ performance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2025

Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation

As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimization performance, fidelity, and cost: SIAM VQE

This dataset contains files storing results from classically-simulated quantum subroutines within a dynamical mean-field theory workflow, and jupyter notebooks processing the data in these files to generate plots. The files store: (1) Results from variational quantum eigensolver (VQE) simulations searching for optimal parameters allowing parametrized quantum circuits to prepare approximations to ground states of different Anderson impurity models (AIMs) (2) Results from simulations of a quantum Lanczos algorithm (QLA) estimating the Lanczos coefficients defining the continued-fraction representation of an (AIM) Green’s function Description: Any file named vqe_gs_results* stores approximations to the ground state and energy of a given AIM estimated using three different methods: (1) Numerical diagonalization (2) Ideal VQE simulation (3) VQE simulation with sampling noise For each VQE simulations metadata about the optimization (optimization results plus number of quantum circuits that would have been executed on real hardware) is also stored. Any file named qla_dos_results* estimations for the Lanczos coefficients defining the Green’s function of an AIM. The stored estimations are achieved using different methods: (1) Numerical Lanczos algorithm from initial states obtained from numerical diagonalization (2) Simulated quantum Lanczos algorithm from initial states prepared from parametrized quantum circuits yielded by corresponding ideal and noisy VQE subroutines. The dataset is used and described in M. Karabin et al., "Quantum solver for single-impurity Anderson models with particle-hole symmetry", Phys. Rev. Research 8, 033066 (2026). DOI: https://doi.org/10.1103/7ys3-tl4l

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

The learnability of Pauli noise

Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today’s quantum devices. A fundamental issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question what information is learnable and what is not, which is unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates using graph theoretical tools. Our results reveal the optimality of cycle benchmarking in the sense that it can extract all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM’s CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we show that an attempt to extract unlearnable information by ignoring state preparation noise yields unphysical estimates, which is used to lower bound the state preparation noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Non-iterative characteristics analysis for high-pressure ramp loading

Here in the canonical ramp compression experiment, a smoothly increasing load is applied to the surface of the sample, and the particle velocity history is measured at two or more different distances into the sample, at interfaces where the surface of the sample can be probed. The velocity histories are used to deduce a stress-density relation, usually using iterative Lagrangian analysis to account for the perturbing effect of the impedance mismatch at the interface. In that technique, a stress-density relation is assumed in order to correct for the perturbation and is adjusted until it becomes consistent with the deduced stress-density relation. This process is subject to the usual difficulties of nonlinear optimization, such as the existence of local minima (sensitivity to the initial guess), possible failure to converge, and relatively large computational effort. We show that, by considering the interaction of successive characteristics reaching a free surface, the stress-density relation can be deduced directly by recursion rather than iteration. This calculation is orders of magnitude faster than iterative analysis and does not require an initial guess. Direct recursion may be less suitable for very noisy data, but it was robust when applied to trial data. The stress-density relation deduced was identical to the result from iterative Lagrangian analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on a prepared quantum telecloning state. Quantum telecloning can be implemented as a circuit on quantum computers using a classical coprocessor to compute classical feedforward instructions using if statements based on the results of a midcircuit Bell measurement in real time. We present universal symmetric optimal 1 → M telecloning circuits and experimentally demonstrate these quantum telecloning circuits for M = 2 up to M = 10, natively executed with real-time classical control systems on IBM Quantum superconducting processors, known as dynamic circuits. We perform the cloning procedure on many different message states across the Bloch sphere, on seven IBM Quantum processors, optionally using the error suppression technique X–X sequence digital dynamical decoupling. Two circuit optimizations are utilized: one that removes ancilla qubits for M = 2,3 , and one that reduces the total number of gates in the circuit but still uses ancilla qubits. Parallel single-qubit tomography with maximum likelihood estimation density matrix reconstruction is used in order to compute the mixed-state density matrices of the clone qubits, and clone quality is measured using quantum fidelity. These results present one of the largest and most comprehensive noisy intermediate-scale quantum computer experimental analyses on (single qubit) quantum telecloning to date. The clone fidelity sharply decreases to 0.5 for M > 5 , but for M = 2 , we are able to achieve a mean clone fidelity of up to 0.79 using dynamical decoupling.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

NISQ algorithm for the matrix elements of a generic observable

The calculation of off-diagonal matrix elements has various applications in fields such as nuclear physics and quantum chemistry. In this paper, we present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian without explicitly preparing its eigenstates. By means of numerical simulations we show that this approach finds many of the matrix elements for the one and two qubits cases. Specifically, while in the first case, one can initialize the ansatz parameters over a broad interval, in the latter the optimization landscape can significantly slow down the speed of convergence and one should therefore be careful to restrict the initialization to a smaller range of parameters.

Physics↗
DOE OSTI2022

Calibration and Commissioning of the LSST

Understanding the nature of dark energy and dark matter remains one of the fundamental questions in physics today; impacting our understanding of particle physics, cosmology, and possibly theories of gravity. Given the scale and complexity of the next generation of cosmology experiments (e.g., the Rubin Observatory, the Euclid satellite mission, and the Roman space telescope) we are entering an era where statistical noise no longer determines the accuracy to which we can measure cosmological parameters. Our ability to control and correct for systematics will ultimately determine the scientific impact of these experiments. This award addressed the challenge of how we determine what limits the accuracy of our cosmological measures, what techniques are appropriate for measuring and calibrating the properties of galaxies to best constrain cosmological models, how to develop statistical techniques that are insensitive to systematic errors, and how to optimize survey strategies in order to minimize systematics while maximizing the speed at which an experiment can achieve its science objectives. In this final technical report for award DE-SC0011635 we describe a set of open-source frameworks that simulate the characteristics and properties of current and planned cosmology surveys and the application of these frameworks to the development of new methodologies for estimating the properties and distances to galaxies that are robust to noisy and incomplete data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

A case study of denoising microseismic data in the Farnsworth, TX CO 2 EOR site

As geologic carbon sequestration projects begin to be funded with a higher degree of frequency, microseismic monitoring will become more necessary to establish caprock integrity and induced seismicity risk. The Farnsworth, TX site, which hosts enhanced oil recovery operations, provides an ideal laboratory to test essential components of microseismic monitoring such as surface station placement, denoising, and different autopicker methods. We find that despite careful optimization, the surface station placement at the Farnsworth site was insufficient given the high level of background noise from the industrial operations at the oil field. Thus, we use only borehole geophone data in our processing. Two denoising techniques were examined: the DeepDenoiser and the continuous wavelet transform. The continuous wavelet transform was shown to be a valuable tool in converting between raw waveforms to processed denoised waveforms for microseismic monitoring. In the case of the noisy waveforms, only ten detections are found, compared with 90 in the denoised data for a two-hour window. The DeepDenoiser suffered from the fact that the training data was regional earthquake data. In addition, the PhaseNet machine-learning autopicker was applied to both the noisy and the denoised data, and this algorithm detected thousands of more arrivals in the data denoised with the continuous wavelet transform technique.

58 GEOSCIENCES↗
DOE OSTI2017

Enhancement of flow measurements using fluid-dynamic constraints

Novel experimental modalities acquire spatially resolved velocity measurements for steady state and transient flows which are of interest for engineering and biological applications. One of the drawbacks of such high resolution velocity data is their susceptibility to measurement errors. In this paper, we propose a novel filtering strategy that allows enhancement of the noisy measurements to obtain reconstruction of smooth divergence free velocity and corresponding pressure fields which together approximately comply to a prescribed flow model. The main step in our approach consists of the appropriate use of the velocity measurements in the design of a linearized flow model which can be shown to be well-posed and consistent with the true velocity and pressure fields up to measurement and modeling errors. The reconstruction procedure is then formulated as an optimal control problem for this linearized flow model. The resulting filter has analyzable smoothing and approximation properties. We briefly discuss the discretization of the approach by finite element methods and comment on the efficient solution by iterative methods. The capability of the proposed filter to significantly reduce data noise is demonstrated by numerical tests including the application to experimental data. In addition, we compare with other methods like smoothing and solenoidal filtering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗