Table of Contents
Fetching ...

Functional connectomes of neural networks

Tananun Songdechakraiwut, Yutong Wu

TL;DR

This work proposes a brain-inspired framework for analyzing neural networks via functional connectomes and persistent graph homology, avoiding thresholding and enabling scalable topology statistics. It introduces closed-form Wasserstein distances and barycenters on persistence summaries, enabling a centroid-based clustering method (Top) that outperforms baselines on MNIST, Fashion-MNIST, and CIFAR-10. The approach yields interpretable topological signatures of how regularization and stimuli shape information flow, with runtime analysis showing scalability to large networks. The results suggest a principled, scalable path to bridging brain-connectomics and deep learning for improved interpretability and analysis.

Abstract

The human brain is a complex system, and understanding its mechanisms has been a long-standing challenge in neuroscience. The study of the functional connectome, which maps the functional connections between different brain regions, has provided valuable insights through various advanced analysis techniques developed over the years. Similarly, neural networks, inspired by the brain's architecture, have achieved notable success in diverse applications but are often noted for their lack of interpretability. In this paper, we propose a novel approach that bridges neural networks and human brain functions by leveraging brain-inspired techniques. Our approach, grounded in the insights from the functional connectome, offers scalable ways to characterize topology of large neural networks using stable statistical and machine learning techniques. Our empirical analysis demonstrates its capability to enhance the interpretability of neural networks, providing a deeper understanding of their underlying mechanisms.

Functional connectomes of neural networks

TL;DR

This work proposes a brain-inspired framework for analyzing neural networks via functional connectomes and persistent graph homology, avoiding thresholding and enabling scalable topology statistics. It introduces closed-form Wasserstein distances and barycenters on persistence summaries, enabling a centroid-based clustering method (Top) that outperforms baselines on MNIST, Fashion-MNIST, and CIFAR-10. The approach yields interpretable topological signatures of how regularization and stimuli shape information flow, with runtime analysis showing scalability to large networks. The results suggest a principled, scalable path to bridging brain-connectomics and deep learning for improved interpretability and analysis.

Abstract

The human brain is a complex system, and understanding its mechanisms has been a long-standing challenge in neuroscience. The study of the functional connectome, which maps the functional connections between different brain regions, has provided valuable insights through various advanced analysis techniques developed over the years. Similarly, neural networks, inspired by the brain's architecture, have achieved notable success in diverse applications but are often noted for their lack of interpretability. In this paper, we propose a novel approach that bridges neural networks and human brain functions by leveraging brain-inspired techniques. Our approach, grounded in the insights from the functional connectome, offers scalable ways to characterize topology of large neural networks using stable statistical and machine learning techniques. Our empirical analysis demonstrates its capability to enhance the interpretability of neural networks, providing a deeper understanding of their underlying mechanisms.

Paper Structure

This paper contains 17 sections, 7 equations, 3 figures, 2 tables.

Figures (3)

  • Figure 1: A schematic for extracting persistent graph homology, representing the topology of neural-network-derived functional connectomes.
  • Figure 2: Statistics of the functional dataset used in Study 1. Left: Sample means of the functional connectomes, averaged within each training strategy. Right: Persistence diagrams and statistics for each strategy, with thick lines representing Wasserstein barycenters and shaded regions indicating Wasserstein standard deviation.
  • Figure 3: Average runtime of each method for computing topological distance or kernel between two complete graphs. The graphs were generated using a modular network approach (details in supplementary material, with code provided). The runtime is plotted against the network size, represented by the number of nodes and edges.