{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:24:50Z","timestamp":1780421090455,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"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-14721-0_27","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"382-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Surrogate-Assisted Multi-objective Optimization for Compiler Optimization Sequence Selection"],"prefix":"10.1007","author":[{"given":"Guojun","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shifei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Agakov, F., et al.: Using machine learning to focus iterative optimization. In: Proceedings of the International Symposium on Code Generation and Optimization, pp. 295\u2013305 (2006)","DOI":"10.1109\/CGO.2006.37"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ansel, J., et al.: OpenTuner: an extensible framework for program autotuning. In: Proceedings of the 23rd International Conference on Parallel Architectures and Compilation, pp. 303\u2013316 (2014)","DOI":"10.1145\/2628071.2628092"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3124452","volume":"14","author":"AH Ashouri","year":"2017","unstructured":"Ashouri, A.H., Bignoli, A., Palermo, G., Silvano, C., Kulkarni, S., Cavazos, J.: MICOMP: mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Trans. Archit. Code Optim. 14(3), 29 (2017)","journal-title":"ACM Trans. Archit. Code Optim."},{"issue":"5","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3197978","volume":"51","author":"AH Ashouri","year":"2018","unstructured":"Ashouri, A.H., Killian, W., Cavazos, J., Palermo, G., Silvano, C.: A survey on compiler autotuning using machine learning. ACM Comput. Surv. 51(5), 1\u201342 (2018)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2928270","volume":"13","author":"AH Ashouri","year":"2016","unstructured":"Ashouri, A.H., Mariani, G., Palermo, G., Park, E., Cavazos, J., Silvano, C.: COBAYN: compiler autotuning framework using Bayesian networks. ACM Trans. Archit. Code Optim. (TACO) 13(2), 1\u201325 (2016)","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"C\u00e1ceres, L.P., Bischl, B., St\u00fctzle, T.: Evaluating random forest models for irace. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1146\u20131153 (2017)","DOI":"10.1145\/3067695.3082057"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-13365-2_3","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"NABS Chebolu","year":"2014","unstructured":"Chebolu, N.A.B.S., Wankar, R.: Multi-objective exploration for compiler optimizations and parameters. In: Murty, M.N., He, X., Chillarige, R.R., Weng, P. (eds.) MIWAI 2014. LNCS (LNAI), vol. 8875, pp. 23\u201334. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13365-2_3"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Xu, N., Chen, P., Zhang, H.: Efficient compiler autotuning via Bayesian optimization. In: 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE), pp. 1198\u20131209. IEEE (2021)","DOI":"10.1109\/ICSE43902.2021.00110"},{"issue":"2","key":"27_CR10","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115\u2013148 (1995)","journal-title":"Complex Syst."},{"key":"27_CR11","unstructured":"Fursin, G.: Collective benchmark (cBench), a collection of open-source programs with multiple datasets assembled by the community to enable realistic benchmarking and research on program and architecture optimization (2010). http:\/\/cTuning.org\/cbench"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"107463","DOI":"10.1016\/j.cie.2021.107463","volume":"159","author":"Q Gu","year":"2021","unstructured":"Gu, Q., Wang, D., Jiang, S., Xiong, N., Jin, Y.: An improved assisted evolutionary algorithm for data-driven mixed integer optimization based on Two_Arch. Comput. Ind. Eng. 159, 107463 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"107049","DOI":"10.1016\/j.knosys.2021.107049","volume":"223","author":"Q Gu","year":"2021","unstructured":"Gu, Q., Wang, Q., Li, X., Li, X.: A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems. Knowl.-Based Syst. 223, 107049 (2021)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1461928.1461946","volume":"52","author":"M Hall","year":"2009","unstructured":"Hall, M., Padua, D., Pingali, K.: Compiler research: the next 50 years. Commun. ACM 52(2), 60\u201367 (2009)","journal-title":"Commun. ACM"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-030-58112-1_32","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"W Hong","year":"2020","unstructured":"Hong, W., Yang, P., Wang, Y., Tang, K.: Multi-objective magnitude-based pruning for latency-aware deep neural network compression. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 470\u2013483. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_32"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Lokuciejewski, P., Plazar, S., Falk, H., Marwedel, P., Thiele, L.: Multi-objective exploration of compiler optimizations for real-time systems. In: 2010 13th IEEE International Symposium on Object\/Component\/Service-Oriented Real-Time Distributed Computing, pp. 115\u2013122. IEEE (2010)","DOI":"10.1109\/ISORC.2010.15"},{"issue":"12","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1002\/spe.1079","volume":"41","author":"P Lokuciejewski","year":"2011","unstructured":"Lokuciejewski, P., Plazar, S., Falk, H., Marwedel, P., Thiele, L.: Approximating pareto optimal compiler optimization sequences-a trade-off between WCET, ACET and code size. Softw. Pract. Experience 41(12), 1437\u20131458 (2011)","journal-title":"Softw. Pract. Experience"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s12293-016-0199-9","volume":"10","author":"C Sun","year":"2018","unstructured":"Sun, C., Ding, J., Zeng, J., Jin, Y.: A fitness approximation assisted competitive swarm optimizer for large scale expensive optimization problems. Memetic Comput. 10(2), 123\u2013134 (2018)","journal-title":"Memetic Comput."},{"issue":"2","key":"27_CR19","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TEVC.2019.2924461","volume":"24","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Wang, H., Xue, B., Jin, Y., Yen, G.G., Zhang, M.: Surrogate-assisted evolutionary deep learning using an end-to-end random forest-based performance predictor. IEEE Trans. Evol. Comput. 24(2), 350\u2013364 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ins.2015.03.018","volume":"311","author":"HC Valdiviezo","year":"2015","unstructured":"Valdiviezo, H.C., Van Aelst, S.: Tree-based prediction on incomplete data using imputation or surrogate decisions. Inf. Sci. 311, 163\u2013181 (2015)","journal-title":"Inf. Sci."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, Y.Q., Lin, N.W.: A study on optimizing execution time and code size in iterative compilation. In: 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications, pp. 104\u2013109. IEEE (2012)","DOI":"10.1109\/IBICA.2012.46"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"}],"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-14721-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T18:24:34Z","timestamp":1727807074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 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)"}}]}}