DFPC: Data flow driven pruning of coupled channels without data

Tanay Narshana, C. Murti, Chiranjib Bhattacharyya
2/12/2026

No official code found. Best implementation: TanayNarshana/DFPC-Pruning (15 stars, MIT, last commit 2023-08-25).

Semantic Scholar

Code Implementations(1)

TanayNarshana/DFPC-PruningCommunity68%
MIT

[ICLR 2023] PyTorch code for DFPC: Data flow driven pruning of coupled channels without data.

151PythonMar 25, 20233 years agoMIT

Similar Papers

FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning

73% match1 repo22024

Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraint

72% match2024

Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck Principle

71% match1 repo192026

Pick-or-Mix: Dynamic Channel Sampling for ConvNets

71% match1 repo132026

Diversity-Aware Channel Pruning for StyleGAN Compression

70% match1 repo262026

Structural Alignment for Network Pruning through Partial Regularization

70% match2026

Cite this paper

@article{narshana2026dfpc,
  title  = {DFPC: Data flow driven pruning of coupled channels without data},
  author = {Tanay Narshana and C. Murti and Chiranjib Bhattacharyya},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:57a2f56f2f44de8ab892c4e8c3f1744530a55399},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/57a2f56f2f44de8ab892c4e8c3f1744530a55399.svg)](https://codeofpaper.com/paper/57a2f56f2f44de8ab892c4e8c3f1744530a55399)

Discussion