Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive weights”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Self-adaptive weights based on balanced residual decay rate for physics-informed neural networks and deep operator networks

Physics-informed deep learning has emerged as a promising alternative for solving partial differential equations. However, for complex problems, training these networks can still be challenging, often resulting in unsatisfactory accuracy and efficiency. In this work, we demonstrate that the failure of plain physics-informed neural networks arises from the significant discrepancy in the convergence rate of residuals at different training points, where the slowest convergence rate dominates the overall solution convergence. Based on these observations, we propose a pointwise adaptive weighting method that balances the residual decay rate across different training points. The performance of our proposed adaptive weighting method is compared with current state-of-the-art adaptive weighting methods on benchmark problems for both physics-informed neural networks and physics-informed deep operator networks. In conclusion, through extensive numerical results we demonstrate that our proposed approach of balanced residual decay rates offers several advantages, including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Balanced convergence rate↗
DOE OSTI2024

Efficient training of physics-informed neural networks

Open-source software package designed for the efficient training of Physics-Informed Neural Networks (PINNs) and their variants, integrating advanced methodologies such as adaptive weighting and adaptive sampling

Chen, Wenqian [Pacific Northwest National Laborato↗
DOE OSTI2023

Di-CNN: Domain-Knowledge-Informed Convolutional Neural Network for Manufacturing Quality Prediction

In manufacturing, convolutional neural networks (CNNs) are widely used on image sensor data for data-driven process monitoring and quality prediction. However, as purely data-driven models, CNNs do not integrate physical measures or practical considerations into the model structure or training procedure. Consequently, CNNs’ prediction accuracy can be limited, and model outputs may be hard to interpret practically. This study aims to leverage manufacturing domain knowledge to improve the accuracy and interpretability of CNNs in quality prediction. A novel CNN model, named Di-CNN, was developed that learns from both design-stage information (such as working condition and operational mode) and real-time sensor data, and adaptively weighs these data sources during model training. It exploits domain knowledge to guide model training, thus improving prediction accuracy and model interpretability. A case study on resistance spot welding, a popular lightweight metal-joining process for automotive manufacturing, compared the performance of (1) a Di-CNN with adaptive weights (the proposed model), (2) a Di-CNN without adaptive weights, and (3) a conventional CNN. The quality prediction results were measured with the mean squared error (MSE) over sixfold cross-validation. Model (1) achieved a mean MSE of 6.8866 and a median MSE of 6.1916, Model (2) achieved 13.6171 and 13.1343, and Model (3) achieved 27.2935 and 25.6117, demonstrating the superior performance of the proposed model.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems

VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

From PINNs to PIKANs: recent advances in physics-informed machine learning

Physics-Informed Neural Networks (PINNs) have emerged as a key tool in Scientific Machine Learning since their introduction in 2017, enabling the efficient solution of ordinary and partial differential equations using sparse measurements. Over the past few years, significant advancements have been made in the training and optimization of PINNs, covering aspects such as network architectures, adaptive refinement, domain decomposition, and the use of adaptive weights and activation functions. A notable recent development is the Physics-Informed Kolmogorov-Arnold Networks (PIKANS), which leverage a representation model originally proposed by Kolmogorov in 1957, offering a promising alternative to traditional PINNs. In this review, we provide a comprehensive overview of the latest advancements in PINNs, focusing on improvements in network design, feature expansion, optimization techniques, uncertainty quantification, and theoretical insights. We also survey key applications across a range of fields, including biomedicine, fluid and solid mechanics, geophysics, dynamical systems, heat transfer, chemical engineering, and beyond. Lastly, we review computational frameworks and software tools developed by both academia and industry to support PINN research and applications.

Kolmogorov-Arnold networks↗
DOE OSTI2025

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Radiation Stability of Mixed Tin-Lead Halide Perovskites: Implications for Space Applications

Mixed organic-inorganic halide perovskite solar cells (PSCs) have received considerable attention in recent years for their impressive solar to electrical power efficiency gains and potentially lower material and processing costs for optoelectronic applications. In addition to terrestrial applications, PSCs are of interest to the space power markets for their low cost, low weight, adaptability to flexible architectures, and tolerance to high energy particle irradiation (mainly protons and electrons). Here we investigate the properties of mixed formamidinium-methylammonium tin-lead iodide (FASn)0.6(MAPb)0.4I3 perovskites which lower the lead content as well as the bandgap, making them attractive for the low bandgap absorber material in tandem PSCs. Through current density-voltage (JV) characterization at lower temperatures, majority carrier transport is hindered and a barrier to photogenerated carrier extraction is evident. This is attributed to the thermally induced change of the bandgap of the absorber layer relative to the energy selective contacts in the device. We find that although the architecture used here hinders the performance at temperatures below 225 K, the tolerance to high energy (3.7 MeV) protons is impressive, considerably out-performing commercially available thin-film CIGS. These results suggest further improvements to structural and interface stability as well as lightweight encapsulation could lead to all perovskite flexible tandem arrays deployed for power generation on missions to low Earth orbit, the moon, Mars, and beyond.

perovskite solar cells↗
DOE OSTI2025

Beam optics ramping in underconstrained lattice design: Application to Electron-Ion Collider hadron storage ring cooling section

This paper presents the lattice design and optics ramping strategy for the cooling section of the hadron storage ring at the electron-ion collider. The main challenge is that available tuning knobs exceed beam-optics constraints. Independently optimized injection and top-energy optics often yield disconnected solutions, making interpolation impossible. To address this, we propose two new methods. The first is an intermediate-penalty scheme that ensures ramping path continuity by penalizing constraint violations at intermediate states. The second is a continuation-based approach that adapts high-energy optics to low energy, guided by an adaptive weighting scheme to balance injection and ramping constraints. The solutions meet all beam dynamics and hardware limits. The two methods offer a general strategy for ramping in systems where the solution space is under-constrained and the starting and target configurations are far apart.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Synchro-Waveform-Based Event Identification Using Multi-Task Time-Frequency Transform Networks

Influenced by the transient dynamics and reduced inertia characteristics of high-penetration renewable energy systems, power system events frequently exhibit distinct characteristics such as high-frequency components including wide-band oscillations and hyper-harmonics. This makes standard systems face challenges including significant latency and reduced accuracy due to limited data resolution. However, current methods face significant limitations, including insufficient pattern capture ability, low noise immunity, limited feature learning, and restricted localization capabilities, thereby hindering real-time performance. To tackle this issue, this paper proposed a novel synchro-waveform-based event identification approach via a Multi-task Time-frequency Transform Network (MTTNet). Initially, a Time-frequency Transform Block (TTB) is developed to extract both local and global information. The TTB leverages both Fourier and S-transforms to derive comprehensive time-frequency information from synchro-waveforms. Subsequently, a multi-task learning strategy is employed to identify the type and distinguish localization of events. Integrating the TTB and multi-task learning, the MTTNet is designed for synchro-waveform-based event identification, incorporating an adaptive weighting strategy and simplified computation for the S-transform. Two different datasets, comprising simulated and actual synchro-waveforms, are collected from the IEEE 123 bus system and a real-world high-penetration renewable energy system using a universal grid analyzer. Extensive experiments on various conditions are carried out. In conclusion, results demonstrated that the MTTNet consistently surpasses both basic and advanced baselines, with maximum improvements of 13.24% and 9.86%, respectively, while reducing the calculation burden by 15-19 times to achieve real-time event identification.

Event identification↗
DOE OSTI2024

3D Multiresolution Velocity Model Fusion with Probability Graphical Models

ABSTRACT The variability in spatial resolution of seismic velocity models obtained via tomographic methodologies is attributed to many factors, including inversion strategies, ray-path coverage, and data integrity. Integration of such models, with distinct resolutions, is crucial during the refinement of community models, thereby enhancing the precision of ground-motion simulations. Toward this goal, we introduce the probability graphical model (PGM), combining velocity models with heterogeneous resolutions and nonuniform data point distributions. The PGM integrates data relations across varying resolution subdomains, enhancing detail within low-resolution (LR) domains by utilizing information and prior knowledge from high-resolution (HR) subdomains through a maximum posterior problem. Assessment of efficacy, utilizing both 2D and 3D velocity models—consisting of synthetic checkerboard models and a fault-zone model from Ridgecrest, California—demonstrates noteworthy improvements in accuracy, compared to state-of-the-art fusion techniques. Specifically, we find reductions of 30% and 44% in computed travel-time residuals for 2D and 3D models, respectively, as compared to conventional smoothing techniques. Unlike conventional methods, the PGM’s adaptive weight selection facilitates preserving and learning details from complex, nonuniform HR models and applies the enhancements to the LR background domain.

Geochemistry & Geophysics↗
DOE OSTI2025

A Dynamic Hierarchical Attention Framework for Multimodal Malware Detection

The increasing use of Android in the worldwide mobile ecosystem has come along with a significant increase in advanced malware, highlighting the critical necessity for efficient, scalable, and adaptable detection systems. Despite recent advancements in machine learning improving malware detection, the majority of current solutions are limited to one, two, or three data modalities, hence neglecting the comprehensive behavioral spectrum of contemporary multi-vector threats. This thesis presents the first comprehensive multimodal framework for Android malware detection, which combines textual, time-series (temporal), graph-based (structural), and visual information using an innovative hierarchical attention mechanism and Dynamic Fusion Controller (DFC). Our methodology consistently classifies and processes modalities as either sequential or structural, facilitating content-adaptive weighting and resilient cross-modal representation learning. We advance the implementation of cutting-edge time series techniques, such as MiniRocket, for malware detection, hence creating new opportunities for temporal analysis in cybersecurity. Comprehensive experimental assessment shows that our framework performs exceptionally well, with 99.46% classification accuracy and 97.15% detection accuracy, significantly outperforming existing approaches through effective multimodal integration and hierarchical attention mechanisms.

Nazmin, Tamanna↗
DOE OSTI2024

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Learned adaptive properties for mitigation of weight perturbations in embedded spiking networks

Recent years have seen an increased importance of neural network inference in edge-based scenarios, which impose size and power constraints requiring novel computing devices. These same edge scenarios may require operating over long periods of time, or exposure to extreme environments, resulting in a drift of neural network weights that cause degraded performance. In searching for ways to develop neural network approaches that perform robustly under these conditions, we propose a biologically-inspired mechanism for the dynamic adaptation of within-neuron parameters that is guided by a global context signal carrying information about perturbations and variability in incoming stimuli. Specifically, we demonstrate that adaptive voltage thresholds or neuronal time constants, when informed by a global context signal, can enable network-level mechanisms to recover from perturbed synaptic weights. Consistent with prior literature, the context-modulated approach is effective for recurrent, but not feedforward networks, by modulating network level dynamics. We demonstrate this approach successfully recovers performance in image classification tasks and spatiotemporal tracking tasks under idealized and Gaussian noise as well as for realistic perturbations from a memristive device when exposed to ionizing radiation. Finally, we discuss how this approach enables the design of robust and energy-efficient neuromorphic systems that perform well, even in resource-constrained scenarios with extreme environments such as edge processing.

context modulation↗
DOE OSTI2023

First Impressions: Early-time Classification of Supernovae Using Host-galaxy Information and Shallow Learning

Substantial effort has been devoted to the characterization of transient phenomena from photometric information. Automated approaches to this problem have taken advantage of complete phase coverage of an event, limiting their use for triggering rapid follow-up of ongoing phenomena. In this work, we introduce a neural network with a single recurrent layer designed explicitly for early photometric classification of supernovae (SNe). Our algorithm leverages transfer learning to account for model misspecification, host-galaxy photometry to solve the data-scarcity problem soon after discovery, and a custom weighted loss to prioritize accurate early classification. We first train our algorithm using state-of-the-art transient and host-galaxy simulations, then adapt its weights and validate it on the spectroscopically confirmed SNe Ia, SNe II, and SNe Ib/c from the Zwicky Transient Facility Bright Transient Survey. On observed data, our method achieves an overall accuracy of 82% ± 2% within 3 days of an event’s discovery, and an accuracy of 87% ± 5% within 30 days of discovery. At both early and late phases, our method achieves comparable or superior results to the leading classification algorithms with a simpler network architecture. These results help pave the way for rapid photometric and spectroscopic follow-up of scientifically valuable transients discovered in massive synoptic surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part II: linesweep ALE rezoning for nonconformal block-structured AMR meshes

The simulation of flows presenting contact discontinuities, vorticity, and large variations in spatial scales can be performed in a framework coupling Arbitrary Lagrangian Eulerian (ALE) algorithms and Adaptive Mesh Refinement (AMR). This coupling requires adaptation of ALE rezoning techniques to meshes containing nonconformal nodes arising from both the AMR topology and the junction of mesh blocks. Here, in this paper, we present an ALE rezoning strategy that is compatible with such meshes, and that can also act as a disentangling algorithm. Emphasis is put on an algorithm that respects intrinsic Lagrangian mesh properties in order to preserve accuracy around discontinuities. To that end, we adapt the weighted linesweep algorithm to nonconformal block-structured AMR meshes. Then, we present control parameters introduced in the method for it to be applicable in practical situations. Notably, the method is coupled to a specific metric optimization in order to palliate some shortcomings of the linesweep method. Finally, numerical test cases are presented that feature the capabilities of the ALE-AMR algorithm for flows that present discontinuities, vorticity, and a variety of scales. Notably, we show that our ALE-AMR algorithm gives results at least similar to Euler-AMR, but provides better accuracy in cases where discontinuities are involved, thanks to a method that respects the Lagrangian features of the mesh. Additionally, it enables Euler-AMR-like computations on domains with temporally varying domain boundaries.

Adaptive mesh refinement↗
DOE OSTI2025

Mapping heat vulnerability in cities: A tale of two california cities

Extreme heat is a major cause of weather-related deaths in the United States. To address this, a heat vulnerability index (HVI) is crucial for assessing heat risk and identifying vulnerable urban areas and populations, supporting city planning and emergency response. Current HVI studies often use Principal Component Analysis (PCA) on environmental, socioeconomic, and medical data to aggregate vulnerability indicators into a single index. However, these fixed aggregation weights struggle to adapt to different use cases, which may require varying focuses. Moreover, existing tools primarily consider outdoor heat exposure, providing an incomplete picture of actual exposure, as people spend most of their time indoors. Our research introduces an HVI web mapping tool that addresses these gaps in the literature by: (1) allowing flexible weights to adapt to different use cases, and (2) uniquely integrating both outdoor and indoor heat exposure by considering building characteristics for a more comprehensive risk assessment. We demonstrated this tool in two California cities with contrasting climates: Fresno (inland, arid, hot summers) and Oakland (temperate coastal). This HVI mapping tool provides essential decision support for policymakers and stakeholders in both short-term heat mitigation and long-term urban planning for building interventions and infrastructure development.

BES↗