1 / 9

Towards Neuromorphic Complexity Analysis Johan Kwisthout

Towards Neuromorphic Complexity Analysis Johan Kwisthout. Towards neuromorphic complexity analysis. Where do we fit? What sort of problems are efficiently solvable on a neuromorphic computer?

nakitac
Download Presentation

Towards Neuromorphic Complexity Analysis Johan Kwisthout

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Towards Neuromorphic Complexity Analysis Johan Kwisthout

  2. Towards neuromorphic complexity analysis • Where do we fit? • What sort of problems are efficiently solvable on a neuromorphic computer? • Are these problems different / the same as the problems efficiently solvable on a Von Neumann architecture? • Are we asking the right questions? • What do we mean with “efficiently solvable” in this context? Time-efficient, space-efficient, or energy-efficient? • Do our current models of computation (Turing machines) suffice to answer these questions?

  3. Rationale Non-van Neumann architecture Energy as bounded resource Analog / spiking behavior Noise/randomness as resource

  4. Rationale Non-van Neumann architecture Energy as bounded resource Analog / spiking behavior Noise/randomness as resource

  5. Rationale Non-van Neumann architecture Energy as bounded resource Analog / spiking behavior Noise/randomness as resource

  6. Rationale Non-van Neumann architecture Energy as bounded resource Analog / spiking behavior Noise/randomness as resource

  7. Proposed computational framework • Key aspects are there: • Co-located memory & computation • Learning and adaptation • Noise used as resource for sampling • Spiking behavior • Fruitful  firmly rooted in large body of theory

  8. Open issues and research questions • Relationship with traditional models • Probabilistic Turing machines • Thresholds circuits with energy complexity • Complexity classes, hardness criteria • Existence of energy-hard problems? • Structural complexity theory • Reductions between classes • Inclusions, proving hardness • Notions of acceptance criteria • Stability of distribution • Time to convergence • Energy limitations

  9. Conclusion • DoE 2016 workshop report, p. 29: “…likely that an entirely new computational theory paradigm will need to be defined in order to encompass the computational abilities of neuromorphic systems” • Application: • Describe what sort of problems can and cannot be solved tractably on neuromorphic hardware • Describe fundamental limits of the brain’s (cognitive) capacity given the available resources • Open for feedback/suggestions – work in progress!

More Related