Energy complexity of recurrent neural networks
From MaRDI portal
Publication:5378352
DOI10.1162/NECO_A_00579zbMATH Open1416.92020OpenAlexW1978903553WikidataQ47751171 ScholiaQ47751171MaRDI QIDQ5378352FDOQ5378352
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00579
Recommendations
- Energy-Time Tradeoff in Recurrent Neural Nets
- Energy Complexity and Entropy of Threshold Circuits
- On the Computational Power of Threshold Circuits with Sparse Activity
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Lower bounds for threshold circuits of bounded energy
Formal languages and automata (68Q45) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Title not available (Why is that?)
- Communication Complexity
- On the computational power of neural nets
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Computing with truly asynchronous threshold logic networks
- On the Computational Power of Threshold Circuits with Sparse Activity
- Energy and depth of threshold circuits
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Computational Work and Time on Finite Machines
- Efficient simulation of finite automata by neural nets
- Lower Bounds for Linear Decision Trees via an Energy Complexity Argument
- Optimal simulation of automata by neural nets
- Theory of neuromata
- Title not available (Why is that?)
- Energy and Fan-In of Threshold Circuits Computing Mod Functions
Cited In (8)
- Analog neuron hierarchy
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
- Energy-Time Tradeoff in Recurrent Neural Nets
- Computing the best-case energy complexity of satisfying assignments in monotone circuits
- Three analog neurons are Turing universal
- Quasi-periodic \(\beta\)-expansions and cut languages
- Subrecursive neural networks
This page was built for publication: Energy complexity of recurrent neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378352)
