This speedup allows for the estimation of increasingly large-scale connectomes across taxa as these data become available from tracing experiments. We find that the method is significantly faster than previous methods and that moderate ranks offer a good approximation. The performance of the method is evaluated on three examples: an artificial “toy” dataset and two whole-cortex instances using data from the Allen Mouse Brain Connectivity Atlas. We have had to design judicious stopping criteria and employ efficient solvers for the three main sub-problems of the algorithm, including an efficient GPU implementation that alleviates the main bottleneck for large datasets. This algorithm was described previously (Kressner and Sirković in Numer Lin Alg Appl 22(3):564–583, 2015) but never implemented for this connectome problem, leading to a number of challenges. The algorithm approximates the solution by a sequence of rank-one updates which exploit the sparse and positive definite problem structure. We propose a greedy low-rank algorithm for the connectome reconstruction problem in very high dimensions. The corresponding matrix equation is challenging to solve due to large scale, ill-conditioning, and a general form that lacks a convergent splitting. in Neural Information Processing Systems, 2016), but existing techniques do not scale to the whole-brain setting. Mesoscopic connectome reconstruction was previously formulated as a structured matrix regression problem (Harris et al. Recovering brain connectivity from tract tracing data is an important computational problem in the neurosciences.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |