Towards Disentangling Information Paths with Coded ResNeXt
Apostolos Avranas, Marios Kountouris
Abstract
The conventional, widely used treatment of deep learning models as black boxes provides limited or no insights into the mechanisms that guide neural network decisions. Significant research effort has been dedicated to building interpretable models to address this issue. Most efforts either focus on the high-level features associated with the last layers, or attempt to interpret the output of a single layer. In this paper, we take a novel approach to enhance the transparency of the function of the whole network. We propose a neural network architecture for classification, in which the information that is relevant to each class flows through specific paths. These paths are designed in advance before training leveraging coding theory and without depending on the semantic similarities between classes. A key property is that each path can be used as an autonomous single-purpose model. This enables us to obtain, without any additional training and for any class, a lightweight binary classifier that has at least fewer parameters than the original network. Furthermore, our coding theory based approach allows the neural network to make early predictions at intermediate layers during inference, without requiring its full evaluation. Remarkably, the proposed architecture provides all the aforementioned properties while improving the overall accuracy. We demonstrate these properties on a slightly modified ResNeXt model tested on CIFAR-10/100 and ImageNet-1k.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b1d06367-aec7-4fe1-bfff-66164a1b3e82Builds on11
- RandAugment: Practical Automated Data Augmentation with a Reduced Search SpaceEkin Dogus Cubuk, Barret Zoph, Jonathon Shlens, Quoc LeNeurIPS 2020 · 4,453 citations
- Random Erasing Data AugmentationZhun Zhong, Liang Zheng, Guoliang Kang, Shaozi Li et al.AAAI 2020 · 4,134 citations
- Concept Bottleneck ModelsPang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann et al.ICML 2020 · 1,233 citations
- BERT Loses Patience: Fast and Robust Inference with Early ExitWangchunshu Zhou, Canwen Xu, Tao Ge, Julian J. McAuley et al.NeurIPS 2020 · 473 citations
- Revisiting ResNets: Improved Training and Scaling StrategiesIrwan Bello, William Fedus, Xianzhi Du, Ekin Dogus Cubuk et al.NeurIPS 2021 · 378 citations
Related papers
- Composable Sparse Subnetworks via Maximum-Entropy PrincipleFrancesco Caso, Samuele Fonio, Simone Monaco, Nicola Saccomanno et al.ICLR 2026
- Architecture Disentanglement for Deep Neural NetworksJie Hu, Liujuan Cao, Tong Tong, Qixiang Ye et al.ICCV 2021 · 21 citations
- An In-depth Investigation of Sparse Rate Reduction in Transformer-like ModelsYunzhe Hu, Difan Zou, Dong XuNeurIPS 2024 · 4 citations
- Incremental Learning via Rate ReductionZiyang Wu, Christina Baek, Chong You, Yi MaCVPR 2021
- Convolutional Dynamic Alignment Networks for Interpretable ClassificationsMoritz Böhle, Mario Fritz, Bernt SchieleCVPR 2021
