Greedy low-rank algorithm for spatial connectome regression

@inproceedings{Krschner2019GreedyLA,
  title={Greedy low-rank algorithm for spatial connectome regression},
  author={Patrick K{\"u}rschner and Sergey B. Dolgov and Kameron Decker Harris and Peter Benner},
  booktitle={Journal of mathematical neuroscience},
  year={2019}
}
  • Patrick Kürschner, Sergey B. Dolgov, +1 author Peter Benner
  • Published in
    Journal of mathematical…
    2019
  • Mathematics, Computer Science, Medicine
  • Recovering brain connectivity from tract tracing data is an important computational problem in the neurosciences. Mesoscopic connectome reconstruction was previously formulated as a structured matrix regression problem (Harris et al. in Neural Information Processing Systems, 2016), but existing techniques do not scale to the whole-brain setting. The corresponding matrix equation is challenging to solve due to large scale, ill-conditioning, and a general form that lacks a convergent splitting… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 49 REFERENCES

    Computational Methods for Linear Matrix Equations

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Truncated low-rank methods for solving general linear matrix equations

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    A mesoscale connectome of the mouse brain

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    High-resolution data-driven model of the mouse connectome

    VIEW 3 EXCERPTS

    Krylov Subspace Methods for Linear Systems with Tensor Product Structure

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL