Pith. sign in

REVIEW 1 cited by

RicciNets: Curvature-guided Pruning of High-performance Neural Networks Using Ricci Flow

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 2007.04216 v1 pith:QVFEX2H7 submitted 2020-07-08 cs.LG stat.ML

classification cs.LGstat.ML
keywords networksneuralcomputationalgraphmethodnetworkpruningrandomly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A novel method to identify salient computational paths within randomly wired neural networks before training is proposed. The computational graph is pruned based on a node mass probability function defined by local graph measures and weighted by hyperparameters produced by a reinforcement learning-based controller neural network. We use the definition of Ricci curvature to remove edges of low importance before mapping the computational graph to a neural network. We show a reduction of almost $35\%$ in the number of floating-point operations (FLOPs) per pass, with no degradation in performance. Further, our method can successfully regularize randomly wired neural networks based on purely structural properties, and also find that the favourable characteristics identified in one network generalise to other networks. The method produces networks with better performance under similar compression to those pruned by lowest-magnitude weights. To our best knowledge, this is the first work on pruning randomly wired neural networks, as well as the first to utilize the topological measure of Ricci curvature in the pruning mechanism.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Efficient PINNs via Multi-Head Unimodular Regularization of the Solutions Space

    cs.LG 2025-01 conditional novelty 4.0 of 10

    Adding a penalty on the determinant of the metric of a PINN's latent space improves transfer learning to stiffer regimes in three ODE examples.

Pith tools