Search NASA⌕ Search

SEARCH · Search NASA

Results for “variational 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 541 records · Page 30

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗

Glueballs at finite temperature in SU(3) Yang-Mills theory

Thermal properties of glueballs in SU(3) Yang-Mills theory are investigated in a large temperature range from 0.3T{sub c} to 1.9T{sub c} on anisotropic lattices. The glueball operators are optimized for the projection of the ground states by the variational method with a smearing scheme. Their thermal correlators are calculated in all 20 symmetry channels. It is found in all channels that the pole masses M{sub G} of glueballs remain almost constant when the temperature is approaching the critical temperature T{sub c} from below, and start to reduce gradually with the temperature going above T{sub c}. The correlators in the 0{sup ++}, 0{sup -+}, and 2{sup ++} channels are also analyzed based on the Breit-Wigner Ansatz by assuming a thermal width {gamma} to the pole mass {omega}{sub 0} of each thermal glueball ground state. While the values of {omega}{sub 0} are insensitive to T in the whole temperature range, the thermal widths {gamma} exhibit distinct behaviors at temperatures below and above T{sub c}. The widths are very small (approximately a few percent of {omega}{sub 0} or even smaller) when T<T{sub c}, but grow abruptly when T>T{sub c} and reach values of roughly {gamma}{approx}{omega}{sub 0}/2 at T{approx_equal}1.9T{sub c}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Secondary Voltage Control Via Demand-Side Energy Storage with Temporal Logic Specifications

This paper proposes a secondary voltage control method that can handle the temporal logic specifications (TLSs). The control objective is to schedule a control signal for energy storage system (ESS) such that the voltage variation of a defined critical bus satisfies TLSs. The TLS allows definitions of set and timing constraints at the same time, such as a finite-time restoration. A simplified analytical model is derived to describe the voltage variation of critical buses. Based on this model, a numerical optimal control problem is formulated as a mixed integer linear program to generate the proper control input for the ESS. The proposed control is verified on a lumped distribution system model. With this control diagram, supportive controllers can be easily designed to make voltage behaviors comply with grid codes and avoid unnecessary relay actions.

Zhang, Yichen↗

Global Sensitivity Analysis of Large Distribution System with PVs using Deep Gaussian Process

Global sensitivity analysis (GSA) of the voltage to uncertain power injection variations plays an important role for appropriate Volt-VAR optimization. This paper proposes a data-driven GSA method for large-scale distribution systems with a large number of uncertain sources. Specifically, the deep Gaussian process is used to identify the mapping relationship between uncertain power injections and voltages. This allows us to resort to the analysis of variance framework to calculate the Sobol indices for GSA. Unlike the existing polynomial chaos expansion and Gaussian process-based approaches, our proposed method has much better scalability. Test results on the EPRI 1747-node K1 circuit with a different number and different probability distributions of uncertain sources demonstrate that the proposed method can achieve accurate GSA under various conditions.

14 SOLAR ENERGY↗

SU-E-T-532: Validation and Implementation of Model-Based Patient Specific Quality Assurance Using Mobius3D and MobiusFX in a Clinical Setting

Purpose: This work carries out the commissioning and validation of the Mobius3D and MobiusFX software tools, which can replace the time-consuming measurement-based patient specific quality assurance (PSQA). Methods: The beam model supplied by Mobius3D was validated against a 21EX linac's beam measured data. Complex patient (VMAT) plans using Eclipse treatment planning system (TPS) was used to test the consistency between Mobius3D (calculates dose using patient image and field data) and MobiusFx (calculates dose using treatment dynalog files). Dose difference and gamma analysis (3%/3mm) between Mobius3D and MobiusFx were used to assess treatment plan and treatment delivery consistency. An end-to-end test was performed to validate Mobius3D and MobiusFx against ion chamber measurements. Effect of the dosimetric leaf gap (DLG) on Mobius3D dose calculation was additionally investigated. Results: Mobius3D beam model parameters matched within 1%-3% with our beam measured data. A comparison of Mobius3D and MobiusFx dose matrices for VMAT planned prostate cases showed (0.33±0.07)% mean dose difference with gamma values above 95%. The end-to-end test showed dose differences of 1% between Mobius3D and MobiusFx. Dependence of Mobius3D dose calculation upon DLG was explored by introducing a ±0.5 mm change in the default value for DLG. This change resulted in agreement differences above 2% Conclusion: Use of reference beam data would appear to speed up commissioning process for the clinical implementation of Mobius3D. However, careful consideration is required when comparing the information provided by the software, since large dose variations can be seen when the proper parameters are not optimized. The plan and delivered dose were in good agreement; hence MobiusFx has the potential to significantly speed up the PSQA process and at the same time helps to verify treatment parameters that are not possible with measurement-based PSQA.

60 APPLIED LIFE SCIENCES↗

EQC: Ensembled Quantum Computing for Variational Quantum Algorithms

Variational quantum algorithms (VQA), which are comprised of a classical optimizer and a parameterized quantum circuit, emerges as one of the most promising approaches of harvesting quantum power in the noisy-intermediate-scale-quantum (NISQ) era. However, the deployment of VQAs on today's NISQ devices often faces considerable system noise and prohibitively slow training speeds. On the other hand, the expensive supporting sources and infrastructure make quantum computers extremely keen on high utilization. In this paper, we propose a novel way of thinking about a quantum backend: rather than relying on one physical device which tends to introduce platform-specific noise and bias, a quantum ensemble, which distributes quantum tasks across parallel devices, can serve as a virtualized quantum computer for offering reduced noise levels through an adaptive mixture and also provide significantly improved training speeds through parallelization. With this idea, we build a distributive VQA optimization framework called DVQA, serving as the first effort in adopting parallel quantum devices for cooperative VQA training. To further constraint noise and speed-up convergence, we design a model for individual NISQ devices concerning their properties and running conditions, and propose a weighting mechanism for regularizing the returned gradients. Extensive evaluations on 10 IBM-Q quantum devices using the VQE example show that the distributive VQA training framework can substantially boost the training speed by 10.5x on average (up to 86x and at least 5.2x) with improved training accuracy.

Stein, Samuel A.↗

Performance and Efficiency of Biomass Densification Equipment (CRADA Final Report)

In 2008, a CRADA between the INL and Vermeer was signed and work began between the two parties to look at improvements in grinding processes for agricultural crop residues. Preprocessing is a critical operation in the biomass feedstock assembly system of a lignocellulosic biorefinery. Preprocessing is typically accomplished using industrial grinders to grind, chop, or otherwise size-reduce biomass materials into a suitable feedstock for conversion to biofuels and bioproducts. Various components of commercial preprocessing equipment capable of handling large-format material (such as large square bales) can be modified or altered to change the overall productivity and efficiency of the process. Many factors affect machine capacity and efficiency and the physical characteristics of preprocessed biomass. Ultimately, grinder capacity and efficiency can be enhanced by selecting hammer and screen configurations that optimize grinder performance-based mass flow and energy consumption. Variations in grinder capacity and efficiency were evaluated by altering the type, number, and orientation of the hammer; the screen type and size; and the rotational drum speed of the grinder. Fuel use and grinder capacity were compared with each modification made to the grinder system and the original design of the horizontal grinder test platform. Modifications evaluated in this study resulted in a significant increase in grinder capacity and efficiency.

09 BIOMASS FUELS↗

Neutrino Oscillation Parameter Sensitivity in Future Long-Baseline Experiments

The study of neutrino interactions and propagation has produced evidence for physics beyond the standard model and promises to continue to shed light on rare phenomena. Since the discovery of neutrino oscillations in the late 1990s there have been rapid advances in establishing the three flavor paradigm of neutrino oscillations. The 2012 discovery of a large value for the last unmeasured missing angle has opened the way for future experiments to search for charge-parity symmetry violation in the lepton sector. This thesis presents an analysis of the future sensitivity to neutrino oscillations in the three flavor paradigm for the T2K, NO A, LBNE, and T2HK experiments. The theory of the three flavor paradigm is explained and the methods to use these theoretical predictions to design long baseline neutrino experiments are described. The sensitivity to the oscillation parameters for each experiment is presented with a particular focus on the search for CP violation and the measurement of the neutrino mass hierarchy. The variations of these sensitivities with statistical considerations and experimental design optimizations taken into account are explored. The effects of systematic uncertainties in the neutrino flux, interaction, and detection predictions are also considered by incorporating more advanced simulations inputs from the LBNE experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum Machine Learning with SQUID

In this work we present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. The classical infrastructure is based on PyTorch and we provide a standardized design to implement a variety of quantum models with the capability of back-propagation for efficient training. We present the structure of our framework and provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset. In particular, we highlight the implications for scalability for gradient-based optimization of quantum models on the choice of output for variational quantum models.

97 MATHEMATICS AND COMPUTING↗

Studies toward a Candidate IDS Neutrino Factory Front-End Configuration

A front end scenario for the IDS neutrino factory is presented. The scenario is based on the Study 2A example for capture, bunching and phase-energy rotation of muons from a proton source for a neutrino factory, and the goal is the capture of a maximal number of muons in a string of 201.25 MHz rf bunches. We present a candidate release scenario that is somewhat shorter than the Study 2A example and its parameters are optimized for smaller magnetic fields and gradients. We consider the variation of performance with achievable gradient, obtaining acceptable capture with reduced gradients. We also consider variation in production target performance, and develop the specifications toward the practical requirements of the cost study.

43 PARTICLE ACCELERATORS↗

Adaptive Discovery and Mixed-Variable Optimization of Next Generation Synthesizable Microelectronic Materials

Design of new microelectronic materials is characterized by several challenges such as high-dimensionality of the atomic structure-composition variable space, formidable cost of directly using high-fidelity simulations for design optimization, dispersity in literature-reported similar materials and synthesis methods, complex physical mechanisms, and mixed qualitative and quantitative design variables that lead to a disjointed design space. Even though machine learning (ML) techniques have been employed to expedite materials innovation, existing methods treat ML and design optimization as two separate processes, failing to resolve the fundamental challenges associated with high dimensionality and mixed-variable complexity. We have developed a ML enhanced mixed-variable material design optimization framework to efficiently extract useful information from existing data in literature and physics-based simulations to guide the autonomous search for optimal materials. Our proposed framework is composed of four computational modules: (1) a natural language processing (NLP) based virtual screening module, (2) classification based concept exploration module, (3) a density functional theory (DFT)-based high-fidelity evaluation model, and (4) a novel latent-variable Gaussian process (LVGP) ML model for mixed-variable problems with uncertainty quantification, which seamlessly integrates with Bayesian Optimization (BO) and achieves superb efficiency through embedded physics-based dimension reduction. Our approach is demonstrated and validated using the testbed of functional materials exhibiting metal-insulation transitions (MITs), with the targeted reversible resistivity changes (∼10^5) near room temperature. At the end of the 30-month project, we have developed a series of new ML techniques using NLP, conditional variational autoencoders, active learning, latent-variable Gaussian processes, integrated with Bayesian optimization. Our project has resulted in new predicted MITs compounds and improved understanding of MITs microscopic mechanisms, which in turn will revolutionize microelectronics science to provide energy-saving solutions. Our research has improved both creativity and efficiency in transforming rare-event discoveries of new functional materials to persistent innovations. In addition to open-sourcing the online MIT database and the classification model, the LVGP open source code has been downloaded more than 15,000 times within two years. More than 40 MIT compounds have been identified and many have been pursued experimentally via collaborators. The research results are published in close to 20 collaborative papers in high-impact journals, such as Chem. Mater., Appl. Phys. Rev., Sci. Rep., among others of design space.

36 MATERIALS SCIENCE↗

Minimax theorems in fuzzy metric spaces

A minimax theorem is a theorem providing conditions which guarantee that the max–min inequality is also an equality. The first theorem in this sense is von Neumann’s minimax theorem, which was considered the starting point of game theory. Since then, several alternative generalizations of von Neumann’s original theorem have appeared in the literature. Variational inequality and minimax problems are of fundamental importance in modern non-linear analysis. They are widely applied in mechanics, differential equations, control theory, mathematical economics, game theory, and optimization. The purpose of this paper is first to establish a minimax theorem for mixed lower–upper semi-continuous functions in fuzzy metric spaces which extends the minimax theorems of many von Neumann types. As applications, we utilize this result to study the existence problems of solutions for abstract variational inequalities and quasi-variational inequalities in fuzzy metric spaces and to study the coincidence problems and saddle problems in fuzzy metric spaces.

97 MATHEMATICS AND COMPUTING↗

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗

First and Second Order Necessary Conditions for Stochastic Optimal Control Problems

In this work we consider a stochastic optimal control problem with either convex control constraints or finitely many equality and inequality constraints over the final state. Using the variational approach, we are able to obtain first and second order expansions for the state and cost function, around a local minimum. This fact allows us to prove general first order necessary condition and, under a geometrical assumption over the constraint set, second order necessary conditions are also established. We end by giving second order optimality conditions for problems with constraints on expectations of the final state.

97 MATHEMATICS AND COMPUTING↗

UAVs for Radiological Monitoring: Determining Ideal Operational Parameters From GEANT4 Simulations - 18025

Owing in no small part to the enormous advances in radiation detector technology (size, sensitivity and spectral-resolution), there has been an increased drive and requirement to accurately map both the spatial extent and magnitude of radiological contamination at the greatest possible spatial resolutions. To undertake this, a range of different methods have been devised and include the use of cars and human, but also planes (and more recently) unmanned aerial vehicles (UAVs). However, critical to the remote sensing using such UAVs in contrast to ground-based sensing, is (i) the selection of the ideal operational parameters to attain the best on-ground resolution in addition to, (ii) understanding the correct normalisation procedures and other influences on results that surveys at these reduced altitudes might present. Resulting from earlier works, through employing combined modelling and experimental data, the optimal height for a UAV survey using the more realistic 'area' radioactive source term (opposed to an infinitely-small 'point-source') is determined to be approximately 5 m - suitably maximizing cross detector counts. At greater altitudes than this, the influence of variations in neighboring topology / topography and nearby structures are observed to be negligible. However, at this and further-reduced altitudes (where optimal count-rates exists), small height-related variations are observed to result, and impact considerably on the complexity of the data normalisation. Whilst not occurring as a tool to entirely replace ground-based surveys, UAV systems are able to perform in challenging or dangerous environments, inadvisable or problematic to send humans. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimized Planning Target Volume for Intact Cervical Cancer

Purpose: To model interfraction clinical target volume (CTV) variation in patients with intact cervical cancer and design a planning target volume (PTV) that minimizes normal tissue dose while maximizing CTV coverage. Methods and Materials: We analyzed 50 patients undergoing external-beam radiotherapy for intact cervical cancer using daily online cone-beam computed tomography (CBCT). The CBCTs (n = 972) for each patient were rigidly registered to the planning CT. The CTV was delineated on the planning CT (CTV{sub 0}) and the set of CBCTs ({l_brace}CTV{sub 1}-CTV{sub 25}{r_brace}). Manual (n = 98) and automated (n = 668) landmarks were placed over the surface of CTV{sub 0} with reference to defined anatomic structures. Normal vectors were extended from each landmark, and the minimum length required for a given probability of encompassing CTV{sub 1}-CTV{sub 25} was computed. The resulting expansions were used to generate an optimized PTV. Results: The mean (SD; range) normal vector length to ensure 95% coverage was 4.3 mm (2.7 mm; 1-16 mm). The uniform expansion required to ensure 95% probability of CTV coverage was 13 mm. An anisotropic margin of 20 mm anteriorly and posteriorly and 10 mm superiorly, inferiorly, and laterally also would have ensured a 95% probability of CTV coverage. The volume of the 95% optimized PTV (1470 cm{sup 3}) was significantly lower than both the anisotropic PTV (2220 cm{sup 3}) and the uniformly expanded PTV (2110 cm{sup 3}) (p < 0.001). For a 95% probability of CTV coverage, normal lengths of 1-3 mm were found along the superior and lateral regions of CTV{sub 0}, 5-10 mm along the interfaces of CTV{sub 0} with the bladder and rectum, and 10-14 mm along the anterior surface of CTV{sub 0} at the level of the uterus. Conclusion: Optimizing PTV definition according to surface landmarking resulted in a high probability of CTV coverage with reduced PTV volumes. Our results provide data justifying planning margins to use in practice and clinical trials.

62 RADIOLOGY AND NUCLEAR MEDICINE↗