{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:17:48Z","timestamp":1781565468284,"version":"3.54.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031272493","type":"print"},{"value":"9783031272509","type":"electronic"}],"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-27250-9_14","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:03:18Z","timestamp":1678320198000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning to\u00a0Predict Pareto-Optimal Solutions from\u00a0Pseudo-weights"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7402-9939","authenticated-orcid":false,"given":"Kalyanmoy","family":"Deb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aryan","family":"Gondkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suresh","family":"Anirudh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework. In: KDD 2019, pp. 2623\u20132631. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3292500.3330701","DOI":"10.1145\/3292500.3330701"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C., VanVeldhuizen, D.A., Lamont, G.: Evolutionary Algorithms for Solving Multi-objective Problems. Kluwer, Boston (2002)"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Deb, K., Srinivasan, A.: Innovization: innovating design principles through optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006), pp. 1629\u20131636. ACM, New York (2006)","DOI":"10.1145\/1143997.1144266"},{"key":"14_CR5","unstructured":"Deb, K.: Multi-objective optimization using evolutionary algorithms (2001)"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Deb, K., Roy, P.C., Hussein, R.: Surrogate modeling approaches for multiobjective optimization: methods, taxonomy, and results. Math. Comput. Appl. 26(1) (2021). https:\/\/doi.org\/10.3390\/mca26010005, https:\/\/www.mdpi.com\/2297-8747\/26\/1\/5","DOI":"10.3390\/mca26010005"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Deb, K., Sundar, J.: Reference point based multi-objective optimization using evolutionary algorithms. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 635\u2013642 (2006)","DOI":"10.1145\/1143997.1144112"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Farias, L.R.C., Ara\u00fajo, A.F.R.: IM-MOEA\/D: an inverse modeling multi-objective evolutionary algorithm based on decomposition. In: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 462\u2013467 (2021). https:\/\/doi.org\/10.1109\/SMC52423.2021.9658650","DOI":"10.1109\/SMC52423.2021.9658650"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.1109\/TCYB.2020.2985081","volume":"51","author":"C He","year":"2020","unstructured":"He, C., Huang, S., Cheng, R., Tan, K.C., Jin, Y.: Evolutionary multiobjective optimization driven by generative adversarial networks (GANs). IEEE Trans. Cybern. 51(6), 3129\u20133142 (2020)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602\u2013622 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR11","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May 2015, Conference Track Proceedings (2015). http:\/\/arxiv.org\/abs\/1412.6980"},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2021.3131952","volume":"26","author":"S Mittal","year":"2022","unstructured":"Mittal, S., Saxena, D.K., Deb, K., Goodman, E.D.: Enhanced innovized progress operator for evolutionary multi- and many-objective optimization. IEEE Trans. Evol. Comput. 26(5), 961\u2013975 (2022). https:\/\/doi.org\/10.1109\/TEVC.2021.3131952","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR13","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems, vol. 32, pp. 8024\u20138035. Curran Associates, Inc. (2019)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Pellicer, P.V., Escudero, M.I., Alzueta, S.F., Deb, K.: Gap finding and validation in evolutionary multi-and many-objective optimization. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 578\u2013586 (2020)","DOI":"10.1145\/3377930.3389835"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27250-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:06:08Z","timestamp":1678320368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27250-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031272493","9783031272509"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27250-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"20 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/emo2023.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"equinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"44","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":"68% - 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":"2.42","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":"2.49","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)"}}]}}