Guardado en:
Detalles Bibliográficos
Autores principales: Kodama, Nathan X., Loparo, Kenneth A.
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:https://arxiv.org/abs/2508.16776
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912551185416192
author Kodama, Nathan X.
Loparo, Kenneth A.
author_facet Kodama, Nathan X.
Loparo, Kenneth A.
contents Inferring temporal interaction graphs and higher-order structure from neural signals is a key problem in building generative models for systems neuroscience. Foundation models for large-scale neural data represent shared latent structures of neural signals. However, extracting interpretable latent graph representations in foundation models remains challenging and unsolved. Here we explore latent graph learning in generative models of neural signals. By testing against numerical simulations of neural circuits with known ground-truth connectivity, we evaluate several hypotheses for explaining learned model weights. We discover modest alignment between extracted network representations and the underlying directed graphs and strong alignment in the co-input graph representations. These findings motivate paths towards incorporating graph-based geometric constraints in the construction of large-scale foundation models for neural data.
format Preprint
id arxiv_https___arxiv_org_abs_2508_16776
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Latent Graph Learning in Generative Models of Neural Signals
Kodama, Nathan X.
Loparo, Kenneth A.
Machine Learning
Inferring temporal interaction graphs and higher-order structure from neural signals is a key problem in building generative models for systems neuroscience. Foundation models for large-scale neural data represent shared latent structures of neural signals. However, extracting interpretable latent graph representations in foundation models remains challenging and unsolved. Here we explore latent graph learning in generative models of neural signals. By testing against numerical simulations of neural circuits with known ground-truth connectivity, we evaluate several hypotheses for explaining learned model weights. We discover modest alignment between extracted network representations and the underlying directed graphs and strong alignment in the co-input graph representations. These findings motivate paths towards incorporating graph-based geometric constraints in the construction of large-scale foundation models for neural data.
title Latent Graph Learning in Generative Models of Neural Signals
topic Machine Learning
url https://arxiv.org/abs/2508.16776