The DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
Model complexity of deep learning: a survey
Abstract
Model complexity is a fundamental problem in deep learning. In this paper, we conduct a systematic overview of the latest studies on model complexity in deep learning. Model complexity of deep learning can be categorized into expressive capacity and effective model complexity. We review the existing studies on those two categories along four important factors, including model framework, model size, optimization process, and data complexity. We also discuss the applications of deep learning model complexity including understanding model generalization, model optimization, and model selection and design. We conclude by proposing several interesting future directions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
ImageNet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S. (2024) · arXiv (Cornell University) · doi:10.57702/o9raffed · Cited by 14,214
Distilling the Knowledge in a Neural Network
Hinton, G., Vinyals, O., & Dean, J. (2015) · arXiv · doi:10.48550/arxiv.1503.02531 · Cited by 14,204
(2010) · International Conference on Machine Learning · Cited by 13,995
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
(2016) · Cited by 11,679
The Nature of Statistical Learning Theory
Vapnik, V. N. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3264-1 · Cited by 10,696
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
(2012) · Cited by 9,062
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Neural Architecture Search with Reinforcement Learning
Zoph, B., & Le, Q. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01578 · Cited by 3,974
DARTS: Differentiable architecture search
Liu, H., Simonyan, K., & Yang, Y. (2018) · arXiv · doi:10.48550/arxiv.1806.09055 · Cited by 3,248
Understanding deep learning requires rethinking generalization
Zhang, C., Bengio, S., Hardt, M., Recht, B., & Vinyals, O. (2016) · arXiv · doi:10.48550/arxiv.1611.03530 · Cited by 2,838 · cited 2×
“Some studies [75,100] suggest that deep learning models are often over-parameterized in practice and have significantly more parameters than samples.”
BackgroundUniversal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
Understanding deep learning (still) requires rethinking generalization
Zhang, C., Bengio, S., Hardt, M., Recht, B., & Vinyals, O. (2021) · Communications of the ACM · doi:10.1145/3446776 · Cited by 2,400
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · Cited by 2,376
Ziegler, G. M. (1995) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8431-1 · Cited by 2,329
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
Progressive Neural Architecture Search
Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.-J., Fei-Fei, L., Yuille, A., Huang, J., & Murphy, K. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01246-5_2 · Cited by 1,833
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Do Deep Nets Really Need to be Deep?
Ba, J. L., & Caruana, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.6184 · Cited by 1,335
Activation Functions: Comparison of trends in Practice and Research for Deep Learning
Nwankpa, C. E., Ijomah, W., Gachagan, A., & Marshall, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03378 · Cited by 1,240
Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000) · Machine Learning · doi:10.1023/a:1007608224229 · Cited by 1,133
Foundations of Machine Learning
Singh, A. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3399990 · Cited by 1,123
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
On the Number of Linear Regions of Deep Neural Networks
Montúfar, G., Pascanu, R., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1402.1869 · Cited by 840
Cheng, Y., Wang, D., Zhou, P., & Zhang, T. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2765695 · Cited by 817
Complexity measures and decision tree complexity: a survey
Buhrman, H., & de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00144-x · Cited by 665
Computational Complexity: ADVANCED TOPICS
Arora, S., & Barak, B. (2009) · Cited by 624
Tensors: Geometry and Applications
Landsberg, J. (2011) · Graduate Studies in Mathematics · doi:10.1090/gsm/128 · Cited by 623
Phrase-Based & Neural Unsupervised Machine Translation
Lample, G., Ott, M., Conneau, A., Denoyer, L., & Ranzato, M. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1549 · Cited by 615
Science from Fisher Information: A Unification
Frieden, B. R. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511616907 · Cited by 585
Deep double descent: where bigger models and more data hurt*
Nakkiran, P., Kaplun, G., Bansal, Y., Yang, T., Barak, B., & Sutskever, I. (2021) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/ac3a74 · Cited by 565
The Importance of Complexity in Model Selection
Myung, I. J. (2000) · Journal of Mathematical Psychology · doi:10.1006/jmps.1999.1283 · Cited by 518
Efficient Neural Architecture Search via Parameter Sharing
Pham, H., Guan, M. Y., Zoph, B., Le, Q. V., & Dean, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.03268 · Cited by 517
On the Complexity of Neural Network Classifiers: A Comparison Between Shallow and Deep Architectures
Bianchini, M., & Scarselli, F. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2293637 · Cited by 500
Science from Fisher information a unification
Frieden, B. R. (2004) · Cited by 489
On the degree of boolean functions as real polynomials
Nisan, N., & Szegedy, M. (1994) · Computational Complexity · doi:10.1007/bf01263419 · Cited by 384
Xu, H., & Mannor, S. (2012) · Machine Learning · doi:10.1007/s10994-011-5268-1 · Cited by 377
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Exploring Generalization in Deep Learning
Neyshabur, B., Bhojanapalli, S., McAllester, D., & Srebro, N. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.08947 · Cited by 284
Optimization for deep learning: theory and algorithmsPreprint
Sun, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.08957 · Cited by 284
Norm-Based Capacity Control in Neural Networks
Neyshabur, B., Tomioka, R., & Srebro, N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.00036 · Cited by 279
Exponential expressivity in deep neural networks through transient chaos
Poole, B., Lahiri, S., Raghu, M., Sohl‐Dickstein, J., & Ganguli, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.05340 · Cited by 270
Quantum computational finance: Monte Carlo pricing of financial derivatives
Rebentrost, P., Gupt, B., & Bromley, T. R. (2018) · Physical Review A · doi:10.1103/physreva.98.022321 · Cited by 265
(2018) · Optimization Techniques and Applications with Examples · doi:10.1002/9781119490616.ch9 · Cited by 243
Balasubramanian, V. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.349 · Cited by 236
Why tanh: choosing a sigmoidal function
Kalman, B. L., & Kwasny, S. C. (2003) · [Proceedings 1992] IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1992.227257 · Cited by 220
Model complexity control for regression using VC generalization bounds
Cherkassky, V., Shao, X., Mulier, F. M., & Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788648 · Cited by 195
Error bounds for approximations with deep ReLU neural networks in Ws,p norms
Gühring, I., Kutyniok, G., & Petersen, P. (2020) · Analysis and Applications · doi:10.1142/s0219530519410021 · Cited by 195
Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
Bartlett, P. L., Harvey, N., Liaw, C., & Mehrabian, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.02930 · Cited by 188
On the Expressive Power of Deep Architectures
Bengio, Y., & Delalleau, O. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24412-4_3 · Cited by 182
Optimization for Deep Learning: An Overview
Sun, R.-Y. (2020) · Journal of the Operations Research Society of China · doi:10.1007/s40305-020-00309-6 · Cited by 181
Rasmussen, C. E., & Ghahramani, Z. (2000) · neural information processing systems · Cited by 172
Progressive Neural Architecture Search
Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.-J., Fei-Fei, L., Yuille, A., Huang, J., & Murphy, K. (2017) · arXiv · doi:10.48550/arxiv.1712.00559 · Cited by 171 · cited 3×
“Since an overly complex model may take too-long training time and thus may become a serious obstacle of neural architecture search [57, 62], the accuracy-complexity tradeoff is an important consideration in neural architecture search.”
BackgroundInfluentialTrading accuracy for simplicity in decision trees
Bohanec, M., & Bratko, I. (1994) · Machine Learning · doi:10.1007/bf00993345 · Cited by 170
When and Why Are Deep Networks Better Than Shallow Ones?
Mhaskar, H., Liao, Q., & Poggio, T. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10913 · Cited by 168
The role of over-parametrization in generalization of neural networks
Neyshabur, B., Li, Z., Bhojanapalli, S., LeCun, Y., & Srebro, N. (2019) · Cited by 167
Complexity of Linear Regions in Deep NetworksPreprint
Hanin, B., & Rolnick, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.09021 · Cited by 160
Rademacher Complexity for Adversarially Robust GeneralizationPreprint
Yin, D., Ramchandran, K., & Bartlett, P. L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.11914 · Cited by 156
Bayesian Measures of Model Complexity and Fit
Spiegelhalter, D. J., Best, N. G., Carlin, B. P., & Van Der Linde, A. (2002) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00353 · Cited by 151
A support vector machine with a hybrid kernel and minimal vapnik-chervonenkis dimension
Tan, Y., & Wang, J. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269664 · Cited by 141
A Primer for Model Selection: The Decisive Role of Model Complexity
Höge, M., Wöhling, T., & Nowak, W. (2018) · Water Resources Research · doi:10.1002/2017wr021902 · Cited by 128
On Network Design Spaces for Visual Recognition
Radosavovic, I., Johnson, J., Xie, S., Lo, W.-Y., & Dollar, P. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00197 · Cited by 127
Almost Linear VC-Dimension Bounds for Piecewise Polynomial Networks
Bartlett, P. L., Maiorov, V., & Meir, R. (1998) · Neural Computation · doi:10.1162/089976698300017016 · Cited by 121
On the Selection of Initialization and Activation Function for Deep Neural NetworksPreprint
Hayou, S., Doucet, A., & Rousseau, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.08266 · Cited by 83
Analysis of data complexity measures for classification
Cano, J.-R. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.02.025 · Cited by 70
On the Expressive Power of Deep Polynomial Neural NetworksPreprint
Kileel, J., Trager, M., & Bruna, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.12207 · Cited by 51
Neural Nets with Superlinear VC-Dimension
Maass, W. (1994) · Neural Computation · doi:10.1162/neco.1994.6.5.877 · Cited by 48
On the complexity of shallow and deep neural network classifiers
Bianchini, M., & Scarselli, F. (2014) · Use Siena air (University of Siena) · Cited by 39
Measuring Model Complexity of Neural Networks with Curve Activation Functions
Hu, X., Liu, W., Bian, J., & Pei, J. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403203 · Cited by 33
Self-citationData Complexity in Machine Learning and Novel Classification Algorithms
Li, L. (2006) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/ew2g-9986 · Cited by 28
Automatic model selection for fully connected neural networks
Laredo, D., Ma, S., Leylaz, G., Schütze, O., & Sun, J.-Q. (2020) · International Journal of Dynamics and Control · doi:10.1007/s40435-020-00708-w · Cited by 25
Capacity Control of ReLU Neural Networks by Basis-Path Norm
Zheng, S., Meng, Q., Zhang, H., Chen, W., Yu, N., & Liu, T. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33015925 · Cited by 17
The “weight” of models and complexity
Du, J. (2014) · Complexity · doi:10.1002/cplx.21612 · Cited by 15
Constructive lower bounds on model complexity of shallow perceptron networks
Kůrková, V. (2017) · Neural Computing and Applications · doi:10.1007/s00521-017-2965-0 · Cited by 15
(2008) · ScholarlyCommons (University of Pennsylvania)
Research works printed but not linked: 28
- Adams RA, Fournier JJ (2003) Sobolev spaces. Elsevier, Amsterdam
- Allen-Zhu Z, Li Y, Liang Y (2019) Learning and generalization in overparameterized neural networks, going beyond two layers. In: Advances in neural information processing systems, pp 6155–6166
- Arora R, Basu A, Mianjy P, Mukherjee A (2018) Understanding deep neural networks with rectified linear units. In: International conference on learning representations
- Bartlett PL, Foster DJ, Telgarsky MJ (2017) Spectrally-normalized margin bounds for neural networks. In: Advances in neural information processing systems, pp 6240–6249
- Bredon GE (2013) Topology and geometry, vol 139. Springer, Berlin
- Bulso N, Marsili M, Roudi Y (2019) On the complexity of logistic regression models. Neural Comput 31(8):1592–1623 · DOI
- Carothers NL (2000) Real analysis. Cambridge University Press, Cambridge · doi:10.1017/cbo9780511814228
- Cohen N, Shashua A (2016) Convolutional rectifier networks as generalized tensor decompositions. In: International conference on machine learning, pp 955–963
- Cook S, Dwork C, Reischuk R (1986) Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J Comput 15(1):87–97 · doi:10.1137/0215006
- Delalleau O, Bengio Y (2011) Shallow vs. deep sum-product networks. In: Advances in neural information processing systems, pp 666–674
- Goodfellow I, Warde-Farley D, Mirza M, Courville A, Bengio Y (2013) Maxout networks. In: International conference on machine learning, PMLR, pp 1319–1327
- Hanin B, Sellke M (2017) Approximating continuous functions by relu nets of minimal width. arXiv preprint arXiv:1710.11278 · arXiv
- Kalimeris D, Kaplun G, Nakkiran P, Edelman B, Yang T, Barak B, Zhang H (2019) Sgd on neural networks learns functions of increasing complexity. In: Advances in neural information processing systems, pp 3491–3501
- Kawaguchi K, Kaelbling LP, Bengio Y (2017) Generalization in deep learning. arXiv preprint arXiv:1710.05468 · arXiv
- Keskar NS, Mudigere D, Nocedal J, Smelyanskiy M, Tang PTP (2017) On large-batch training for deep learning: generalization gap and sharp minima. In: International conference on learning representations
- Khrulkov V, Novikov A, Oseledets I (2018) Expressive power of recurrent neural networks. In: International conference on learning representations
- Kileel J, Trager M, Bruna J (2019) On the expressive power of deep polynomial neural networks. In: Advances in neural information processing systems, pp 10310–10319
- Liang T, Poggio T, Rakhlin A, Stokes J (2019) Fisher-rao metric, geometry, and complexity of neural networks. In: The 22nd international conference on artificial intelligence and statistics, PMLR, pp 888–896
- Lu Z, Pu H, Wang F, Hu Z, Wang L (2017) The expressive power of neural networks: a view from the width. In: Advances in neural information processing systems, pp 6231–6239
- Lundqvist S, Oneto A, Reznick B, Shapiro B (2019) On generic and maximal k-ranks of binary forms. J Pure Appl Algebra 223(5):2062–2079 · doi:10.1016/j.jpaa.2018.08.015
- Michel B, Nouy A (2020) Learning with tree tensor networks: complexity estimates and model selection. arXiv preprint arXiv:2007.01165 · arXiv
- Neyshabur B (2017) Implicit regularization in deep learning. arXiv preprint arXiv:1709.01953 · arXiv
- Neyshabur B, Tomioka R, Srebro N (2015) In search of the real inductive bias: on the role of implicit regularization in deep learning. In: International conference on learning representations (workshop)
- Novak R, Bahri Y, Abolafia DA, Pennington J, Sohl-Dickstein J (2018) Sensitivity and generalization in neural networks: an empirical study. In: International conference on learning representations
- Raghu M, Poole B, Kleinberg J, Ganguli S, Dickstein JS (2017) On the expressive power of deep neural networks. In: Proceedings of the 34th international conference on machine learning, vol. 70, JMLR, pp 2847–2854
- Rasmussen CE, Ghahramani Z (2001) Occams razor. In: Advances in neural information processing systems, pp 294–300
- Serra T, Tjandraatmadja C, Ramalingam S (2018) Bounding and counting linear regions of deep neural networks. In: International conference on machine learning, PMLR, pp 4558–4566
- Yao ACC (1997) Decision tree complexity and Betti numbers. J Comput Syst Sci 55(1):36–43 · doi:10.1006/jcss.1997.1495
Cited by
Deep learning modelling techniques: Current progress, applications, advantages, and challenges
Ahmed, S. F., Alam, M. S. B., Hassan, M., Rozbu, M. R., Ishtiak, T., Rafa, N., Mofijur, M., Shawkat Ali, A. B. M., & Gandomi, A. H. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10466-8 · Cited by 1,079
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“Recent research on the complexity of ML models [162] and their cognitive functional complexity [347] may inspire future research on a unified quantitative evaluation metric.”
BackgroundSelf-citationEvaluation of artificial intelligence techniques in disease diagnosis and prediction
Ghaffar Nia, N., Kaplanoglu, E., & Nasab, A. (2023) · Discover Artificial Intelligence · doi:10.1007/s44163-023-00049-5 · Cited by 426
Deep learning: systematic review, models, challenges, and research directions
Talaei Khoei, T., Ould Slimane, H., & Kaabouch, N. (2023) · Neural Computing and Applications · doi:10.1007/s00521-023-08957-4 · Cited by 411
Luo, K., Chen, X., Zheng, H., & Shi, Z. (2022) · Journal of Energy Chemistry · doi:10.1016/j.jechem.2022.06.049 · Cited by 292
Metadata
- Authors
- Hu, X., Chu, L., Pei, J., Liu, W., & Bian, J.
- Venue
- Knowledge and Information Systems
- Published
- 2021-08-22
- Volume
- 63
- Issue
- 10
- Pages
- 2585-2619
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W3195438473
- Cited by
- 402
- References
- 84
- FWCI
- 21.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Funders
- Natural Sciences and Engineering Research Council of Canada
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.