Autoencoder networks extract latent variables and encode these variables in their connectomes.

Autoencoder Connectome Dimensionality reduction Identifiability Latent variable encoding

Journal

Neural networks : the official journal of the International Neural Network Society
ISSN: 1879-2782
Titre abrégé: Neural Netw
Pays: United States
ID NLM: 8805018

Informations de publication

Date de publication:
Sep 2021
Historique:
received: 01 10 2020
revised: 02 03 2021
accepted: 08 03 2021
pubmed: 7 5 2021
medline: 7 10 2021
entrez: 6 5 2021
Statut: ppublish

Résumé

Advances in electron microscopy and data processing techniques are leading to increasingly large and complete microscale connectomes. At the same time, advances in artificial neural networks have produced model systems that perform comparably rich computations with perfectly specified connectivity. This raises an exciting scientific opportunity for the study of both biological and artificial neural networks: to infer the underlying circuit function from the structure of its connectivity. A potential roadblock, however, is that - even with well constrained neural dynamics - there are in principle many different connectomes that could support a given computation. Here, we define a tractable setting in which the problem of inferring circuit function from circuit connectivity can be analyzed in detail: the function of input compression and reconstruction, in an autoencoder network with a single hidden layer. Here, in general there is substantial ambiguity in the weights that can produce the same circuit function, because largely arbitrary changes to input weights can be undone by applying the inverse modifications to the output weights. However, we use mathematical arguments and simulations to show that adding simple, biologically motivated regularization of connectivity resolves this ambiguity in an interesting way: weights are constrained such that the latent variable structure underlying the inputs can be extracted from the weights by using nonlinear dimensionality reduction methods.

Identifiants

pubmed: 33957382
pii: S0893-6080(21)00090-3
doi: 10.1016/j.neunet.2021.03.010
pii:
doi:

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

IM

Pagination

330-343

Informations de copyright

Copyright © 2021 Elsevier Ltd. All rights reserved.

Déclaration de conflit d'intérêts

Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Auteurs

Matthew Farrell (M)

Applied Mathematics Department, University of Washington, Seattle, WA, United States of America; Computational Neuroscience Center, University of Washington, Seattle, WA, United States of America. Electronic address: msf9@uw.edu.

Stefano Recanatesi (S)

Computational Neuroscience Center, University of Washington, Seattle, WA, United States of America.

R Clay Reid (RC)

Allen Institute for Brain Science, Seattle, WA, United States of America.

Stefan Mihalas (S)

Allen Institute for Brain Science, Seattle, WA, United States of America.

Eric Shea-Brown (E)

Applied Mathematics Department, University of Washington, Seattle, WA, United States of America; Computational Neuroscience Center, University of Washington, Seattle, WA, United States of America; Allen Institute for Brain Science, Seattle, WA, United States of America.

Articles similaires

Unsupervised learning for real-time and continuous gait phase detection.

Dollaporn Anopas, Yodchanan Wongsawat, Jetsada Arnin
1.00
Humans Gait Neural Networks, Computer Unsupervised Machine Learning Walking
Humans Shoulder Fractures Tomography, X-Ray Computed Neural Networks, Computer Female
Humans Artificial Intelligence Neoplasms Prognosis Image Processing, Computer-Assisted
Humans Deep Learning Mouth Neoplasms Drug Resistance, Neoplasm Cell Line, Tumor

Classifications MeSH