Neural circuit model re-purposed for robotic control tasks.
problem Learning simple robotic control tasks.
method Re-purposing a biological neural circuit model to control robotic tasks using a search-based optimization algorithm.
result Neuronal Circuit Policies (NCPs) perform on par and in some cases surpass contemporary deep learning models with fewer parameters and interpretable dynamics.
Paper analyzes neural network complexity for planning problems.
problem Understanding neural network complexity for planning policies.
method Circuit complexity analysis for relational neural networks.
result Three classes of planning problems identified based on network complexity.
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 circuits optimize financial portfolios faster than classical methods.
problem Dynamic portfolio optimization in financial markets.
method Variational Quantum Circuits for reinforcement learning.
result Quantum agents outperform classical RL models in risk-adjusted performance.
SymCircuit learns PC structure via entropy-regularized RL, improving inference efficiency and accuracy.
problem Greedy algorithms in PC structure learning lead to suboptimal solutions.
method Entropy-regularized reinforcement learning to train a learned generative policy for PC structure inference.
result SymCircuit learns the optimal policy as a tempered Bayesian posterior, improving inference efficiency and accuracy.
PNCs balance tractability and expressiveness in probabilistic modeling.
problem Balancing tractability and expressiveness in probabilistic models.
method Introduce probabilistic neural circuits (PNCs) as a mix of Bayesian networks and neural networks.
result PNCs are powerful function approximators.
RL optimizes quantum circuit parameters for combinatorial problems.
problem Optimizing quantum circuit parameters for combinatorial problems.
method Reinforcement Learning (RL) to train a policy network.
result RL policy reduces optimality gap by up to 8.61.
Adversarial quantum-classical model learns and infers data faster.
problem Training quantum circuits is harder than classical neural networks.
method Coupling quantum generator with classical discriminator for training.
result Quantum circuit can infer missing data with quadratic speed up.
Quantum neural tangent kernels help understand variational quantum circuits in machine learning.
problem Designing and predicting performance of variational quantum circuits.
method Using quantum neural tangent kernels and dynamical equations for loss functions.
result Analytical solutions for training dynamics in variational quantum circuits.
New approach uses Boolean circuits to optimize neural networks.
problem Improving efficiency of neural network implementations on hardware accelerators.
method Formalized neural networks as Boolean circuits, showing binarized networks are functionally complete.
result Binarized neural networks are functionally complete, suggesting new possibilities for neural network accelerators.
Quantum algorithms speed up reinforcement learning policies in large state-action spaces.
problem Limitations of quantum access in training reinforcement learning policies.
method Designing quantum algorithms to train reinforcement learning policies.
result Quantum algorithms offer full quadratic speed-ups in sample complexity for well-behaved policies.
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.
CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.
problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.
Neural networks can learn Boolean circuits with local correlation.
problem Learning Boolean circuits with neural networks is computationally hard.
method Observing local correlation between input patterns and target labels, focusing on tree-structured Boolean circuits.
result Local correlation determines the success or failure of optimization in learning Boolean circuits.
Bayesian optimization with neural networks improves analog circuit synthesis efficiency.
problem Analog circuit synthesis optimization with improved efficiency.
method Bayesian optimization using neural networks to learn and predict circuit parameters.
result Neural-network-based Gaussian process model provides more accurate predictions and accelerates optimization.
Quantum machine learning improves hedging in finance.
problem Improving hedging strategies in financial markets.
method Developed quantum reinforcement learning methods using policy-search and distributional actor-critic algorithms.
result Quantum models reduce parameter count and achieve comparable performance to classical methods.
Pruned neural networks learn digital circuits with 99% weight reduction.
problem Efficiently train deep neural networks with minimal weights.
method Constrained binarized networks to zero or one weights.
result Pruned networks achieve similar performance to standard networks with 99% weight reduction.
Efficiently implements large-scale CNNs using memristors.
problem Implementing high-dimensional convolution in deep neural networks efficiently.
method Developed a method to convert CNN kernels to memristor-based circuits, optimized for accuracy and minimized error.
result 8-bit ADC/DAC is necessary to preserve software level classification accuracy in memristor-based CNNs.
Paper develops data-driven compact models for diodes.
problem Manual and time-consuming compact model development.
method Machine Learning techniques for automation.
result Data-driven models accurately predict diode behavior.
CSM-NN uses neural networks to speed up and improve the accuracy of logic circuit simulations.
problem Inaccurate and slow simulation of complex circuits with billions of transistors.
method Current Source Model (CSM) combined with optimized neural network structures and parallel processing.
result Reduces simulation time by up to 6x on CPUs and 15x on GPUs with less than 2% error.
Combines neural networks and logic circuits for interpretable, accurate, and cost-effective learning.
problem Lack of generalizability and interpretability in neural networks and high hardware cost in logic circuits.
method Trains a neural network, then translates it to random forests, and finally to AND-Inverter logic.
result The pipeline maintains greater accuracy and minimizes logic complexity.
Analyzes dynamics of quantum neural networks, predicting exponential decay of training error.
problem Understanding convergence rate of quantum neural networks training.
method Analytic theory for gradient descent dynamics of wide quantum neural networks.
result Simple analytic formula predicts exponential decay of training error.
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…
Bayesian model detects altered neural circuits in MCI patients.
problem Detecting altered neural circuits in Mild Cognitive Impairment patients.
method Hierarchical Bayesian recurrent state space model.
result Model discovers latent states predominantly observed in MCI patients.
Study on functions computed by deep-layered machines finds same distribution in neural networks and Boolean circuits.
problem Understanding the space of functions computed by deep-layered machines.
method Investigation of Boolean functions on random-layered machines, including neural networks and Boolean circuits.
result The space of functions computed at large depth limit is characterized and the macroscopic entropy of Boolean functions is either monotonically increasing or decreasing with depth.
Metalearned neural circuit performs inference over open classes.
problem Nonparametric Bayesian models' practical barriers in real-world applications.
method Extract inductive bias from nonparametric Bayesian model and transfer to neural network.
result Metalearned neural circuit achieves comparable or better performance than particle filter-based methods.
Deep neural networks predict CVCM track circuit failures early.
problem Subtle anomalies in CVCM track circuits lead to failures, causing disruptions.
method Deep neural networks classify anomalies before they escalate.
result Deep neural networks achieve 99.31% overall accuracy in detecting CVCM failures.
STNMF method uncovers neural circuit components in retinal ganglion cells.
problem Deciphering complex neuronal circuit components in the brain.
method Spike-triggered non-negative matrix factorization (STNMF) method.
result STNMF can detect various properties of upstream bipolar cells and recover synaptic connection strengths.
This study shows neural nets can approximate Turing machines with meaningful statistical properties.
problem Theoretical limitations in approximating Turing machines with neural networks.
method Formal definition of statistically meaningful approximation, analysis of boolean circuits and Turing machines using neural nets.
result Transformers can statistically meaningfully approximate Turing machines with polynomial sample complexity.
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 …
Deep convolutional neural networks (CNNs) have demonstrated impressive performance on visual object classification tasks. In addition, it is a useful model for predication of neuronal responses recorded in visual system. However, there is still no clear understanding of what CNNs learn in terms of visual neuronal circu…
Neural circuits integrate continuous dynamics efficiently.
problem Efficiently integrating continuous neural dynamics for simulation and learning.
method Compact neural circuits for Runge-Kutta and Adams-Bashforth-Moulton methods.
result Equivalence of neural and numerical integration for polynomial systems.
This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.
problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.
Proposes intrinsic methods to detect overfitting in models.
problem Detecting overfitting in models without relying on external test sets.
method Counterfactual Simulation (CFS) to analyze model flow through training data.
result CFS can separate models with different levels of overfit using only their logic circuit representations.
Neural circuits contain heterogeneous groups of neurons that differ in type, location, connectivity, and basic response properties. However, traditional methods for dimensionality reduction and clustering are ill-suited to recovering the structure underlying the organization of neural circuits. In particular, they do n…
A fast method for learning MZI parameters in optical neural networks.
problem Time-consuming learning of MZI parameters in optical neural networks.
method Customized complex-valued derivatives and a chain rule for Wirtinger derivatives, incorporated into a function module.
result 20 times faster learning compared to conventional AD in MNIST task.
Deep networks can be understood as logical circuits, improving interpretability and generalization.
problem Lack of interpretability in deep neural networks.
method Hierarchical decomposition of DNN discrete classification map into logical combinations of intermediate classifiers.
result Deep networks can be interpreted as logical circuits with improved generalization.
Hybrid quantum-classical RL model solves standard benchmark tasks and proves quantum advantage.
problem Challenges in reinforcement learning, especially in solving standard benchmarking tasks.
method Parametrized quantum circuits in a hybrid quantum-classical RL model.
result Demonstrates quantum advantage in solving standard benchmarking tasks and intractable classical problems.
This paper uses RNN to speed up high-speed channel simulation.
problem Computational intensity of generating eye diagrams in high-speed channels.
method Trains a recurrent neural network (RNN) to generate black-box macromodels.
result Reduces computation time significantly without complex simulations.
RNNs trained on head direction task mimic brain's compass and shifter neurons.
problem Modeling brain's head direction system using neural networks.
method Optimized recurrent neural networks trained on angular velocity integration.
result RNNs naturally emerge with compass and shifter neuron-like properties.
Motivated by the resurgence of neural networks in being able to solve complex learning tasks we undertake a study of high depth networks using ReLU gates which implement the function x↦max{0,x}. We try to understand the role of depth in such neural networks by showing size lowerbounds against such network …
Paper proposes machine learning to optimize QAOA for combinatorial problems.
problem Optimizing QAOA parameters for solving combinatorial optimization problems.
method Develops two machine learning approaches: RL and KDE to learn optimal QAOA parameters.
result Reduces optimality gap by up to 30.15 compared to other optimizers.
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.
Complex architectures of biological neural circuits, such as parallel processing pathways, has been behaviorally implicated in many cognitive studies. However, the theoretical consequences of circuit complexity on neural computation have only been explored in limited cases. Here, we introduce a mechanism by which direc…
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.
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.
A new SNN learning algorithm for energy-efficient VLSI circuits.
problem Designing energy-efficient SNNs for VLSI implementation.
method Temporal coding, analog VLSI, resistive memory.
result Classification accuracy comparable to state-of-the-art temporal coding SNN algorithms.