Gradient model for memristive systems in neurophysiology and neuromorphic circuits.
problem Understanding and modeling memristive systems.
method Introducing a gradient modeling framework based on Chua's definition of memristive elements.
result Gradient properties of memristive systems have implications for neuromorphic circuit analysis and design.
This thesis optimizes neuromorphic systems by slowing down their dynamics, improving performance.
problem Timescale mismatch between analog neuromorphic circuits and real-time sensory inputs.
method Proposes and tests solutions to slow down the dynamics of spiking neural networks.
result Spiking neural networks on analog neuromorphic systems can achieve significant performance boosts.
VOWEL trains WTA-SNNs for multi-valued events, overcoming resource limitations.
problem Training WTA-SNNs for multi-valued events is challenging due to non-differentiability and recurrent behavior.
method Develops a variational online local training rule (VOWEL) for WTA-SNNs using local pre- and post-synaptic information and a common reward signal.
result VOWEL outperforms conventional binary SNNs in real-world neuromorphic datasets with multi-valued events.
Study noise in inference to improve accuracy and security.
problem Noise in inference affects deep learning systems' accuracy and security.
method Noise-injected training and voting method for improving accuracy; defensive architecture for adversarial attacks.
result Significant improvement in accuracy and robustness against attacks.
SNRA combines power-efficient probabilistic and deterministic computing for deep belief networks.
problem Efficiently training and evaluating deep belief networks with low power consumption.
method Developed a spintronic neuromorphic reconfigurable array (SNRA) for in-circuit training and evaluation of deep belief networks (DBNs). Used probabilistic spin logic devices and a four-state finite state machine for unsupervised training.
result SNRA achieves more than 80% reduction in combined dynamic and static power dissipation compared to SRAM-based configurable fabrics.
How spiking networks are able to perform probabilistic inference is an intriguing question, not only for understanding information processing in the brain, but also for transferring these computational principles to neuromorphic silicon circuits. A number of computationally powerful spiking network models have been pro…
A brain-inspired spiking Transformer reduces energy consumption and enhances interpretability.
problem Energy inefficiency and lack of interpretability in Transformer models.
method Spiking STDP Transformer using spike-timing-dependent plasticity (STDP) for self-attention.
result Achieves 94.35% and 78.08% accuracy on CIFAR-10 and CIFAR-100 datasets respectively, with 88.47% energy reduction.
We explore the robustness of recurrent neural networks when the computations within the network are noisy. One of the motivations for looking into this problem is to reduce the high power cost of conventional computing of neural network operations through the use of analog neuromorphic circuits. Traditional GPU/CPU-cen…
Python scripts analyze MRAM-based neuromorphic devices' process variation impacts on machine learning accuracy.
problem Impact of process variation on MRAM-based neuromorphic devices' performance in machine learning applications.
method Developed transportable Python scripts to analyze output variation under changes in device dimensions.
result Revealed impacts and limits for processing variation of device fabrication on energy vs. accuracy tradeoffs.
New method converts ANN gates to SNNs with AMOS neurons for improved image classification.
problem Efficiently converting ANN gates to SNNs for neuromorphic hardware.
method Introducing AMOS conversion for gates in ANNs, improving accuracy and throughput.
result Improved accuracy of SNNs for ImageNet from 74.60% to 80.97%.
New method uses surrogate gradients to train efficient spiking networks on neuromorphic hardware.
problem Training high-performing spiking networks on analog neuromorphic hardware is challenging due to device mismatch and lack of efficient algorithms.
method Introduces a general in-the-loop learning framework based on surrogate gradients.
result Learning self-corrects for device mismatch, resulting in competitive spiking network performance.
Paper reviews neuromorphic engineering features and compares analog vs digital systems.
problem Lack of consensus and unclear features in neuromorphic engineering.
method Review of recent work, comparison of machine learning accelerator chips.
result Analog processing and reduced bit precision architectures offer best efficiencies.
A new model uses 'ghost units' to enable efficient backpropagation in deep neural networks.
problem How to achieve efficient backpropagation in deep neural networks with biological plausibility.
method Introduces 'ghost units' to cancel feedback, enabling efficient error backpropagation.
result Demonstrates that the model can approximate error gradients and achieve good performance on classification tasks.
Loihi neuromorphic chip outperforms conventional hardware in keyword spotting efficiency.
problem Benchmarking keyword spotting efficiency on neuromorphic hardware.
method Comparative analysis of a two-layer neural network trained to recognize a single phrase on Intel's Loihi neuromorphic chip and conventional hardware devices.
result Loihi outperforms conventional hardware on energy cost per inference for this keyword spotting application.
A learning rule for first-spike times in neural networks reduces energy consumption and reaction times.
problem Energy efficiency and reaction time in neuromorphic systems.
method Derivation of a learning rule for first-spike times in leaky integrate-and-fire neurons, using only input and output spike times.
result Demonstrated that the approach can implement error backpropagation in hierarchical spiking networks and is capable of harnessing neuromorphic system's speed and energy characteristics.
SNNs optimize cross-market portfolios with neuromorphic computing, reducing computational overhead and improving returns.
problem Complex cross-market portfolio optimization with high-frequency, multi-dimensional datasets.
method Leaky Integrate-and-Fire neuron dynamics, adaptive thresholding, spike-timing-dependent plasticity, lateral inhibition, hierarchical clustering, population-based spike encoding, multiple decoding strategies.
result SNNs deliver superior risk-adjusted returns and reduced volatility compared to ANN benchmarks, with improved computational efficiency.
A neuron is a basic physiological and computational unit of the brain. While much is known about the physiological properties of a neuron, its computational role is poorly understood. Here we propose to view a neuron as a signal processing device that represents the incoming streaming data matrix as a sparse vector of …
Optimizes neuromorphic learning rules for specific tasks.
problem Understanding and fine-tuning learning rules for specific tasks.
method Integrates learning process into network, uses DeepHyper for optimization.
result Optimal learning rules can be dataset-dependent.
Improves energy efficiency of neuromorphic hardware by optimizing memory organization and encoding schemes.
problem Energy inefficiency in neuromorphic hardware, especially in digital accelerators.
method Synthesized controller and memory for different encoding schemes, introduced functional encoding for structured connectivity.
result Functional encoding offers a 58% reduction in energy for weight updates in convolutional layers.
Despite being originally inspired by the central nervous system, artificial neural networks have diverged from their biological archetypes as they have been remodeled to fit particular tasks. In this paper, we review several possibilites to reverse map these architectures to biologically more realistic spiking networks…
The paper introduces a new probabilistic model for SNNs with causal and lateral dependencies.
problem Training models with complex dependencies in neuromorphic computing.
method Hybrid directed-undirected graphical representation and distributed learning rules for Maximum Likelihood and Bayesian criteria.
result The model can handle arbitrary alphabets and both causal and instantaneous dependencies in synaptic time series.
ConformalHDC improves HDC's uncertainty quantification for neuromorphic learning.
problem Lack of rigorous uncertainty quantification in Hyperdimensional Computing.
method Combines conformal prediction with HDC's efficiency, proposing set-valued and point-valued formulations.
result Demonstrates improved robustness and accuracy in decoding neural stimulus information.
Neuromorphic column performs online unsupervised clustering.
problem Real-time clustering of streaming data.
method Localized, spike timing-dependent plasticity (STDP) neural column.
result Prototype column performs similarly to k-means clustering.
Low precision networks in the reinforcement learning (RL) setting are relatively unexplored because of the limitations of binary activations for function approximation. Here, in the discrete action ATARI domain, we demonstrate, for the first time, that low precision policy distillation from a high precision network pro…
High-speed model accurately simulates neuromorphic devices.
problem Accurately modeling stochastic synapses in large-scale neuromorphic systems.
method Generative vector autoregressive model based on resistive memory cell data.
result Fast, high-throughput model reproduces synaptic parameters and correlations.
Study evaluates capacity and trainability of parametrized quantum circuits.
problem Finding the best type of circuits for hybrid quantum-classical algorithms.
method Geometric structure of parameter space, effective quantum dimension, and circuit expressiveness.
result Identifies a transition in quantum geometry leading to decay of quantum natural gradient for deep circuits.
The paper tests if LLMs' capabilities are executed by small subnetworks (circuits).
problem Understanding how LLMs execute their capabilities.
method Formalized criteria for circuits, developed hypothesis tests, applied to six circuits.
result Synthetic circuits align with idealized properties, while Transformer circuits vary in their alignment.
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
New framework boosts neural network performance and resilience.
problem Susceptibility of compact neural network implementations to system disturbances.
method Realistic crossbar simulations and Mosaics framework to re-use synaptic connections.
result Compact neural networks are noise-immune and perform well under disturbances.
Sleep-based regularization stabilizes STDP in recurrent neural networks.
problem Pathological weight dynamics in recurrent SNNs.
method Periodic offline phases with stochastic decay and spontaneous activity.
result Sleep-based renormalization prevents weight saturation and preserves learned structure.
Study detects if a circuit bounds a disc using curve intersections.
problem Determining if a circuit bounds an embedded disc.
method Analyzing the group generated by Dehn twists about curves in a circuit.
result Cycle relation between Dehn twists detects disc-boundability.
Evolutionary strategy optimizes quantum circuit design and parameters.
problem Optimizing quantum circuit design and parameters for NISQ devices.
method Simple evolutionary strategy to optimize both circuit architecture and parameters.
result Minor slowdown on actual quantum hardware compared to simulations, with insights into mutation operations.
This work uses SVM to identify track component failures in AC Track Circuits.
problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.
The statistical complexity of quantum circuits is studied using Rademacher complexity.
problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. O…
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
Machine learning identifies key metabolic control circuits in bacterial pathways.
problem Identifying regulated metabolic pathways in bacteria.
method Machine learning approach analyzing multi-omics data.
result Identification of E. coli Glycolysis regulatory circuits.
A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
Enhances SNNs for spatio-temporal feature extraction.
problem Insufficient temporal dependencies in existing SNN synaptic structures.
method Integrates temporal convolution and attention mechanisms into synaptic connections.
result Improves SNN performance on classification tasks.
Study bounds VAR model's circuit complexity, showing it's limited to TC^0 circuits.
problem Understanding the limitations of the Visual AutoRegressive model.
method Established circuit complexity bounds for the VAR model.
result VAR model is equivalent to a TC^0 threshold circuit with hidden dimension ≤ O(n).
Study shows limitations and possibilities of learning quantum circuit output distributions.
problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.
This work uses variational quantum circuits for deep reinforcement learning.
problem Intractability of deep quantum circuits on existing quantum computing platforms.
method Reshaping classical deep reinforcement learning algorithms into variational quantum circuits and using quantum information encoding.
result First proof-of-principle demonstration of variational quantum circuits for deep reinforcement learning.
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …
We constructed an analog electrical circuit which generates fluctuations in which probability density function has power law tails. In the circuit fluctuations with an arbitrary exponent of the power law can be obtained by adjusting the resistance. With this low cost circuit the random fluctuations which have the simil…
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
New algorithm learns uncertainty for edge devices.
problem Uncertainty handling for edge devices in critical applications.
method e-prop 1 algorithm with Broadcast Alignment and local information.
result Algorithm can learn uncertainty locally, improving decision-making.