{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:25:54Z","timestamp":1743067554976,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434143"},{"type":"electronic","value":"9783031434150"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43415-0_11","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T08:01:51Z","timestamp":1694851311000},"page":"173-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Is My Neural Net Driven by\u00a0the\u00a0MDL Principle?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7146-8255","authenticated-orcid":false,"given":"Eduardo","family":"Brandao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0374-3814","authenticated-orcid":false,"given":"Stefan","family":"Duffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1870-1329","authenticated-orcid":false,"given":"R\u00e9mi","family":"Emonet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3038-9347","authenticated-orcid":false,"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0653-0710","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Jacquenet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6851-169X","authenticated-orcid":false,"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"11_CR1","unstructured":"Arora, S., Ge, R., Neyshabur, B., Zhang, Y.: Stronger generalization bounds for deep nets via a compression approach. CoRR (2018). http:\/\/arxiv.org\/abs\/1802.05296v4"},{"issue":"6","key":"11_CR2","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"A Barron","year":"1998","unstructured":"Barron, A., Rissanen, J., Yu, B.: The minimum description length principle in coding and modeling. IEEE Trans. Inf. Theory 44(6), 2743\u20132760 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Barron, A.R.: Complexity regularization with application to artificial neural networks. In: Nonparametric Functional Estimation and Related Topics, pp. 561\u2013576 (1991)","DOI":"10.1007\/978-94-011-3222-0_42"},{"key":"11_CR4","first-page":"1","volume":"31","author":"L Blier","year":"2018","unstructured":"Blier, L., Ollivier, Y.: The description length of deep learning models. Adv. Neural Inf. Process. Syst. 31, 1\u201311 (2018)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-540-45167-9_26","volume-title":"Learning Theory and Kernel Machines","author":"A Blum","year":"2003","unstructured":"Blum, A., Langford, J.: PAC-MDL bounds. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT-Kernel 2003. LNCS (LNAI), vol. 2777, pp. 344\u2013357. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45167-9_26"},{"key":"11_CR6","unstructured":"Brandao, E., Duffner, S., Emonet, R., Habrard, A., Jacquenet, F., Sebban, M.: Appendixes to: is my neural net driven by the mdl principle? (2023). https:\/\/github.com\/brandao-eduardo\/ismynndrivenbymdl\/blob\/main\/Appendixes.pdf"},{"key":"11_CR7","unstructured":"Cayton, L.: Algorithms for manifold learning. Univ. of California at San Diego Technical Report 12(1\u201317), 1 (2005)"},{"key":"11_CR8","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Hoboekn (2012)"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng, L.: The mnist database of handwritten digit images for machine learning research. IEEE Signal Process. Maga. 29(6), 141\u2013142 (2012)","journal-title":"IEEE Signal Process. Maga."},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1090\/jams\/852","volume":"29","author":"C Fefferman","year":"2016","unstructured":"Fefferman, C., Mitter, S., Narayanan, H.: Testing the manifold hypothesis. J. Am. Math. Soc. 29(4), 983\u20131049 (2016)","journal-title":"J. Am. Math. Soc."},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1007\/s10618-022-00846-z","volume":"36","author":"E Galbrun","year":"2022","unstructured":"Galbrun, E.: The minimum description length principle for pattern mining: a survey. Data Mining Knowl. Disc. 36(5), 1679\u20131727 (2022)","journal-title":"Data Mining Knowl. Disc."},{"key":"11_CR12","unstructured":"Gao, T., Jojic, V.: Degrees of freedom in deep neural networks. In: Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, UAI 2016, pp. 232\u2013241. AUAI Press, Arlington (2016)"},{"issue":"45","key":"11_CR13","doi-asserted-by":"publisher","first-page":"15852","DOI":"10.1073\/pnas.0407191101","volume":"101","author":"S Gheorghiu","year":"2004","unstructured":"Gheorghiu, S., Coppens, M.O.: Heterogeneity explains features of \u201canomalous\" thermodynamics and statistics. Proc. Natl. Acad. Sci. 101(45), 15852\u201315856 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"11_CR14","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016). http:\/\/www.deeplearningbook.org"},{"key":"11_CR15","first-page":"1","volume":"5","author":"P Gr\u00fcnwald","year":"2005","unstructured":"Gr\u00fcnwald, P.: Minimum description length tutorial. Adv. Minimum Descript. Length: Theory Appl. 5, 1\u201380 (2005)","journal-title":"Adv. Minimum Descript. Length: Theory Appl."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10994-007-0716-7","volume":"66","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P., Langford, J.: Suboptimal behavior of bayes and mdl in classification under misspecification. Mach. Learn. 66, 119\u2013149 (2007)","journal-title":"Mach. Learn."},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Gr\u00fcnwald, P., Roos, T.: Minimum description length revisited. Int. J. Math. Ind. 11(01), 1930001 (2019). https:\/\/doi.org\/10.1142\/S2661335219300018","DOI":"10.1142\/S2661335219300018"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Hansen, M.H., Yu, B.: Minimum description length model selection criteria for generalized linear models. Lect. Notes-Monograph Ser., 145\u2013163 (2003)","DOI":"10.1214\/lnms\/1215091140"},{"key":"11_CR19","unstructured":"Hardt, M., Recht, B., Singer, Y.: Train faster, generalize better: stability of stochastic gradient descent. In: International Conference on Machine Learning, pp. 1225\u20131234. PMLR (2016)"},{"key":"11_CR20","unstructured":"He, H., Su, W.J.: The local elasticity of neural networks. arXiv preprint arXiv:1910.06943 (2019)"},{"issue":"1","key":"11_CR21","first-page":"3403","volume":"16","author":"DP Helmbold","year":"2015","unstructured":"Helmbold, D.P., Long, P.M.: On the inductive bias of dropout. J. Mach. Learn. Res. 16(1), 3403\u20133454 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Hinton, G.E., Van Camp, D.: Keeping the neural networks simple by minimizing the description length of the weights. In: Proceedings of the Sixth Annual Conference on Computational Learning Theory, pp. 5\u201313 (1993)","DOI":"10.1145\/168304.168306"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10618-014-0345-2","volume":"29","author":"B Hu","year":"2015","unstructured":"Hu, B., Rakthanmanon, T., Hao, Y., Evans, S., Lonardi, S., Keogh, E.: Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series. Data Mining Knowl. Disc. 29, 358\u2013399 (2015)","journal-title":"Data Mining Knowl. Disc."},{"key":"11_CR24","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning, pp. 448\u2013456. PMLR (2015)"},{"key":"11_CR25","unstructured":"Jaynes, E.: Where do we stand on maximum entropy? The maximum entropy formalism, pp. 15\u2013118 (1978)"},{"key":"11_CR26","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)"},{"key":"11_CR27","unstructured":"Krogh, A., Hertz, J.A.: A simple weight decay can improve generalization. In: Advances in Neural Information Processing Systems, pp. 950\u2013957 (1992)"},{"key":"11_CR28","unstructured":"Li, C., Farkhoor, H., Liu, R., Yosinski, J.: Measuring the intrinsic dimension of objective landscapes. In: International Conference on Learning Representations (2018)"},{"key":"11_CR29","unstructured":"Luo, P., Wang, X., Shao, W., Peng, Z.: Towards understanding regularization in batch normalization. arXiv preprint arXiv:1809.00846 (2018)"},{"key":"11_CR30","volume-title":"Information Theory, Inference and Learning Algorithms","author":"DJ MacKay","year":"2003","unstructured":"MacKay, D.J., Mac Kay, D.J.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"11_CR31","unstructured":"Martin, C.H., Mahoney, M.W.: Implicit self-regularization in deep neural networks: evidence from random matrix theory and implications for learning. arXiv preprint arXiv:1810.01075 (2018)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Martin, C.H., Mahoney, M.W.: Heavy-tailed universality predicts trends in test accuracies for very large pre-trained deep neural networks. In: Proceedings of the 2020 SIAM International Conference on Data Mining, pp. 505\u2013513. SIAM (2020)","DOI":"10.1137\/1.9781611976236.57"},{"key":"11_CR33","unstructured":"Morcos, A.S., Barrett, D.G.T., Rabinowitz, N.C., Botvinick, M.: On the importance of single directions for generalization. CoRR (2018). http:\/\/arxiv.org\/abs\/1803.06959v4"},{"issue":"2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jmp.2005.06.008","volume":"50","author":"JI Myung","year":"2006","unstructured":"Myung, J.I., Navarro, D.J., Pitt, M.A.: Model selection by normalized maximum likelihood. J. Math. Psychol. 50(2), 167\u2013179 (2006)","journal-title":"J. Math. Psychol."},{"key":"11_CR35","unstructured":"Neyshabur, B., Tomioka, R., Srebro, N.: In search of the real inductive bias: on the role of implicit regularization in deep learning. arXiv preprint arXiv:1412.6614 (2014)"},{"key":"11_CR36","volume-title":"JPEG: Still Image Data Compression Standard","author":"WB Pennebaker","year":"1992","unstructured":"Pennebaker, W.B., Mitchell, J.L.: JPEG: Still Image Data Compression Standard. Springer, Heidelberg (1992)"},{"issue":"5","key":"11_CR37","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"2","key":"11_CR38","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Stat. 11(2), 416\u2013431 (1983)","journal-title":"Ann. Stat."},{"issue":"7","key":"11_CR39","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1109\/18.887861","volume":"46","author":"J Rissanen","year":"2000","unstructured":"Rissanen, J.: MDL denoising. IEEE Trans. Inf. Theory 46(7), 2537\u20132543 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"11_CR40","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1109\/18.930912","volume":"47","author":"J Rissanen","year":"2001","unstructured":"Rissanen, J.: Strong optimality of the normalized ml models as universal codes and information in data. IEEE Trans. Inf. Theory 47(5), 1712\u20131717 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR41","unstructured":"Santurkar, S., Tsipras, D., Ilyas, A., Madry, A.: How does batch normalization help optimization? arXiv preprint arXiv:1805.11604 (2018)"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Song, H., Kim, M., Park, D., Shin, Y., Lee, J.G.: Learning from noisy labels with deep neural networks: a survey. IEEE Trans. Neural Netw. Learn. Syst. (2022)","DOI":"10.1109\/TNNLS.2022.3152527"},{"issue":"1","key":"11_CR43","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"11_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(72)90013-4","volume":"5","author":"RC Thompson","year":"1972","unstructured":"Thompson, R.C.: Principal submatrices ix: interlacing inequalities for singular values of submatrices. Linear Algebra Appl. 5(1), 1\u201312 (1972)","journal-title":"Linear Algebra Appl."},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Tishby, N., Zaslavsky, N.: Deep learning and the information bottleneck principle. In: 2015 IEEE Information Theory Workshop (itw), pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/ITW.2015.7133169"},{"issue":"2","key":"11_CR46","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/18.825807","volume":"46","author":"PM Vit\u00e1nyi","year":"2000","unstructured":"Vit\u00e1nyi, P.M., Li, M.: Minimum description length induction, bayesianism, and kolmogorov complexity. IEEE Trans. Inf. Theory 46(2), 446\u2013464 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR47","unstructured":"Wei, J., Zhu, Z., Cheng, H., Liu, T., Niu, G., Liu, Y.: Learning with noisy labels revisited: a study using real-world human annotations. In: International Conference on Learning Representations (2022). https:\/\/openreview.net\/forum?id=TBWA6PLJZQm"},{"issue":"4","key":"11_CR48","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/18.681319","volume":"44","author":"K Yamanishi","year":"1998","unstructured":"Yamanishi, K.: A decision-theoretic extension of stochastic complexity and its applications to learning. IEEE Trans. Inf. Theory 44(4), 1424\u20131439 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR49","unstructured":"Yoshida, Y., Miyato, T.: Spectral norm regularization for improving the generalizability of deep learning. arXiv preprint arXiv:1705.10941 (2017)"},{"key":"11_CR50","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., Vinyals, O.: Understanding deep learning requires rethinking generalization. In: International Conference on Learning Representations (2017). https:\/\/openreview.net\/forum?id=Sy8gdB9xx"},{"issue":"3","key":"11_CR51","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/3446776","volume":"64","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., Vinyals, O.: Understanding deep learning (still) requires rethinking generalization. Commun. ACM 64(3), 107\u2013115 (2021)","journal-title":"Commun. ACM"},{"issue":"1","key":"11_CR52","first-page":"1","volume":"5","author":"K Zhao","year":"2015","unstructured":"Zhao, K., Musolesi, M., Hui, P., Rao, W., Tarkoma, S.: Explaining the power-law distribution of human mobility through transportation modality decomposition. Sci. Rep. 5(1), 1\u20137 (2015)","journal-title":"Sci. Rep."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43415-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T08:04:33Z","timestamp":1694851473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43415-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434143","9783031434150"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43415-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This paper presents a contribution that is essentially fundamental, theoretical and methodological. We do not see any immediate ethical or societal issues. Our experimental evaluation considers classic benchmarks of the literature and our analysis focuses on particular mathematical properties of point Jacobians spectra of trained neural networks. Our work follows ethical guidelines in modern machine learning research in general and in representation learning in particular. The application of the methodology presented in this paper should consider ethical implications that can arise from the datasets used of the applications targeted.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical statement"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}