Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Backpropagation”

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

Backpropagation-based learning with local derivative approximation and memory replay in biologically plausible neural systems

When learning, the brain modifies individual synaptic connections to reach a desired behavior. Animal and human brains have been shown to be incredibly capable of learning complex and varied functions across a wide variety of tasks. In recent years, artificial neural networks, inspired by human and animal brains, have shown great capabilities in learning a wide variety of difficult tasks. However, artificial neural networks primarily teach themselves through the use of backpropagation, a learning method which has no clear analogue within the brain. Additionally, Artificial Neural Networks primarily use continuous activation functions, which differ significantly from the spiking neuronal behavior present in the brain. In this paper, we discuss and demonstrate a biologically plausible learning method that approximates backpropagation through two techniques on Spiking Neural Networks. First, we show that the local temporal derivatives that are necessary for backpropagation can be approximately recovered through reconstruction using spike timings. Second, we show that through learning during a sleep phase, inspired by neuroscience research into memory replay, the localized parallel feedback path can learn to approximate the derivative through the forward path weight matrix, thus solving the weight transport problem. Lastly, we demonstrate that the combination of these two methods can approach or exceed the accuracy of backpropagation-based methods for a variety of neuromorphic vision tasks while maintaining biological plausibility.

42 ENGINEERING↗
DOE OSTI2022

Combining Spike Time Dependent Plasticity (STDP) and Backpropagation (BP) for Robust and Data Efficient Spiking Neural Networks (SNN)

National security applications require artificial neural networks (ANNs) that consume less power, are fast and dynamic online learners, are fault tolerant, and can learn from unlabeled and imbalanced data. We explore whether two fundamentally different, traditional learning algorithms from artificial intelligence and the biological brain can be merged. We tackle this problem from two directions. First, we start from a theoretical point of view and show that the spike time dependent plasticity (STDP) learning curve observed in biological networks can be derived using the mathematical framework of backpropagation through time. Second, we show that transmission delays, as observed in biological networks, improve the ability of spiking networks to perform classification when trained using a backpropagation of error (BP) method. These results provide evidence that STDP could be compatible with a BP learning rule. Combining these learning algorithms will likely lead to networks more capable of meeting our national security missions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Backpropagated frame transformation theory: A reformulation

In this work, the energy-dependent frame transformation theory of Gao and Greene [H. Gao and C. H. Greene, Phys. Rev. A 42, 6946 (1990)] is extended to yield a quantitatively accurate description of the dissociative recombination process. Evidence is presented to show that direct application of the original theory leads to inaccurate cross sections. A major revision, based on an interaction-free backpropagation of the Born-Oppenheimer solutions, markedly improves the frame transformation theory, reducing its average error by orders of magnitude. The original theory and its extension are tested on the previously explored two-dimensional (2D) model that is tailored to describe the singlet ungerade states of molecular hydrogen. The 2D model can be solved exactly (within the numerical accuracy) without implementing the Born-Oppenheimer approximation. These exact results then serve as a benchmark for the frame transformation theory developed in this paper.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

QuCNN : A Quantum Convolutional Neural Network with Entanglement Based Backpropagation

Quantum Machine Learning continues to be a highly active area of interest within Quantum Computing. Many of these approaches have adapted classical approaches to the quantum settings, such as QuantumFlow, etc. We push forward this trend, and demonstrate an adaption of the Classical Convolutional Neural Networks to quantum systems - namely QuCNN. QuCNN is a parameterised multi-quantum-state based neural network layer computing similarities between each quantum filter state and each quantum data state. With QuCNN, back propagation can be achieved through a single-ancilla qubit quantum routine. QuCNN is validated by applying a convolutional layer with a data state and a filter state over a small subset of MNIST images, comparing the backpropagated gradients, and training a filter state against an ideal target state.

high performance computing, quantum computing↗
DOE OSTI2022

Neuromorphic Backpropagation Algorithm Software

This software is an implementation of the backpropagation algorithm for Intel's neuromorphic research processor, Loihi. The software implements the neural circuit itself and a demonstration application where the MNIST dataset (a standard test problem) is used to train a neural network.

Sornborger, Andrew↗
DOE OSTI2021

Skip-Connected Self-Recurrent Spiking Neural Networks with Joint Intrinsic Parameter and Synaptic Weight Training

As an important class of spiking neural networks (SNNs), recurrent spiking neural networks (RSNNs) possess great computational power and have been widely used for processing sequential data like audio and text. However, most RSNNs suffer from two problems. 1. Due to the lack of architectural guidance, random recurrent connectivity is often adopted, which does not guarantee good performance. 2. Training of RSNNs is in general challenging, bottlenecking achievable model accuracy. To address these problems, we propose a new type of RSNNs called Skip-Connected Self-Recurrent SNNs (ScSr-SNNs). Recurrence in ScSr-SNNs is introduced in a stereotyped manner by adding self-recurrent connections to spiking neurons. The SNNs with self-recurrent connections can realize recurrent behaviors similar to those of more complex RSNNs while the error gradients can be more straightforwardly calculated due to the mostly feedforward nature of the network. The network dynamics is enriched by skip connections between nonadjacent layers. Moreover, we propose a new backpropagation (BP) method called backpropagated intrinsic plasticity (BIP) to further boost the performance of ScSr-SNNs by training intrinsic model parameters. Unlike standard intrinsic plasticity rules that adjust the neuron's intrinsic parameters according to neuronal activity, the proposed BIP method optimizes intrinsic parameters based on the backpropagated error gradient of a well-defined global loss function in addition to synaptic weight training. Here, based on challenging speech, neuromorphic speech, and neuromorphic image datasets, the proposed ScSr-SNNs can boost performance by up to 2.85% compared with other types of RSNNs trained by state-of-the-art BP methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗
DOE OSTI2021

Modelling of a Flow-Induced Oscillation, Two-Cylinder, Hydrokinetic Energy Converter Based on Experimental Data

The VIVACE Converter consists of cylindrical oscillators in tandem subjected to transverse flow-induced oscillations (FIOs) that can be improved by varying the system parameters for a given in-flow velocity: damping, stiffness, and in-flow center-to-center spacing. Compared to a single isolated cylinder, tandem cylinders can harness more hydrokinetic energy due to synergy in FIO. Experimental and numerical methods have been utilized to analyze the FIO and energy harnessing of VIVACE. A surrogate-based model of two tandem cylinders is developed to predict the power harvesting and corresponding efficiency by introducing a backpropagation neural network. It is then utilized to reduce excessive experimental or computational testing. The effects of spacing, damping, and stiffness on harvested power and efficiency of the established prediction-model are analyzed. At each selected flow velocity, optimization results of power harvesting using the prediction-model are calculated under different combinations of damping and stiffness. The main conclusions are: (1) The surrogate model, built on extensive experimental data for tandem cylinders, can predict the cylinder oscillatory response accurately. (2) Increasing the damping ratio range from 0–0.24 to 0–0.30 is beneficial for improving power efficiency, but has no significant effect on power harvesting. (3) In galloping, a spacing ratio of 1.57 has the highest optimal harnessed power and efficiency compared with other spacing values. (4) Two tandem cylinders can harness 2.01–4.67 times the optimal power of an isolated cylinder. In addition, the former can achieve 1.46–4.01 times the efficiency of the latter. (5) The surrogate model is an efficient predictive tool defining parameters of the Converter for improved energy acquisition.

backpropagation neural network↗
DOE OSTI2022

Illumination correction of dyed fabric based on extreme learning machine with improved ant lion optimizer

Abstract In order to eliminate the influence of scene illumination on the evaluation of the color difference of dyed fabrics, this paper proposes a dyed fabric illumination correction algorithm based on the extreme learning machine (ELM) with grey wolf optimizer (GWO)‐optimized ant lion optimizer (ALO). Firstly, the Grey Edge framework is used to extract the features of the dyed fabric image as the input vector. Then, to improve the optimization ability of the ALO algorithm, the GWO algorithm is used to provide a set of optimized initial populations to the ALO algorithm, and then the improved ALO algorithm is used to optimize the parameters of the ELM. Finally, the proposed GWO‐ALO‐ELM algorithm is used to correct the illumination of the dyed fabric, and restore the graphics to the effect display under standard illumination through the diagonal reduction model. Compared with the experimental results of GWO‐ELM, ALO‐ELM, backpropagation (BP), ELM, random vector function link (RVFL), and other algorithms, it can be seen that the GWO‐ALO‐ELM algorithm proposed in this paper has good predictive value and quasi‐bias effect, and good stability.

Zhou, Zhiyu↗
DOE OSTI2024

Explainable AI classification for parton density theory

Quantitatively connecting properties of parton distribution functions (PDFs, or parton densities) to the theoretical assumptions made within the QCD analyses which produce them has been a longstanding problem in HEP phenomenology. To confront this challenge, we introduce an ML-based explainability framework, XAI4PDF, to classify PDFs by parton flavor or underlying theoretical model using ResNet-like neural networks (NNs). By leveraging the differentiable nature of ResNet models, this approach deploys guided backpropagation to dissect relevant features of fitted PDFs, identifying x-dependent signatures of PDFs important to the ML model classifications. By applying our framework, we are able to sort PDFs according to the analysis which produced them while constructing quantitative, human-readable maps locating the x regions most affected by the internal theory assumptions going into each analysis. This technique expands the toolkit available to PDF analysis and adjacent particle phenomenology while pointing to promising generalizations.

Artificial Intelligence↗
DOE OSTI2024

Topological Optimization with Big Steps

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. This relies on another contribution of this paper, which eliminates the need to examine a factorial number of permutations of simplices with the same value. Here, we present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2026

Entropy-defect synergy for dual luminescence mechanism in spinel: Time-resolved anti-counterfeiting and fingerprint visualization

Multimodal luminescent materials, while promising for anti-counterfeiting, often lack dynamic time-dependent responses and controllable spatial distribution, limiting their encryption capabilities in the spatiotemporal dimension. Here, this work presents a coordinated control strategy based on entropy and defect engineering, and uses a backpropagation (BP) neural network for material screening to successfully prepare spinel Mg 0.8 (Fe 0.04 Co 0.04 Ni 0.04 Cu 0.04 Zn 0.04 )Cr 2 O 4 (MgA 5 CO) phosphors with time-dependent dynamic luminescence behavior. This phosphor simultaneously activated the d-d transition luminescence (∼618 nm) derived from Co 2+ /Cr 3+ and the defect luminescence (∼398 nm) related to zinc vacancies (V Zn ) in a single-phase solid solution. The phosphor exhibits a time-dependent color evolution from pink to purple under fixed-wavelength excitation, due to the different excited-state dynamics and decay lifetimes associated with the d-d transition and defect luminescence. Structural characterization and spectral analysis confirmed the existence of V Zn and its significant role in defect luminescence process. The fluorescent and dynamic luminescent properties of entropy-based spinel oxide enable its use in advanced anti-counterfeiting applications like fingerprint recognition and color-changing dedicated anti-counterfeiting mark, showing promise in high-end and time-dynamic anti-counterfeiting fields. This research not only developed a new type of fluorescent dynamic anti-counterfeiting material, but also provided a new idea for constructing advanced optical functional materials with multiple luminescence mechanisms.

Defect project↗
DOE OSTI2021

Deep Learning Explicit Differentiable Predictive Control Laws for Buildings

We present a differentiable predictive control (DPC) methodology for learning constrained control laws for unknown nonlinear systems. DPC poses an approximate solution to multiparametric programming problems emerging from explicit nonlinear model predictive control (MPC). Contrary to approximate MPC, DPC does not require supervision by an expert controller. Instead, a system dynamics model is learned from a small dataset of recorded observations of the perturbed system's dynamics and the control law is optimized offline by interaction with the learned system model. The DPC method is based on two sequential steps, i) system identification using a constrained neural state-space model, and ii) optimization of an explicit control law parametrized by another neural network in closed-loop simulation with the identified neural state-space model. The combination of a differentiable closed-loop system and penalty methods for constraint handling of system outputs and inputs allows us to optimize the control law's parameters directly by backpropagating economic MPC loss through the learned system model. By incorporating domain knowledge and leveraging established techniques from optimal control, our method leverages deep neural networks as nonlinear function approximators for system identification and control while avoiding concomitant costs of intractably large datasets, and computationally expensive over-parametrized models. The scalability, data efficiency, and constrained optimal control capability of the proposed DPC method are demonstrated in simulation using a multi-zone building emulator.

Drgona, Jan↗
DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗