Efficient Search for Circuit Structure by ‘Smooth-Index’ Matrix-Reordering

Abstract

AbstractVolume electron microscopy together with computer-based image analysis are yielding neural circuit diagrams of ever larger regions of the brain [1-10]. These datasets are usually represented in a cell-to-cell connectivity matrix and contain important information about prevalent circuit motifs allowing to directly test various theories on the computation in that brain structure [11,12]. Of particular interest are the detection of cell assemblies and the quantification of feedback, which can profoundly change circuit properties. While the ordering of cells along the rows and columns doesn’t change the connectivity, it can make special connectivity patterns recognizable. For example, ordering the cells along the flow of information, feedback and feedforward connections are segregated above and below the main matrix diagonal, respectively. Different algorithms are used to renumber matrices such as to minimize a given cost function, but either their performance becomes unsatisfying at a given size of the circuit or the CPU time needed to compute them scales in an unfavorable way with increasing number of neurons [13-15]. Based on previous ideas [16-18], we describe an algorithm which is effective in matrix reordering with respect to both its performance as well as to its scaling in computing time. Rather than trying to reorder the matrix in discrete steps, the algorithm transiently assigns a real-valued parameter to each cell describing its location on a continuous axis (‘smooth-index’) and finds the parameter set that minimizes the cost. We find that the smooth-index algorithm outperforms all algorithms we compared it to, including those based on topological sorting.Author SummaryConnectomic data provide researchers with neural circuit diagrams of ever larger regions of the brain. These datasets are usually represented in a cell-to-cell connectivity matrix and contain important information about prevalent circuit motifs. Such motifs, however, only become visible if the connectivity matrix is reordered appropriately. For example, ordering the cells along the flow of information, feedback and feedforward connections are segregated above and below the main matrix diagonal, respectively. While most previous approaches rely on topological sorting, our method treats the discrete vertex indices as real numbers (‘smooth-index’) along independent parameter axes and defines a differentiable cost function, thus, allowing gradient-based algorithms to find a minimum. The parameter set at this minimum is then re-discretized to reorder the connectivity matrix accordingly. We find our method to scale favorably with the circuit size and to outperform all algorithms we compared it to.