Pith. sign in

REVIEW 3 cited by

Topological Data Analysis for Neural Network Analysis: A Comprehensive Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.05840 v2 pith:QRXF5QDR submitted 2023-12-10 cs.LG math.AT

classification cs.LGmath.AT
keywords neuralanalysistopologicaldatainformationnetworknetworkssurvey
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This survey provides a comprehensive exploration of applications of Topological Data Analysis (TDA) within neural network analysis. Using TDA tools such as persistent homology and Mapper, we delve into the intricate structures and behaviors of neural networks and their datasets. We discuss different strategies to obtain topological information from data and neural networks by means of TDA. Additionally, we review how topological information can be leveraged to analyze properties of neural networks, such as their generalization capacity or expressivity. We explore practical implications of deep learning, specifically focusing on areas like adversarial detection and model selection. Our survey organizes the examined works into four broad domains: 1. Characterization of neural network architectures; 2. Analysis of decision regions and boundaries; 3. Study of internal representations, activations, and parameters; 4. Exploration of training dynamics and loss functions. Within each category, we discuss several articles, offering background information to aid in understanding the various methodologies. We conclude with a synthesis of key insights gained from our study, accompanied by a discussion of challenges and potential advancements in the field.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How fine a change can moments see? A scale law for detecting distribution shift, with a kernel calibration rule

    stat.ML 2026-08 conditional novelty 7.0 of 10

    Moment-based detection of an epsilon-scale, mass-f distribution change requires polynomial degree at least log(1/f)/(2 epsilon), which yields a bandwidth rule for kernel shift tests.

  2. Recursive Computation of Path Homology for Stratified Digraphs

    cs.CG 2024-12 accept novelty 7.0 of 10

    A layer-by-layer recursive algorithm computes the full-depth path homology of stratified digraphs, with large speedups over the general algorithm for deep feedforward networks.

  3. Topology of Out-of-Distribution Examples in Deep Neural Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    Out-of-distribution images show longer average H0 persistence lifetimes in a ResNet18 embedding layer than in-distribution training and test images.

Pith tools