Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,477 records · Page 82

Unified, Geometric Framework for Nonequilibrium Protocol Optimization

Controlling thermodynamic cycles to minimize the dissipated heat is a long-standing goal in thermodynamics, and more recently, a central challenge in stochastic thermodynamics for nanoscale systems. Here, we introduce a theoretical and computational framework for optimizing nonequilibrium control protocols that can transform a system between two distributions in a minimally dissipative fashion. These protocols optimally transport a system along paths through the space of probability distributions that minimize the dissipative cost of a transformation. Furthermore, we show that the thermodynamic metric—determined via a linear response approach—can be directly derived from the same objective function that is optimized in the optimal transport problem, thus providing a unified perspective on thermodynamic geometries. As a result, we investigate this unified geometric framework in two model systems and observe that our procedure for optimizing control protocols is robust beyond linear response.

36 MATERIALS SCIENCE↗

Optimal Twirling Depth for Classical Shadows in the Presence of Noise

The classical shadows protocol is an efficient strategy for estimating properties of an unknown state p using a small number of state copies and measurements. In its original form, it involves twirling the state with unitaries from some ensemble and measuring the twirled state in a fixed basis. It was recently shown that for computing local properties, optimal sample complexity (copies of the state required) is remarkably achieved for unitaries drawn from shallow depth circuits composed of local entangling gates, as opposed to purely local (zero depth) or global twirling (infinite depth) ensembles. Here, we consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. Under fairly general conditions, we (i) show that any single-site noise can be accounted for using a depolarizing noise channel with an appropriate damping parameter f, (ii) compute thresholds f th at which optimal twirling reduces to local twirling for Pauli operators, (iii) nth order Renyi entropies (n ≥2), and (iv) provide a meaningful upper bound t max on the optimal circuit depth for any finite noise strength f, which applies to observables and entanglement entropy measurements. In conclusion, these thresholds strongly constrain the search for optimal strategies to implement shadow tomography and are easily tailored to the experimental system at hand.

97 MATHEMATICS AND COMPUTING↗

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

Optimizers for stabilizing likelihood-free inference

A growing number of applications in particle physics and beyond use neural networks as unbinned likelihood ratio estimators applied to real or simulated data. Precision requirements on the inference tasks demand a high-level of stability from these networks, which are affected by the stochastic nature of training. We show how physics concepts can be used to stabilize network training through a physics-inspired optimizer. In particular, the energy conserving descent (ECD) optimization framework uses classical Hamiltonian dynamics on the space of network parameters to reduce the dependence on the initial conditions while also stabilizing the result near the minimum of the loss function. We develop a version of this optimizer known as , which has few free hyperparameters with limited ranges guided by physical reasoning. We apply to representative likelihood-ratio estimation tasks in particle physics and find on average that it out-performs the widely used Adam optimizer. We expect that ECD will be a useful tool for wide array of data-limited problems, where it is computationally expensive to exhaustively optimize hyperparameters and mitigate fluctuations with ensembling.

Monte Carlo methods↗

A Comprehensive Approach towards Multi-Objective EMI Filter Design Optimization in High-Frequency SiC-Based Motor Drives

With rapid penetration of high-frequency, highdensity power electronics into the industry, controlling the system generated EMI becomes one of the major design challenges. Designing practical optimized EMI filters require simultaneous consideration of multiple aspects - including electromagnetic couplings, magnetic materials, practical component parasitics and their impacts at high-frequencies, and also the overall manufacturing costs. The multi-dimensional nature of the problem often results in overcompensated designs that hurt the system efficiency and power density. This paper focuses on a comprehensive design platform (developed in MATLAB) towards designing high-density, optimized, highly efficient EMI filters by analyzing the generated noise spectrum and evaluating a vast array of potential solutions before outputting an optimized filter solution. The proposed tool includes database-based component selection, optimal topology selection, multistage filter design, overall optimization for volume, mass, cost and total loss. The proposed filter has been thoroughly evaluated in a PSIM simulation environment emulating the hardware in CRD300DA12EXM3, a 300kW three-phase inverter from Wolfspeed with an RL load representing a motor drive application. Furthermore, a 20kHz switching frequency is chosen and impacts of the motor high-frequency characteristics on the generated EMI noise spectrum of the overall system have been analyzed.

42 ENGINEERING↗

Model-based Hyperparameter Optimization of Convolutional Neural Networks for Information Extraction from Cancer Pathology Reports on HPC

Finding optimal hyperparameters is necessary to identify the best performing deep learning models but the process is costly. In this paper, we applied model-based optimization, also known as Bayesian optimization, using the CANDLE framework implemented on a High-Performance Computing environment. As a use case we selected information extraction from cancer pathology reports using a multi-task convolutional neural network, and hierarchical convolutional attention network to be optimized. We utilized a synthesized text corpus of 8,000 training cases and 2,000 validation cases with four types of clinical task labels including primary cancer site, laterality, behavior, and histological grade. We demonstrated that hyperparameter optimization using the CANDLE framework is a feasible approach with respect to both scalability and clinical task performance.

Yoon, Hong-Jun↗

Bayesian-based Hyperparameter Optimization for Spiking Neuromorphic Systems

Designing a neuromorphic computing system involves selection of several hyperparameters that not only affect the accuracy of the framework, but also the energy efficiency and speed of inference and training. These hyperparameters might be inherent to the training of the spiking neural network (SNN), the input/output encoding of the real-world data to spikes, or the underlying neuromorphic hardware. In this work, we present a Bayesian-based hyperparameter optimization approach for spiking neuromorphic systems, and we show how this optimization framework can lead to significant improvement in designing accurate neuromorphic computing systems. In particular, we show that this hyperparameter optimization approach can discover the same optimal hyperparameter set for input encoding as a grid search, but with far fewer evaluations and far less time. We also show the impact of hardware-specific hyperparameters on the performance of the system, and we demonstrate that by optimizing these hyperparameters, we can achieve significantly better application performance.

Parsa, Maryam↗

Coordinated Optimal Control of Constrained DERs

In this paper, a coordinated optimal control is designed to simultaneously satisfy multiple power system objectives at the distribution network level. With high penetration of renewables, traditional generation and control may not be enough to compensate for intermittent changes in net load. Dynamic coordination of battery storage devices and demand response at aggregated distributed energy resource (DER) sites becomes necessary to maintain power system operation, however, each dynamic power component operates at different time scales. Frequency stabilization can be achieved by designing optimal controls for traditional generation, storage devices and demand response. The proposed optimal controls naturally render frequency separation of these load balancing mechanisms. Given a 24-hour net load forecast, optimal tracking control inputs are designed subject to constraints of selected system elements to ensure optimal performance of the power system. Simulation results are presented and discussed.

Harvey, Roland↗

Optimizing Process-to-Core Mappings for Application Level Multi-dimensional MPI Communications

Multi-dimensional MPI communications, where MPI communications have to be performed in each dimension of a Cartesian communicator, have been frequently used in many of today's high performance computing applications. While individual MPI collective communications for regular communicators with a one-dimensional linear-ranking of processes have been extensively studied and optimized, little optimizations have been performed for multi-dimensional MPI collective communications on multi-dimensional Cartesian topology. In this paper, we optimize multi-dimensional MPI collective communications for SMP and multi-core systems at the application level. We show that the default Cartesian topology built by the state-of-the-art MPI implementations produce sub-optimal performance for multi-dimensional MPI collective communications. We design optimal process-to-core mapping schemes for Cartesian communicators to minimize the total inter-node communications. The proposed technique improves the performance by up to 80% over the default Cartesian topology built by Cray's MPI implementation MPT 3.1.02 on the world's current second fastest supercomputer Jaguar at Oak Ridge National Laboratory.

Computer Science↗

Fourier Analysis-Based Evolutionary Multi-Objective Multiphysics Optimization of Liquid-Cooled Heat Sinks

Optimal heat dissipation in power modules can significantly increase their power density. Removing the generated heat is critical for capturing the benefits of advanced semiconductor materials and improving the reliability of the device operation. This article proposes a design optimization method for liquid-cooled heat sinks that use a Fourier analysis-based tool and an evolutionary optimization algorithm to optimize the heat sink geometry for specified objectives. The optimized heat sink geometry is then compared with state-of-the-art solutions in literature based on finite element analysis of different designs. The proposed methodology can develop complex geometries that outperform the conventional heat sink geometries.

Sahu, Raj↗

Parameter Co-optimization for Hybrid Electric Vehicles Powertrain System Leveraging V2V/V2I Information

A parameter tuning based co-optimization scheme for the hybrid electric vehicles (HEV) powertrain system is designed to maximize the fuel efficiency. The optimization controlled input parameters are chosen based on sensitivity study of powertrain control parameters. The vehicle to vehicle (V2V) and vehicle to infrastructure information is another optimization input, to have the driving conditions taking in to considerations for maximizing fuel efficiency. The catalyst temperature is considered as an additional constraint as the speed to reach light-off temperature should not decrease during optimized operation. Neural network is used to develop a simplified yet equivalent model for the optimization problem model. We have achieved an average of 9.22% fuel savings for a random driving cycle on a Toyota Prius test model.

V2V, Cooptimization↗

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗

NO-LESS: Near optimal curtailment strategy selection for net load balancing in micro grids

The integration of renewable energy sources such as solar PVs into micro grids has increased in recent years. However, the intermittent and unpredictable nature of renewable energy generation makes supply uncertain, in turn requiring continuous net load balancing to ensure grid stability. One technique to achieve net load balancing is curtailment, however, selection of the optimal set of curtailment strategies to achieve a targeted curtailment is NP-hard. State-of-the-art curtailment selection techniques approach this problem by either developing computationally expensive optimal curtailment strategies or reduce accuracy to generate sub-optimal solutions quickly. In this work, we develop NO-LESS: a Near OptimaL CurtailmEnt Strategy Selection algorithm. NO-LESS is a novel Fully Polynomial Time Approximation Scheme (FPTAS) which determines bounded (near optimal) curtailment strategies in a small amount of time while simultaneously satisfying practical constraints on strategy switching overhead and curtailment fairness. We perform both theoretical analysis and practical evaluation to show that NO-LESS is a scalable solution for performing net load balancing through curtailment strategy selection in Micro Grids.

14 SOLAR ENERGY↗

A Real-time Agent Based Optimization and Control Approach for Residential Building Heating Ventilation and Air Conditioning Systems

The prevalence of the loT (Internet of Things) is fostering the development of new control options and decision making that was not previously available. This is creating a wealth of opportunities for real-time control approaches and systems that can optimize for a common goal. This paper presents a smart residential neighborhood with optimization at the residential level utilizing a system of agents. The optimization utilizes information and modeling to optimize variable speed HVAC real-time operation in actual residential buildings. Data is presented showing the performance of the optimization and conclusions are drawn on next steps for development.

Hall, Joni↗

State Dependent Optimization with Quantum Circuit Cutting

Quantum circuits can be reduced through optimization to better fit the constraints of quantum hardware. One such method, initial-state dependent optimization (ISDO), reduces gate count by leveraging knowledge of the input quantum states. Surprisingly, we found that ISDO is broadly applicable to the downstream circuits produced by circuit cutting. Circuit cutting also requires measuring upstream qubits and has some flexibility of selection observables to do reconstruction. Therefore, we propose a state-dependent optimization (SDO) framework that incorporates ISDO, our newly proposed measure-state dependent optimization (MSDO), and a biased observable selection strategy. Building on the strengths of the SDO framework and recognizing the scalability challenges of circuit cutting, we propose nonseparate circuit cutting-a more flexible approach that enables optimizing gates without fully separating them. We validate our methods on noisy simulations of QAOA, QFT, and BV circuits. Results show that our approach consistently mitigates noise and improves overall circuit performance, demonstrating its promise for enhancing quantum algorithm execution on near-term hardware.

Li, Xinpeng↗

Accelerating Traction Motor Optimization Design with AI Surrogate Models

The advancement of artificial intelligence systems enables the use of data-driven physics-based surrogate models to explore design spaces rapidly and deeply for engineering projects. This work presents a surrogate model workflow that accelerates electric traction motor design optimization by replacing finite element analysis (FEA) with an artificial neural network (ANN) and using this model in a genetic algorithm for design optimization. A baseline interior permanent-magnet motor is parameterized and sampled to generate FEA-labeled training data, after which a feed-forward ANN predicts key outputs (e.g., loss components and weight). The validated surrogate enables genetic-algorithm optimization and deep search over the design space without new FEA runs, producing Pareto-optimal trade-offs between weight and losses and set of optimized designs for rapid downselection of manufacturable motor designs.

Ribeiro, Pedro [ORNL] (ORCID:0009000921026641)↗

Importance Sampling Model-Based Diffusion for Trajectory Optimization

Trajectory optimization for robotic systems remains a challenging problem. This is especially true for robotic systems featuring nonlinear dynamics and many degrees of freedom. Data-based or model-free diffusion has recently been popularized in the fields of artificial intelligence and trajectory optimization. Model-Based Diffusion provides a data-free method of trajectory optimization, trained at runtime on a system dynamics model, suitable for high-dimensional models. This paper examines how importance sampling can enhance the performance of Model-Based Diffusion for trajectory optimization. Here, we quantify the benefits of importance sampling across three long horizon planning tasks. These results show as much as a 13x improvement in sample efficiency depending on environment and optimization parameters.

Golembeski, Seth [Georgia Institute of Technology,↗

Prometheus: Coherent Exploration of Hardware and Software Optimizations using Aspen

With the dramatic increase in scale expected for Exascale computing, there is a dire need for tuning of hardware configurations and software optimizations such that they are in unison. However, the expected increase in tunable hardware parameters makes searching through the design space for optimal hardware-and-software configurations much more challenging. Towards this end, we propose a composable hardware-software optimization framework called Prometheus. Prometheus uses a combination of analytical and machine-learning techniques to capture application characteristics and subsequently determine the hardware-software configuration for near-optimal performance. We evaluate Prometheus for its efficacy using four widely used proxy applications: LULESH, CoMD, CG and CoEVP. We demonstrate that Prometheus identifies near-optimal hardwaresoftware configurations and verify the results via brute-force search of the design space.

Umar, Mariam↗