Pith. sign in

REVIEW 1 cited by

A Differentiable Framework for End-to-End Learning of Hybrid Structured Compression

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 2309.13077 v1 pith:HUMBPZ5Z submitted 2023-09-21 cs.LG cs.AIeess.IV

classification cs.LGcs.AIeess.IV
keywords compressionstructuredframeworkselectiontechniquesfilterhybridlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Filter pruning and low-rank decomposition are two of the foundational techniques for structured compression. Although recent efforts have explored hybrid approaches aiming to integrate the advantages of both techniques, their performance gains have been modest at best. In this study, we develop a \textit{Differentiable Framework~(DF)} that can express filter selection, rank selection, and budget constraint into a single analytical formulation. Within the framework, we introduce DML-S for filter selection, integrating scheduling into existing mask learning techniques. Additionally, we present DTL-S for rank selection, utilizing a singular value thresholding operator. The framework with DML-S and DTL-S offers a hybrid structured compression methodology that facilitates end-to-end learning through gradient-base optimization. Experimental results demonstrate the efficacy of DF, surpassing state-of-the-art structured compression methods. Our work establishes a robust and versatile avenue for advancing structured compression techniques.

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. LinDeps: A Fine-tuning Free Post-Pruning Method to Remove Layer-Wise Linear Dependencies with Guaranteed Performance Preservation

    cs.CV 2025-07 conditional novelty 6.0 of 10

    A post-pruning method uses pivoted QR decomposition to delete linearly dependent CNN filters and least-squares kernel adjustment to preserve output, gaining small extra compression without fine-tuning.

Pith tools