mlsanityData to 7 Oct 2026

The Interaction Bottleneck of Deep Neural Networks: Discovery, Proof, and Modulation

arXiv 2512.18607 ↗First posted 21 Dec 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Understanding what kinds of cooperative structures deep neural networks (DNNs) can represent remains a fundamental yet insufficiently understood problem. In this work, we treat interactions as the fundamental units of such structure and investigate a largely unexplored question: how DNNs encode interactions under different levels of contextual complexity, and how these microscopic interaction patterns shape macroscopic representation capacity. To quantify this complexity, we use multi-order interactions [57], where each order reflects the amount of contextual information required to evaluate the joint interaction utility of a variable pair. This formulation enables a stratified analysis of cooperative patterns learned by DNNs. Building on this formulation, we develop a comprehensive study of interaction structure in DNNs. (i) We empirically discover a universal interaction bottleneck: across architectures and tasks, DNNs easily learn low-order and high-order interactions but consistently under-represent mid-order ones. (ii) We theoretically explain this bottleneck by proving that mid-order interactions incur the highest contextual variability, yielding large gradient variance and making them intrinsically difficult to learn. (iii) We further modulate the bottleneck by introducing losses that steer models toward emphasizing interactions of selected orders. Finally, we connect microscopic interaction structures with macroscopic representational behavior: low-order-emphasized models exhibit stronger generalization and robustness, whereas high-order-emphasized models demonstrate greater structural modeling and fitting capability. Together, these results uncover an inherent representational bias in modern DNNs and establish interaction order as a powerful lens for interpreting and guiding deep representations.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 46 of its 61 references that are in the map. First posted on arXiv 21 Dec 2025.

Builds on

46 of 61 references.

References · 46

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  5. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  6. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  7. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  8. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  9. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
  10. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  11. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
  12. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
34 more
  1. 2014Going Deeper with Convolutionscited by 4,231
  2. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
  3. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  4. 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
  5. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
  6. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  7. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  8. 2018Neural Network Acceptability Judgmentscited by 952
  9. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  10. 2021PVT v2: Improved Baselines with Pyramid Vision Transformercited by 749
  11. 2018PointConv: Deep Convolutional Networks on 3D Point Cloudscited by 656
  12. 2017Exploring Generalization in Deep Learningcited by 595
  13. 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
  14. 2016On the Expressive Power of Deep Neural Networkscited by 302
  15. 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 253
  16. 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
  17. 2018Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approachcited by 181
  18. 2019The Shapley Taylor Interaction Indexcited by 143
  19. 2013On the number of response regions of deep feed forward networks with piece-wise linear activationscited by 94
  20. 2020The Hessian Penalty: A Weak Prior for Unsupervised Disentanglementcited by 90
  21. 2020A Unified Approach to Interpreting and Boosting Adversarial Transferabilitycited by 71
  22. 2019Stiffness: A New Perspective on Generalization in Neural Networkscited by 46
  23. 2018Understanding training and generalization in deep learning by Fourier analysiscited by 43
  24. 2021Discovering and Explaining the Representation Bottleneck of DNNscited by 42
  25. 2021Defining and Quantifying the Emergence of Sparse Concepts in DNNscited by 36
  26. 2020Interpreting and Boosting Dropout from a Game-Theoretic Viewcited by 34
  27. 2022On the Generalization Mystery in Deep Learningcited by 25
  28. 2016Architectural Complexity Measures of Recurrent Neural Networkscited by 17
  29. 2021A Unified Game-Theoretic Interpretation of Adversarial Robustnesscited by 17
  30. 2021Interpreting Attributions and Interactions of Adversarial Attackscited by 13
  31. 2021Interpreting Representation Quality of DNNs for 3D Point Cloud Processingcited by 12
  32. 2022Proving Common Mechanisms Shared by Twelve Methods of Boosting Adversarial Transferabilitycited by 12
  33. 2020Technical Note: Game-Theoretic Interactions of Different Orderscited by 11
  34. 2022Towards Theoretical Analysis of Transformation Complexity of ReLU DNNscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.