REVIEW 2 cited by
Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology
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
read the original abstract
While many approaches to make neural networks more fathomable have been proposed, they are restricted to interrogating the network with input data. Measures for characterizing and monitoring structural properties, however, have not been developed. In this work, we propose neural persistence, a complexity measure for neural network architectures based on topological data analysis on weighted stratified graphs. To demonstrate the usefulness of our approach, we show that neural persistence reflects best practices developed in the deep learning community such as dropout and batch normalization. Moreover, we derive a neural persistence-based stopping criterion that shortens the training process while achieving comparable accuracies as early stopping based on validation loss.
Forward citations
Cited by 2 Pith papers
-
Scene Generation at Absolute Scale: Utilizing Semantic and Geometric Guidance From Text for Accurate and Interpretable 3D Indoor Scene Generation
A text-to-3D pipeline that predicts a global semantic-geometric layout, conditions panoramic and video diffusion on it, and fuses views with 3D Gaussian Splatting into an absolute-scale navigable indoor scene.
-
Topological Uncertainty for Anomaly Detection in the Neural-network EoS Inference with Neutron Star Data
Applying Topological Uncertainty to hidden-layer activations of a trained FNN detects failed neutron-star EoS inferences with over 90% success in the best-tested configuration.
Discussion (0). Sign in to comment.