{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:33:42Z","timestamp":1759178022047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_42","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"603-615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Neural Architecture Search: A Visual Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-1080","authenticated-orcid":false,"given":"Nadarajen","family":"Veerapen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"42_CR1","unstructured":"Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. In: Conference on Learning Representations, ICLR (2017)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Real, E., Aggarwal, A., Huang, Y., Le, Q.V.: Regularized evolution for image classifier architecture search. In: AAAI Conference on Artificial Intelligence, AAAI, pp. 4780\u20134789. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33014780"},{"key":"42_CR3","unstructured":"Liu, H., Simonyan, K., Yang, Y.: DARTS: differentiable architecture search. In: Conference on Learning Representations, ICLR (2019)"},{"key":"42_CR4","unstructured":"Schaffer, J., Whitley, D., Eshelman, L.: Combinations of genetic algorithms and neural networks: a survey of the state of the art. In: International Workshop on Combinations of Genetic Algorithms and Neural Networks, pp. 1\u201337 (1992)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Lu, Z., et al.: NSGA-Net: neural architecture search using multi-objective genetic algorithm. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 419\u2013427. ACM, New York, NY, USA (2019)","DOI":"10.1145\/3321707.3321729"},{"key":"42_CR6","unstructured":"Yu, K., Sciuto, C., Jaggi, M., Musat, C., Salzmann, M.: Evaluating the search phase of neural architecture search. In: Conference on Learning Representations, ICLR (2020)"},{"key":"42_CR7","unstructured":"White, C., Nolen, S., Savani, Y.: Exploring the loss landscape in neural architecture search. In: Conference on Uncertainty in Artificial Intelligence, UAI. Proceedings of Machine Learning Research, vol. 161, pp. 654\u2013664. AUAI Press (2021)"},{"key":"42_CR8","unstructured":"Kandasamy, K., Neiswanger, W., Schneider, J., P\u00f3czos, B., Xing, E.P.: Neural architecture search with Bayesian optimisation and optimal transport. In: Advances in Neural Information Processing Systems, NeurIPS 2018, pp. 2020\u20132029 (2018)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Elsken, T., Metzen, J.H., Hutter, F.: Neural architecture search: a survey. J. Mach. Learn. Res. 20, 55:1\u201355:21 (2019)","DOI":"10.1007\/978-3-030-05318-5_11"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"108216","DOI":"10.1109\/ACCESS.2020.3001505","volume":"8","author":"NM Rodrigues","year":"2020","unstructured":"Rodrigues, N.M., Silva, S., Vanneschi, L.: A study of generalization and fitness landscapes for neuroevolution. IEEE Access 8, 108216\u2013108234 (2020)","journal-title":"IEEE Access"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-61723-X_985","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"H Ros\u00e9","year":"1996","unstructured":"Ros\u00e9, H., Ebeling, W., Asselmeyer, T.: The density of states\u2014a measure of the difficulty of optimisation problems. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 208\u2013217. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_985"},{"key":"42_CR12","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann (1995)"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Tomassini, M., Verel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 555\u2013562. ACM (2008)","DOI":"10.1145\/1389095.1389204"},{"key":"42_CR14","unstructured":"Ying, C., Klein, A., Christiansen, E., Real, E., Murphy, K., Hutter, F.: NAS-Bench-101: towards reproducible neural architecture search. In: International Conference on Machine Learning, ICML, vol. 97, pp. 7105\u20137114. PMLR (2019)"},{"key":"42_CR15","unstructured":"Dong, X., Yang, Y.: NAS-Bench-201: extending the scope of reproducible neural architecture search. In: Conference on Learning Representations, ICLR (2020)"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Dong, X., Liu, L., Musial, K., Gabrys, B.: NATS-Bench: benchmarking NAS algorithms for architecture topology and size. IEEE Trans. Pattern Anal. Mach. Intell. 7(2022), 3634\u20133646 (2021)","DOI":"10.1109\/TPAMI.2021.3054824"},{"key":"42_CR17","first-page":"187","volume":"117","author":"PF Stadler","year":"2002","unstructured":"Stadler, P.F.: Fitness landscapes. Appl. Math. Comput. 117, 187\u2013207 (2002)","journal-title":"Appl. Math. Comput."},{"key":"42_CR18","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search: Framework and Applications, pp. 363\u2013397. Springer, US, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_12","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"42_CR19","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. Int. J. Complex Syst. 1695 (2006)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:46:35Z","timestamp":1710261995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"85","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":"46% - 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.75","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.11","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}