Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive robust 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 217 records · Page 12

Dynamical Sketching for Enhanced Communication Efficiency in Federated Learning

Federated learning (FL) has revolutionized distributed machine learning by enabling collaborative model training without sharing local data. However, communication efficiency and privacy guarantees remain significant challenges. This paper introduces a dynamic sketching mechanism in FL, optimizing the trade-off between communication efficiency and model accuracy. By dynamically selecting the sketch matrix size, our approach adapts to the evolving characteristics of the data and the model, ensuring optimal performance across diverse scenarios. We leverage Bayesian optimization to systematically tune the sketch parameters, achieving an effective balance between resource efficiency and model performance. Experimental results on the MNIST dataset using a convolutional neural network (CNN) architecture validate the proposed method's efficiency and scalability. Our dynamic sketching approach significantly outperforms fixed-size sketching techniques, achieving higher compression ratios (up to 62x) and providing better privacy guarantees while maintaining high model accuracy. These findings highlight the robustness and versatility of our approach and make it a valuable solution for privacy-preserving, communication-efficient federated learning.

Afrose, Sharmin [ORNL]↗

Single Episode Policy Transfer in Reinforcement Learning

Transfer and adaptation to new unknown environmental dynamics is a key challenge for reinforcement learning (RL). An even greater challenge is performing near-optimally in a single attempt at test time, possibly without access to dense rewards, which is not addressed by current methods that require multiple experience rollouts for adaptation. To achieve single episode transfer in a family of environments with related dynamics, we propose a general algorithm that optimizes a probe and an inference model to rapidly estimate underlying latent variables of test dynamics, which are then immediately used as input to a universal control policy. This modular approach enables integration of state-of-the-art algorithms for variational inference or RL. Moreover, our approach does not require access to rewards at test time, allowing it to perform in settings where existing adaptive approaches cannot. In diverse experimental domains with a single episode test constraint, we report our method significantly outperforms existing adaptive approaches and shows favorable performance against baselines for robust transfer.

42 ENGINEERING↗

Surface-Functionalized, Two-Dimensional Polymer Electrochromic Layers as Ultrafast, Multi-State Infrared Optical Gates

Electrochromic devices have widespread application potential, but the currently available switching speeds limit broad real-world implementation of this technology. Here, we report surface-engineered two-dimensional polymers with ionophilic pores that offer unprecedented switching speeds in solid-state, two-terminal, electrochromic devices. In particular, we demonstrate that a crystalline donor–acceptor 2DP functionalized with ethylene glycol oligomers exhibits multistate infrared absorption that is 4× faster (t c = 320 ms) with 3× coloration efficiency (491 cm 2 C –1 ) compared to an alkyl functionalized 2DP constructed from the same chromophores. The functionalized nanoporous surfaces enable rapid switching in these materials under either oxidative or reductive conditions, allowing us to access a range of robust, stable optical responses in a single electrochromic layer. These attributes led us to leverage surface-functionalized 2DPs as multistate infrared logic gates. Collectively, this work demonstrates that surface engineering of nanoporous crystalline lattices is a promising approach to co-optimize the electronic and ionic conductivities required to achieve rapidly switchable electrochromic layers. Beyond speed and efficiency, the demonstration of multistate infrared characteristics shows that electrochromic frameworks are useful in integrated optoelectronic circuits. This positions surface-engineered 2DPs as improved electrochromic coatings and a new material platform for photonic information processing and adaptive devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FunDiff: diffusion models over function spaces for physics-informed generative modeling

Recent advances in generative modeling-particularly diffusion models and flow matching-have been widely used for synthesizing discrete data such as images and videos. However, adapting these models to physical applications remains challenging, as the quantities of interest are continuous functions governed by complex physical laws. To address this, we introduce FunDiff, an efficient and robust framework for generative modeling in function spaces. FunDiff combines a latent diffusion process with a function autoencoder architecture to handle input functions with varying discretizations, generates continuous functions that can be evaluated at arbitrary locations, and seamlessly incorporate physical priors. These priors are enforced through architectural constraints or physics-informed loss functions, ensuring that generated samples satisfy fundamental physical laws. We theoretically establish minimax optimality guarantees for density estimation in function spaces, demonstrating that diffusion-based estimators achieve optimal convergence rates under suitable regularity conditions. We further demonstrate the practical effectiveness of FunDiff across diverse applications in fluid dynamics and solid mechanics. Empirical results indicate that our method can generate physically consistent samples with high fidelity to the target distribution, and exhibit robustness to noisy and low-resolution data.

Wang, Sifan [Yale University, New Haven, CT (Unite↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗

Improving Deep Neural Networks’ Training for Image Classification With Nonlinear Conjugate Gradient-Style Adaptive Momentum

Momentum is crucial in stochastic gradient-based optimization algorithms for accelerating or improving training deep neural networks (DNNs). In deep learning practice, the momentum is usually weighted by a well-calibrated constant. However, tuning the hyperparameter for momentum can be a significant computational burden. In this article, we propose a novel adaptive momentum for improving DNNs training; this adaptive momentum, with no momentum-related hyperparame- ter required, is motivated by the nonlinear conjugate gradient (NCG) method. Stochastic gradient descent (SGD) with this new adaptive momentum eliminates the need for the momentum hyperparameter calibration, allows using a significantly larger learning rate, accelerates DNN training, and improves the final accuracy and robustness of the trained DNNs. For example, SGD with this adaptive momentum reduces classification errors for training ResNet110 for CIFAR10 and CIFAR100 from 5.25% to 4.64% and 23.75% to 20.03%, respectively. Furthermore, SGD, with the new adaptive momentum, also benefits adversarial training and, hence, improves the adversarial robustness of the trained DNNs.

97 MATHEMATICS AND COMPUTING↗

Cosmic Inference: Constraining Parameters with Observations and a Highly Limited Number of Simulations

We look at cosmological probes that pose an inverse problem where the measurement result is obtained through observations, and the objective is to infer values of model parameters that characterize the underlying physical system-our universe, from these observations and theoretical forward-modeling. The only way to accurately forward-model physical behavior on small scales is via expensive numerical simulations, which are further “emulated” due to their high cost. Emulators are commonly built with a set of simulations covering the parameter space with Latin hypercube sampling and an interpolation procedure; the aim is to establish an approximately constant prediction error across the hypercube. In this paper, we provide a description of a novel statistical framework for obtaining accurate parameter constraints. The proposed framework uses multi-output Gaussian process emulators that are adaptively constructed using Bayesian optimization methods with the goal of maintaining a low emulation error in the region of the hypercube preferred by the observational data. In this paper, we compare several approaches for constructing multi-output emulators that enable us to take possible inter-output correlations into account while maintaining the efficiency needed for inference. Using a Lyα forest flux power spectrum, we demonstrate that our adaptive approach requires considerably fewer-by a factor of a few in the Lyα P(k) case considered here-simulations compared to the emulation based on Latin hypercube sampling, and that the method is more robust in reconstructing parameters and their Bayesian credible intervals.

79 ASTRONOMY AND ASTROPHYSICS↗

Numerical Computation of a Continuous-thrust State Transition Matrix Incorporating Accurate Hardware and Ephemeris Models

A significant body of work exists showing that providing a nonlinear programming (NLP) solver with expressions for the problem constraint gradient substantially increases the speed of program execution and can also improve the robustness of convergence, especially for local optimizers. Calculation of these derivatives is often accomplished through the computation of spacecraft's state transition matrix (STM). If the two-body gravitational model is employed as is often done in the context of preliminary design, closed form expressions for these derivatives may be provided. If a high fidelity dynamics model, that might include perturbing forces such as the gravitational effect from multiple third bodies and solar radiation pressure is used then these STM's must be computed numerically. We present a method for the power hardward model and a full ephemeris model. An adaptive-step embedded eight order Dormand-Prince numerical integrator is discussed and a method for the computation of the time of flight derivatives in this framework is presented. The use of these numerically calculated derivatieves offer a substantial improvement over finite differencing in the context of a global optimizer. Specifically the inclusion of these STM's into the low thrust missiondesign tool chain in use at NASA Goddard Spaceflight Center allows for an increased preliminary mission design cadence.

Low Thrust↗

High Performance Adaptive Physics Refinement to Enable Large-Scale Tracking of Cancer Cell Trajectory

The ability to track simulated cancer cells through the circulatory system, important for developing a mechanistic understanding of metastatic spread, pushes the limits of today's supercomputers by requiring the simulation of large fluid volumes at cellular-scale resolution. To overcome this challenge, we introduce a new adaptive physics refinement (APR) method that captures cellular-scale interaction across large domains and leverages a hybrid CPU-GPU approach to maximize performance. Through algorithmic advances that integrate multi-physics and multi-resolution models, we establish a finely resolved window with explicitly modeled cells coupled to a coarsely resolved bulk fluid domain. In this work we present multiple validations of the APR framework by comparing against fully resolved fluid-structure interaction methods and employ techniques, such as latency hiding and maximizing memory bandwidth, to effectively utilize heterogeneous node architectures. Collectively, these computational developments and performance optimizations provide a robust and scalable framework to enable system-level simulations of cancer cell transport.

59 BASIC BIOLOGICAL SCIENCES↗

Trajectory Shaper: A Solution for Disrupted Cooperative Adaptive Cruise Control

Cooperative adaptive cruise control (CACC) can effectively reduce energy consumption, alleviate traffic congestion, and enhance safety. However, communication-related constraints and uncooperative vehicle users can disrupt CACC during real-world operations, significantly undermining the putative benefits of CACC. To alleviate the negative impacts of disrupted CACC, this study develops the trajectory shaper (TS) methods as backup solutions for two scenarios: (i) communication between vehicles is infeasible, and vehicles execute adaptive cruise control (ACC) using local sensor measurements; (ii) follower vehicles reject forming a cooperative platoon and execute their local distributed controllers using the information attained via communication. When communication is infeasible, a distributed TS is devised on each vehicle to modify the sensor measurements, enabling safe and efficient ACC operations. When communication is available but uncooperative agents are involved, the lead vehicle of the platoon executes a centralized TS to modify the information shared with uncooperative agents, achieving optimal platoon-level performance. The centralized and distributed TSs are implemented based on the model predictive control algorithms to yield optimal modifications on input information. Robustness is also factored to tackle model uncertainties during TS operations to ensure safety and efficiency. Numerical experiments validate the control performance of the proposed TSs.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗

Hybrid state-space self-tuning control of uncertain linear systems

The paper presents a hybrid state-space self-tuner using a new dual-rate sampling scheme for digital adaptive control of continuous-time uncertain linear systems. A state-space-based recursive least-squares algorithm, together with a variable forgetting factor, is used for direct estimations of both the equivalent discrete-time uncertain linear system parameters and the associated discrete-time state of a continuous-time uncertain linear system from the sampled input and output data. An analogue optimal regional pole-placement design method is used for designing an optimal observer-based analogue controller. A suboptimal observer-based digital controller is then designed from the designed analogue controller using digital redesign technique. To enhance the robustness of parameter identification and state estimation algorithms, a dynamic bound for a class of uncertain bilinear parameters and a fast-rate digital controller are developed at each fast-sampling period. Also, to accommodate computation loads and computation delay for developing the advanced hybrid self-tuner, the designed analogue controller and observer gains are both updated at each slow-sampling period. This control technique has been successfully applied to benchmark control problems.

Shieh, L. S.↗

ACHILLES-GENIE Interface for Neutrino Simulations, ADRIANO2 Tile Prototype for High-Granularity Dual-Readout Calorimetry

ICARUS (Imaging Cosmic And Rare Underground Signals) is a liquid argon time projection chamber (LArTPC) detector that pursues the sterile neutrino, which relies on accurate simulations of neutrino-argon interactions. REDTOP (Rare Eta Decays To Observe new Physics) is a proposed low-energy, high-intensity meson factory designed to explore rare $\eta$/$\eta'$ meson decays and probe physics beyond the Standard Model. As a next-generation experiment, this requires both accurate simulations and innovative detector technologies. This project contributes to both ICARUS, from a simulation perspective, and REDTOP, from both a simulation and detection perspective, through the event generation of lepton-nucleon interactions and the physical enhancement of the calorimeter technology within the REDTOP detector. We developed an interface between ACHILLES (A CHIcago Land Lepton Event Simulator), a theory-driven lepton-level event generator, and GENIE, a robust event generator framework used for neutrino physics. By incorporating the precise theoretical cross-section calculations of ACHILLES into the experimental realism of GENIE, the interface allows for improved accuracy of neutrino-nucleon simulations, which can be adapted for the proton beam specifications of the REDTOP meson factory as well as for the ICARUS experiment. In parallel, we developed an improved prototype for the ADRIANO2 (A Dual Readout Integrally Active Non-segmented Option) dual-readout calorimeter tiles for the REDTOP detector. To improve the efficiency of the lead-glass tiles trapping Cherenkov light for energy reconstruction and particle identification, we optimized the application of a highly reflective coating. Through viscosity and thickness control, masking, and a custom spray technique, we refined the coating process to reduce surface defects and improve light yield. Together, these efforts strengthen the ICARUS neutrino program and REDTOP's capability of detecting rare decay events.

Visser, Erin [Michigan State U.]↗

Enhancing ICARUS and REDTOP Software and Hardware: Event Generator Interface Development and Calorimeter Tile Prototype

ICARUS (Imaging Cosmic And Rare Underground Signals) is a liquid argon time projection chamber (LArTPC) detector that pursues the sterile neutrino, which relies on accurate simulations of neutrino-argon interactions. REDTOP (Rare Eta Decays To Observe new Physics) is a proposed low-energy, high-intensity meson factory designed to explore rare $\eta$/$\eta'$ meson decays and probe physics beyond the Standard Model. As a next-generation experiment, this requires both accurate simulations and innovative detector technologies. This project contributes to both ICARUS, from a simulation perspective, and REDTOP, from both a simulation and detection perspective, through the event generation of lepton-nucleon interactions and the physical enhancement of the calorimeter technology within the REDTOP detector. We developed an interface between ACHILLES (A CHIcago Land Lepton Event Simulator), a theory-driven lepton-level event generator, and GENIE, a robust event generator framework used for neutrino physics. By incorporating the precise theoretical cross-section calculations of ACHILLES into the experimental realism of GENIE, the interface allows for improved accuracy of neutrino-nucleon simulations, which can be adapted for the proton beam specifications of the REDTOP meson factory as well as for the ICARUS experiment. In parallel, we developed an improved prototype for the ADRIANO2 (A Dual Readout Integrally Active Non-segmented Option) dual-readout calorimeter tiles for the REDTOP detector. To improve the efficiency of the lead-glass tiles trapping Cherenkov light for energy reconstruction and particle identification, we optimized the application of a highly reflective coating. Through viscosity and thickness control, masking, and a custom spray technique, we refined the coating process to reduce surface defects and improve light yield. Together, these efforts strengthen the ICARUS neutrino program and REDTOP's capability of detecting rare decay events.

Visser, Erin [Michigan State U.] (ORCID:0009000184↗

Metric Type in the Target-matrix Mesh Optimization Paradigm

The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement. TMOP has been successfully applied to a number applications even though the paradigm was not fully understood at the time. With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization. The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type. Target matrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive. Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction. It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past. It is shown further that there exist well-posed metrics corresponding to six of the eight metric types. A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction.

97 MATHEMATICS AND COMPUTING↗

Advances in genetic tools for metabolic engineering of non-conventional yeasts

Non-conventional yeasts are emerging as powerful alternatives to Saccharomyces cerevisiae for metabolic engineering, owing to their innate stress tolerance, broad substrate utilization, and distinctive metabolic capabilities. These attributes position them as promising chassis for producing biofuels, pharmaceuticals, and specialty chemicals. This review synthesizes recent advances in genetic toolkits for four such species—Pichia kudriavzevii (Issatchenkia orientalis), Starmerella bombicola, Debaryomyces hansenii, and Pachysolen tannophilus—highlighting progress across plasmid architectures (episomal and integrative), identification of autonomously replicating sequences and centromeric elements, and the development of safe-harbor genomic loci. We summarize promoter and terminator libraries enabling tunable expression, the expansion of auxotrophic and antifungal selection markers with recycling strategies, and the rapid adaptation of CRISPR-based systems (Cas9 and Cas12a) with optimized guide RNA expression, multiplex editing, and approaches that enhance homologous recombination (e.g., KU70/80 disruption). We also review landing-pad platforms for modular, repeated integrations and transposon-based tools (e.g., piggyBac) that facilitate multigene pathway assembly. Collectively, these innovations are accelerating design-build-test-learn cycles and enabling precise, scalable engineering of non-conventional yeasts. Remaining challenges—including limited species-specific episomal systems, variable transformation efficiencies, genome-stability concerns, and alternative codon usage—define clear priorities for future toolkit development. Together, these advances and open needs chart a path toward robust, sustainable biomanufacturing using diverse non-conventional yeast chassis.

59 BASIC BIOLOGICAL SCIENCES↗

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity

High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations [1], but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE) [2, 3]. Here, we extend this framework to address two key gaps in the literature for highorder mesh 𝑟-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from 𝑟-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.

Mathematics and Computing↗