mlsanityData to 14 Oct 2026

Searching for Network Width with Bilaterally Coupled Network

arXiv 2203.13714 ↗First posted 25 Mar 2022cs.CV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Searching for a more compact network width recently serves as an effective way of channel pruning for the deployment of convolutional neural networks (CNNs) under hardware constraints. To fulfill the searching, a one-shot supernet is usually leveraged to efficiently evaluate the performance wrt~different network widths. However, current methods mainly follow a textitunilaterally augmented (UA) principle for the evaluation of each width, which induces the training unfairness of channels in supernet. In this paper, we introduce a new supernet called Bilaterally Coupled Network (BCNet) to address this issue. In BCNet, each channel is fairly trained and responsible for the same amount of network widths, thus each network width can be evaluated more accurately. Besides, we propose to reduce the redundant search space and present the BCNetV2 as the enhanced supernet to ensure rigorous training fairness over channels. Furthermore, we leverage a stochastic complementary strategy for training the BCNet, and propose a prior initial population sampling method to boost the performance of the evolutionary search. We also propose the first open-source width benchmark on macro structures named Channel-Bench-Macro for the better comparison of width search algorithms. Extensive experiments on benchmark CIFAR-10 and ImageNet datasets indicate that our method can achieve state-of-the-art or competing performance over other baseline methods. Moreover, our method turns out to further boost the performance of NAS models by refining their network widths. For example, with the same FLOPs budget, our obtained EfficientNet-B0 achieves 77.53% Top-1 accuracy on ImageNet dataset, surpassing the performance of original setting by 0.65%.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 50 of its 67 references that are in the map. First posted on arXiv 25 Mar 2022.

Builds on

50 of 67 references.

References · 50

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  5. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
  6. 2016Feature Pyramid Networks for Object Detectioncited by 5,036
  7. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  8. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  9. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  10. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  11. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  12. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 673
38 more
  1. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
  2. 2018Rethinking the Value of Network Pruningcited by 599
  3. 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 416
  4. 2019GhostNet: More Features from Cheap Operationscited by 410
  5. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  6. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  7. 2019NAS-Bench-101: Towards Reproducible Neural Architecture Searchcited by 344
  8. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  9. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
  10. 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
  11. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  12. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  13. 2019FairNAS: Rethinking Evaluation Fairness of Weight Sharing Neural Architecture Searchcited by 130
  14. 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
  15. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  16. 2020NATS-Bench: Benchmarking NAS Algorithms for Architecture Topology and Sizecited by 98
  17. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 93
  18. 2018Channel Gating Neural Networkscited by 80
  19. 2019Network Pruning via Transformable Architecture Searchcited by 80
  20. 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
  21. 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
  22. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
  23. 2020GreedyNAS: Towards Fast One-Shot NAS with Greedy Supernetcited by 69
  24. 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 69
  25. 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
  26. 2020Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNetscited by 49
  27. 2020ISTA-NAS: Efficient and Consistent Neural Architecture Search by Sparse Codingcited by 36
  28. 2020Hit-Detector: Hierarchical Trinity Architecture Search for Object Detectioncited by 32
  29. 2021Towards Improving the Consistency, Efficiency, and Flexibility of Differentiable Neural Architecture Searchcited by 27
  30. 2021Locally Free Weight Sharing for Network Width Searchcited by 27
  31. 2021BCNet: Searching for Network Width with Bilaterally Coupled Networkcited by 23
  32. 2017General Heuristics for Nonconvex Quadratically Constrained Quadratic Programmingcited by 17
  33. 2019MoGA: Searching Beyond MobileNetV3cited by 8
  34. 2020Data Agnostic Filter Gating for Efficient Deep Networkscited by 7
  35. 2019Multi-loss-aware Channel Pruning of Deep Networkscited by 4
  36. 2020Network Adjustment: Channel Search Guided by FLOPs Utilization Ratiocited by 4
  37. 2019Bringing Giant Neural Networks Down to Earth with Unlabeled Datacited by 3
  38. 2021Width Transfer: On the (In)variance of Width Optimizationcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 1.

4 papers.