Pith. sign in

REVIEW 2 cited by

Optimal Brain Connection: Towards Efficient Structural Pruning

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 2508.05521 v1 pith:Z32YH2Y7 submitted 2025-08-07 cs.CV

Optimal Brain Connection: Towards Efficient Structural Pruning

classification cs.CV
keywords pruningstructuralbrainconnectioncriterionoptimalparametersequivalent
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Structural pruning has been widely studied for its effectiveness in compressing neural networks. However, existing methods often neglect the interconnections among parameters. To address this limitation, this paper proposes a structural pruning framework termed Optimal Brain Connection. First, we introduce the Jacobian Criterion, a first-order metric for evaluating the saliency of structural parameters. Unlike existing first-order methods that assess parameters in isolation, our criterion explicitly captures both intra-component interactions and inter-layer dependencies. Second, we propose the Equivalent Pruning mechanism, which utilizes autoencoders to retain the contributions of all original connection--including pruned ones--during fine-tuning. Experimental results demonstrate that the Jacobian Criterion outperforms several popular metrics in preserving model performance, while the Equivalent Pruning mechanism effectively mitigates performance degradation after fine-tuning. Code: https://github.com/ShaowuChen/Optimal_Brain_Connection

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. CoCurve: Cross-Module Co-Pruning Curvature for Training-Free Structured LLM Pruning

    cs.LG 2026-07 conditional novelty 6.0

    A training-free joint attention+FFN pruning method whose Fisher-derived interaction matrix, recovered from M single-unit ablations as a Gram product, beats node-only saliency baselines on 3B–24B models.

  2. STARFISH: faST Accuracy Recovery in pruned networks From Internal State Healing

    cs.LG 2026-05 unverdicted novelty 5.0

    STARFISH recovers accuracy in pruned neural networks by optimizing internal state alignment to the original model with a minimal unlabeled calibration set, outperforming prior recovery methods especially at high pruni...