On Functions Computed on Trees

DOI10.1162/neco_a_01231zbMath1494.68084arXiv1904.02309OpenAlexW3098751523WikidataQ90124197 ScholiaQ90124197MaRDI QIDQ5214392

Konrad P. Körding, Ilenna Simone Jones, Khashayar Filom, Roozbeh Farhoodi

Publication date: 7 February 2020

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.02309

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) PDEs in connection with computer science (35Q68) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

On PDE Characterization of Smooth Hierarchical Functions Computed by Neural Networks

Uses Software

• NEURON
• NeuroMorpho

Cites Work

• On the power of small-depth threshold circuits
• Majority gates vs. general weighted threshold gates
• Why does deep and cheap learning work so well?
• Connectomic constraints on computation in feedforward networks of spiking neurons
• Probabilistic lower bounds for approximation by shallow perceptron networks
• Information Processing in Dendritic Trees
• Stable architectures for deep neural networks
• On Hilbert's thirteenth problem and related questions
• A mean field view of the landscape of two-layer neural networks
• Computational Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Functions Computed on Trees