SearcharxivSearch

arXiv subjects

Armen Stepanyants

Publications and source records attributed to Armen Stepanyants.

3 recordsLinked to original sources

Sparse learning enabled by constraints on connectivity and function

Sparse connectivity is a hallmark of the brain and a desired property of artificial neural networks. It promotes energy efficiency, simplifies training, and enhances the robustness of network function. Thus, a detailed understanding of how to achieve sparsity without jeopardizing network performance is beneficial for neuroscience, deep learning, and neuromorphic computing applications. We used an exactly solvable model of associative learning to evaluate the effects of various sparsity-inducing constraints on connectivity and function. We determine the optimal level of sparsity achieved by the $l_0$ norm constraint and find that nearly the same efficiency can be obtained by eliminating weak connections. We show that this method of achieving sparsity can be implemented online, making it compatible with neuroscience and machine learning applications.

cond-mat.dis-nn

Has the Brain Maximized its Information Storage Capacity?

Learning and memory may rely on the ability of neuronal circuits to reorganize by dendritic spine remodeling. We have looked for geometrical parameters of cortical circuits, which maximize information storage capacity associated with this mechanism. In particular, we calculated optimal volume fractions of various neuropil components. The optimal axonal and dendritic volume fractions are not significantly different from anatomical measurements in the mouse and rat neocortex, and the rat hippocampus. This has led us to propose that the maximization of information storage capacity associated with dendritic spine remodeling may have been an important driving force in the evolution of the cortex.

physics.bio-ph

Branching Law for Axons

What determines the caliber of axonal branches? We pursue the hypothesis that the axonal caliber has evolved to minimize signal propagation delays, while keeping arbor volume to a minimum. We show that for a general cost function the optimal diameters of mother ($d_0$) and daughter ($d_1$, $d_2$) branches at a bifurcation obey a branching law: $d_{0}^{ν+2}=d_{1}^{ν+2} + d_{2}^{ν+2}$. The derivation relies on the fact that the conduction speed scales with the axon diameter to the power $ν$ ($ν=1$ for myelinated axons and $ν=0.5$ for non-myelinated axons). We test the branching law on the available experimental data and find a reasonable agreement.

physics.bio-ph