paper-with-me

홈 › Papers

Fundamental bounds on learning performance in neural circuits

2018-12-31

How does the size of a neural circuit influence its learning performance? Intuitively, we expect the learning capacity of a neural circuit to grow with the number of neurons and synapses. Larger brains tend to be found in species with higher cognitive function and learning ability. Similarly, adding connections and units to artificial neural networks can allow them to solve more complex tasks. However, we show that in a biologically relevant setting where synapses introduce an unavoidable amount of noise, there is an optimal size of network for a given task. Beneath this optimal size, our analysis shows how adding apparently redundant neurons and connections can make tasks more learnable. Therefore large neural circuits can either devote connectivity to generating complex behaviors, or exploit this connectivity to achieve faster and more precise learning of simpler behaviors. Above the optimal network size, the addition of neurons and synaptic connections starts to impede learning performance. This suggests that overall brain size may be constrained by the need to learn efficiently with unreliable synapses, and may explain why some neurological learning deficits are associated with hyperconnectivity. Our analysis is independent of specific learning rules and uncovers fundamental relationships between learning rate, task performance, network size and intrinsic noise in neural circuits.

📄 PDF Abstract BibTeX arXiv:1812.11758

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Pseudo-dimension of quantum circuits

2020-02-04 · Matthias C. Caro, Ishaun Datta

We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of q…

Learning circuits with few negations

2014-10-30 · Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio 외

Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum numbe…

Learning TheoryNegation

Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits

2015-11-24 · Daniel M. Kane, Ryan Williams

In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two and three layers, a regime that has been surprisingly intractable to analyze. We prove the…

LEMMA

Learning algorithms from circuit lower bounds

2020-12-28 · Ján Pich

We revisit known constructions of efficient learning algorithms from various notions of constructive circuit lower bounds such as distinguishers breaking pseudorandom generators or efficient witnessing algorithms which f…

Effects of quantum resources on the statistical complexity of quantum circuits

2021-02-05 · Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo 외

We investigate how the addition of quantum resources changes the statistical complexity of quantum circuits by utilizing the framework of quantum resource theories. Measures of statistical complexity that we consider inc…

Learning Theory