{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:37:32Z","timestamp":1743064652316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030695347"},{"type":"electronic","value":"9783030695354"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69535-4_31","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T15:13:11Z","timestamp":1614179591000},"page":"506-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Progressive Batching for Efficient Non-linear Least Squares"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7562-7180","authenticated-orcid":false,"given":"Huu","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2840-6187","authenticated-orcid":false,"given":"Christopher","family":"Zach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8675-4230","authenticated-orcid":false,"given":"Edward","family":"Rosten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4202-4946","authenticated-orcid":false,"given":"Oliver J.","family":"Woodford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"31_CR1","unstructured":"Madsen, K., Nielsen, N., Tingleff, O.: Methods for non-linear least squares problems. Technical report, Technical University of Denmark (2004)"},{"key":"31_CR2","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/B:VISI.0000011205.11775.fd","volume":"56","author":"S Baker","year":"2004","unstructured":"Baker, S., Matthews, I.: Lucas-Kanade 20 years on: a unifying framework. Int. J. Comput. Vis. 56, 221\u2013255 (2004). https:\/\/doi.org\/10.1023\/B:VISI.0000011205.11775.fd","journal-title":"Int. J. Comput. Vis."},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44480-7_21","volume-title":"Vision Algorithms: Theory and Practice","author":"B Triggs","year":"2000","unstructured":"Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment \u2014 a modern synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) IWVA 1999. LNCS, vol. 1883, pp. 298\u2013372. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44480-7_21"},{"key":"31_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Q. Appl. Math. 2, 164\u2013168 (1944)","journal-title":"Q. Appl. Math."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"DW Marquardt","year":"1963","unstructured":"Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11, 431\u2013441 (1963)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0710036","volume":"10","author":"GH Golub","year":"1973","unstructured":"Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. 10, 413\u2013432 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s11263-006-9785-5","volume":"72","author":"T Okatani","year":"2007","unstructured":"Okatani, T., Deguchi, K.: On the Wiberg algorithm for matrix factorization in the presence of missing components. Int. J. Comput. Vis. 72, 329\u2013337 (2007). https:\/\/doi.org\/10.1007\/s11263-006-9785-5","journal-title":"Int. J. Comput. Vis."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Hong, J.H., Zach, C., Fitzgibbon, A.: Revisiting the variable projection method for separable nonlinear least squares problems. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition, pp. 127\u2013135 (2017)","DOI":"10.1109\/CVPR.2017.629"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/TPAMI.2002.1017625","volume":"24","author":"F Jurie","year":"2002","unstructured":"Jurie, F., Dhome, M.: Hyperplane approximation for template matching. IEEE Trans. Pattern Anal. Mach. Intell. 24, 996\u20131000 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-15552-9_3","volume-title":"Computer Vision \u2013 ECCV 2010","author":"S Agarwal","year":"2010","unstructured":"Agarwal, S., Snavely, N., Seitz, S.M., Szeliski, R.: Bundle adjustment in the large. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 29\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15552-9_3"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"key":"31_CR14","unstructured":"Rosten, E., Reitmayr, G., Drummond, T.: Improved RANSAC performance using simple, iterative minimal-set solvers. Technical report (2010)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. (TOMS) 30, 377\u2013380 (2004)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1115\/1.3662552","volume":"82","author":"RE Kalman","year":"1960","unstructured":"Kalman, R.E.: A new approach to linear filtering and prediction problems. Trans. ASME-J. Basic Eng. 82, 35\u201345 (1960)","journal-title":"Trans. ASME-J. Basic Eng."},{"key":"31_CR17","unstructured":"Pearl, J.: Reverend Bayes on inference engines: a distributed hierarchical approach. In: Proceedings of the Second AAAI Conference on Artificial Intelligence, AAAI 1982, pp. 133\u2013136. AAAI Press (1982)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Drummond, T., Cipolla, R.: Real-time tracking of highly articulated structures in the presence of noisy measurements. In: Proceedings Eighth IEEE International Conference on Computer Vision, ICCV 2001, vol. 2, pp. 315\u2013320 (2001)","DOI":"10.1109\/ICCV.2001.937642"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J., et al.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23, 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1016\/S0893-6080(03)00138-2","volume":"16","author":"DR Wilson","year":"2003","unstructured":"Wilson, D.R., Martinez, T.R.: The general inefficiency of batch training for gradient descent learning. Neural Netw. 16, 1429\u20131451 (2003)","journal-title":"Neural Netw."},{"key":"31_CR22","unstructured":"Keskar, N.S., Mudigere, D., Nocedal, J., Smelyanskiy, M., Tang, P.T.P.: On large-batch training for deep learning: generalization gap and sharp minima. arXiv preprint arXiv:1609.04836 (2016)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26, 1008\u20131031 (2016)","journal-title":"SIAM J. Optim."},{"key":"31_CR24","unstructured":"Bollapragada, R., Nocedal, J., Mudigere, D., Shi, H.J., Tang, P.T.P.: A progressive batching L-BFGS method for machine learning. In: International Conference on Machine Learning, pp. 620\u2013629 (2018)"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1109\/TSP.2017.2784360","volume":"66","author":"R Zhao","year":"2018","unstructured":"Zhao, R., Haskell, W.B., Tan, V.Y.: Stochastic L-BFGS: improved convergence rates and practical acceleration strategies. IEEE Trans. Signal Process. 66, 1155\u20131169 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Curtis, F.E., Shi, R.: A fully stochastic second-order trust region method. arXiv preprint arXiv:1911.06920 (2019)","DOI":"10.1080\/10556788.2020.1852403"},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989). https:\/\/doi.org\/10.1007\/BF01589116","journal-title":"Math. Program."},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"31_CR30","unstructured":"Tran-Dinh, Q., Pham, N.H., Nguyen, L.M.: Stochastic Gauss-Newton algorithms for nonconvex compositional optimization. arXiv preprint arXiv:2002.07290 (2020)"},{"key":"31_CR31","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134, 127\u2013155 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0572-5","journal-title":"Math. Program."},{"key":"31_CR32","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17M1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28, 3312\u20133343 (2018)","journal-title":"SIAM J. Optim."},{"key":"31_CR33","unstructured":"Mohr, R., Stein, O.: An adaptive sample size trust-region method for finite-sum minimization. arXiv preprint arXiv:1910.03294 (2019)"},{"key":"31_CR34","first-page":"4148","volume":"18","author":"N Agarwal","year":"2017","unstructured":"Agarwal, N., Bullins, B., Hazan, E.: Second-order stochastic optimization for machine learning in linear time. J. Mach. Learn. Res. 18, 4148\u20134187 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"31_CR35","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/15M1021106","volume":"27","author":"M Pilanci","year":"2017","unstructured":"Pilanci, M., Wainwright, M.J.: Newton sketch: a near linear-time optimization algorithm with linear-quadratic convergence. SIAM J. Optim. 27, 205\u2013245 (2017)","journal-title":"SIAM J. Optim."},{"key":"31_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-018-1346-5","volume":"174","author":"F Roosta-Khorasani","year":"2019","unstructured":"Roosta-Khorasani, F., Mahoney, M.W.: Sub-sampled Newton methods. Math. Program. 174, 293\u2013326 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1346-5","journal-title":"Math. Program."},{"key":"31_CR37","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"31_CR38","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/03610927708827533","volume":"6","author":"PW Holland","year":"1977","unstructured":"Holland, P.W., Welsch, R.E.: Robust regression using iteratively reweighted least-squares. Commun. Stat.-Theory Methods 6, 813\u2013827 (1977)","journal-title":"Commun. Stat.-Theory Methods"},{"key":"31_CR39","series-title":"Springer Series in Statistics (Perspectives in Statistics)","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-1-4612-0865-5_26","volume-title":"The Collected Works of Wassily Hoeffding","author":"W Hoeffding","year":"1994","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. In: Fisher, N.I., Sen, P.K. (eds.) The Collected Works of Wassily Hoeffding. SSS, pp. 409\u2013426. Springer, New York (1994). https:\/\/doi.org\/10.1007\/978-1-4612-0865-5_26"},{"key":"31_CR40","doi-asserted-by":"crossref","unstructured":"Cohen, A., Zach, C.: The likelihood-ratio test and efficient robust estimation. In: IEEE International Conference on Computer Vision (ICCV) (2015)","DOI":"10.1109\/ICCV.2015.263"},{"key":"31_CR41","doi-asserted-by":"crossref","unstructured":"Wong, H.S., Chin, T.J., Yu, J., Suter, D.: Dynamic and hierarchical multi-structure geometric model fitting. In: 2011 IEEE International Conference on Computer Vision (ICCV), pp. 1044\u20131051. IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126350"},{"key":"31_CR42","doi-asserted-by":"crossref","unstructured":"Malis, E.: Improving vision-based control using efficient second-order minimization techniques. In: IEEE International Conference on Robotics and Automation, Proceedings, ICRA 2004, vol. 2, pp. 1843\u20131848. IEEE (2004)","DOI":"10.1109\/ROBOT.2004.1308092"},{"key":"31_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"key":"31_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-030-01258-8_34","volume-title":"Computer Vision \u2013 ECCV 2018","author":"C Zach","year":"2018","unstructured":"Zach, C., Bourmaud, G.: Descending, lifting or smoothing: secrets of robust cost optimization. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11216, pp. 558\u2013574. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01258-8_34"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69535-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T20:04:22Z","timestamp":1724529862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69535-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030695347","9783030695354"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69535-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"accv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/accv2020.kyoto\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"768","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":"254","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":"33% - 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","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":"3","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":"The conference was held virtually.","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)"}}]}}