An empirical study of the relation between network architecture and complexity
Not on the map. Why?
Abstract (arXiv)
In this preregistration submission, we propose an empirical study of how networks handle changes in complexity of the data. We investigate the effect of network capacity on generalization performance in the face of increasing data complexity. For this, we measure the generalization error for an image classification task where the number of classes steadily increases. We compare a number of modern architectures at different scales in this setting. The methodology, setup, and hypotheses described in this proposal were evaluated by peer review before experiments were conducted.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021Characterizing and Measuring the Similarity of Neural Networks with Persistent Homologycited by 8
- 2021Persistent Homology Captures the Generalization of Neural Networks Without A Validation Setcited by 4
- 2022problexity -- an open-source Python library for binary classification problem complexity assessmentcited by 2
- 2025k-NN as a Simple and Effective Estimator of Transferabilitycited by 1
- 2025k-NN as a Simple and Effective Estimator of Transferability24 Mar 2025
- 2022problexity -- an open-source Python library for binary classification problem complexity assessment14 Jul 2022
- 2021Persistent Homology Captures the Generalization of Neural Networks Without A Validation Set31 May 2021
- 2021Characterizing and Measuring the Similarity of Neural Networks with Persistent Homology19 Jan 2021