{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T14:10:10Z","timestamp":1784038210590,"version":"3.55.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002954","name":"Universit\u00e0 degli Studi di Milano - Bicocca","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002954","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Searching for accurate machine and deep learning models is a computationally expensive and awfully energivorous process. A strategy which has been recently gaining importance to drastically reduce computational time and energy consumed is to exploit the availability of different information sources, with different computational costs and different \u201cfidelity,\u201d typically smaller portions of a large dataset. The multi-source optimization strategy fits into the scheme of Gaussian Process-based Bayesian Optimization. An Augmented Gaussian Process method exploiting multiple information sources (namely, AGP-MISO) is proposed. The Augmented Gaussian Process is trained using only \u201creliable\u201d information among available sources. A novel acquisition function is defined according to the Augmented Gaussian Process. Computational results are reported related to the optimization of the hyperparameters of a Support Vector Machine (SVM) classifier using two sources: a large dataset\u2014the most expensive one\u2014and a smaller portion of it. A comparison with a traditional Bayesian Optimization approach to optimize the hyperparameters of the SVM classifier on the large dataset only is reported.<\/jats:p>","DOI":"10.1007\/s00500-021-05684-7","type":"journal-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T10:02:52Z","timestamp":1615370572000},"page":"12591-12603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Green machine learning via augmented Gaussian processes and multi-information source optimization"],"prefix":"10.1007","volume":"25","author":[{"given":"Antonio","family":"Candelieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Perego","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Archetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,10]]},"reference":[{"key":"5684_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2018) Neural networks and deep learning. Springer, vol 10, pp 978\u2013983","DOI":"10.1007\/978-3-319-94463-0"},{"key":"5684_CR2","unstructured":"Ariafar S, Mariet Z, Elhamifar E, Brooks D, Dy J, Snoek J (2020) Weighting is worth the wait: Bayesian optimization with importance sampling. arXiv preprint http:\/\/arxiv.org\/abs\/2002.09927"},{"key":"5684_CR100","first-page":"397","volume":"3","author":"P Auer","year":"2002","unstructured":"Auer P (2002) Using confidence bounds for exploitation-exploration trade-offs. J Mach Learn Res 3:397\u2013422","journal-title":"J Mach Learn Res"},{"key":"5684_CR3","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein T, Jung C, Zaefferer M (2015) Uncertainty management using sequential parameter optimization. In: Uncertainty management in simulation-optimization of complex systems. Springer, pp 79\u201399","DOI":"10.1007\/978-1-4899-7547-8_4"},{"key":"5684_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.inffus.2019.12.007","volume":"57","author":"S Bianco","year":"2020","unstructured":"Bianco S, Buzzelli M, Ciocca G, Schettini R (2020) Neural architecture search for image saliency fusion. Inf Fusion 57:89\u2013101","journal-title":"Inf Fusion"},{"key":"5684_CR6","volume-title":"Bayesian optimization and data science","author":"A Candelieri","year":"2019","unstructured":"Candelieri A, Archetti F (2019) Bayesian optimization and data science. Springer International Publishing"},{"key":"5684_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri A, Marques AN, Lam R, Willcox KE (2019) Reusing information for multifidelity active learning in reliability-based design optimization. In: AIAA Scitech 2019 Forum 1222","DOI":"10.2514\/6.2019-1222"},{"key":"5684_CR8","doi-asserted-by":"crossref","unstructured":"De Ath G, Fieldsend JE, Everson RM (2020) What do you mean? The role of the mean function in Bayesian optimisation. arXiv preprint http:\/\/arxiv.org\/abs\/2004.08349","DOI":"10.1145\/3377929.3398118"},{"issue":"2088","key":"5684_CR9","first-page":"3251","volume":"463","author":"AI Forrester","year":"2007","unstructured":"Forrester AI, Sobester A, Keane AJ (2007) Multi-fidelity optimization via surrogate modelling. Proc R Soc Math Phys Eng Sci 463(2088):3251\u20133269","journal-title":"Proc R Soc Math Phys Eng Sci"},{"key":"5684_CR10","doi-asserted-by":"crossref","unstructured":"Frazier PI (2018) Bayesian optimization. In: INFORMS tutorials in operations research, pp 255\u2013278","DOI":"10.1287\/educ.2018.0188"},{"issue":"3","key":"5684_CR12","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/s00158-018-2115-z","volume":"59","author":"SF Ghoreishi","year":"2019","unstructured":"Ghoreishi SF, Allaire D (2019) Multi-information source constrained Bayesian optimization. Struct Multidiscip Optim 59(3):977\u2013991","journal-title":"Struct Multidiscip Optim"},{"key":"5684_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/9780367815493","volume-title":"Surrogates: Gaussian process modeling, design, and optimization for the applied sciences","author":"RB Gramacy","year":"2020","unstructured":"Gramacy RB (2020) Surrogates: Gaussian process modeling, design, and optimization for the applied sciences. CRC Press"},{"key":"5684_CR14","unstructured":"Hao K (2019) Training a single AI model can emit as much carbon as five cars in their lifetimes. Deep learning has a terrible carbon footprint. MIT TECHNOLOGY REVIEW"},{"key":"5684_CR15","unstructured":"Heck D, Schatz G, Knapp J, Thouw T, Capdevielle JN (1998) CORSIKA: a Monte Carlo code to simulate extensie air showers (No. FZKA-6019)"},{"issue":"Jun","key":"5684_CR16","first-page":"1809","volume":"13","author":"P Hennig","year":"2012","unstructured":"Hennig P, Schuler CJ (2012) Entropy search for information-efficient global optimization. J Mach Learn Res 13(Jun):1809\u20131837","journal-title":"J Mach Learn Res"},{"key":"5684_CR17","unstructured":"Ho TK (1995) In: Proceedings of the 3rd international conference on document analysis and recognition. Random decision forests, pp 278\u2013282"},{"issue":"4","key":"5684_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0266-8920(97)00013-1","volume":"13","author":"DE Huntington","year":"1998","unstructured":"Huntington DE, Lyrintzis CS (1998) Improvements to and limitations of Latin hypercube sampling. Probab Eng Mech 13(4):245\u2013253","journal-title":"Probab Eng Mech"},{"key":"5684_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05318-5","volume-title":"Automated machine learning","author":"F Hutter","year":"2019","unstructured":"Hutter F, Kotthoff L, Vanschoren J (2019) Automated machine learning. Springer, New York, NY, USA"},{"issue":"4","key":"5684_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Global Optim 13(4):455\u2013492","journal-title":"J Global Optim"},{"key":"5684_CR21","unstructured":"Kandasamy K, Dasarathy G, Oliva JB, Schneider J, P\u00f3czos B (2016) Gaussian process bandit optimisation with multi-fidelity evaluations. In: Advances in neural information processing systems, pp 992\u20131000"},{"key":"5684_CR22","unstructured":"Klein A, Falkner S, Bartels S, Hennig P, Hutter F (2017) Fast Bayesian optimization of machine learning hyperparameters on large datasets. In: Artificial intelligence and statistics, pp 528\u2013536"},{"issue":"1","key":"5684_CR23","first-page":"826","volume":"18","author":"L Kotthoff","year":"2017","unstructured":"Kotthoff L, Thornton C, Hoos HH, Hutter F, Leyton-Brown K (2017) Auto-WEKA 2.0: automatic model selection and hyperparameter optimization in WEKA. J Mach Learn Res 18(1):826\u2013830","journal-title":"J Mach Learn Res"},{"key":"5684_CR24","doi-asserted-by":"crossref","unstructured":"Kulkarni A, Shivananda A (2019) Deep learning for NLP. In: Natural language processing recipes, pp 185\u2013227. Apress, Berkeley, CA","DOI":"10.1007\/978-1-4842-4267-4_6"},{"issue":"1","key":"5684_CR101","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1115\/1.3653121","volume":"86","author":"HJ Kushner","year":"1964","unstructured":"Kushner HJ (1964) A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. J Basic Eng 86(1):97\u2013106","journal-title":"J Basic Eng"},{"key":"5684_CR25","doi-asserted-by":"crossref","unstructured":"Lam R, Allaire DL, Willcox KE (2015) Multifidelity optimization using statistical surrogate modeling for non-hierarchical information sources. In: 56th AIAA\/ASCE\/AHS\/ASC structures, structural dynamics, and materials conference 0143","DOI":"10.2514\/6.2015-0143"},{"key":"5684_CR26","doi-asserted-by":"crossref","unstructured":"L\u00e9vesque JC, Durand A, Gagn\u00e9 C, Sabourin R (2017) Bayesian optimization for conditional hyperparameter spaces. In: 2017 International joint conference on neural networks (IJCNN). IEEE, pp 286\u2013293","DOI":"10.1109\/IJCNN.2017.7965867"},{"key":"5684_CR27","unstructured":"Lindauer M, Hutter F (2019) Best practices for scientific research on neural architecture search. arXiv preprint http:\/\/arxiv.org\/abs\/1909.02453"},{"key":"5684_CR28","unstructured":"Liu J, Paisley J, Kioumourtzoglou MA, Coull B (2019) Accurate uncertainty estimation and decomposition in ensemble learning. In: Advances in neural information processing systems, pp 8950\u20138961"},{"key":"5684_CR29","unstructured":"Melis G, Dyer C, Blunsom P (2017) On the state of the art of evaluation in neural language models. arXiv preprint http:\/\/arxiv.org\/abs\/1707.05589"},{"key":"5684_CR30","doi-asserted-by":"crossref","unstructured":"Mo\u010dkus J (1975) On Bayesian methods for seeking the extremum. In: Optimization techniques IFIP technical conference. Springer, Berlin","DOI":"10.1007\/978-3-662-38527-2_55"},{"key":"5684_CR31","unstructured":"Nyikosa FM, Osborne MA, Roberts SJ (2018) Bayesian optimization for dynamic problems. arXiv preprint http:\/\/arxiv.org\/abs\/1803.03432"},{"key":"5684_CR32","doi-asserted-by":"crossref","unstructured":"Peifer M, Chamon LF, Paternain S, Ribeiro A (2019) Sparse learning of parsimonious reproducing kernel Hilbert space models. In: ICASSP 2019\u20132019 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 3292\u20133296","DOI":"10.1109\/ICASSP.2019.8682173"},{"key":"5684_CR33","unstructured":"Poloczek M, Wang J, Frazier P (2017) Multi-information source optimization. In: Advances in neural information processing systems, pp 4288\u20134298"},{"key":"5684_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmp.2018.03.001","volume":"85","author":"E Schulz","year":"2018","unstructured":"Schulz E, Speekenbrink M, Krause A (2018) A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions. J Math Psychol 85:1\u201316","journal-title":"J Math Psychol"},{"key":"5684_CR36","unstructured":"Schwartz R, Dodge J, Smith NA, Etzioni O (2019) Green AI. https:\/\/arxiv.org\/abs\/1907.10597"},{"issue":"1","key":"5684_CR37","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","volume":"104","author":"B Shahriari","year":"2016","unstructured":"Shahriari B, Swersky K, Wang Z, Adams RP, De Freitas N (2016) Taking the human out of the loop: a review of Bayesian optimization. Proc IEEE 104(1):148\u2013175","journal-title":"Proc IEEE"},{"key":"5684_CR38","unstructured":"Srinivas N, Krause A, Kakade S, Seeger M (2010) Gaussian process optimization in the bandit setting: no regret and experimental design. In: Proceedings of the 27th international conference on international conference on machine learning. Omnipress, pp 1015\u20131022"},{"issue":"5","key":"5684_CR39","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2011.2182033","volume":"58","author":"N Srinivas","year":"2012","unstructured":"Srinivas N, Krause A, Kakade SM, Seeger MW (2012) Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE Trans Inf Theory 58(5):3250\u20133265","journal-title":"IEEE Trans Inf Theory"},{"key":"5684_CR40","doi-asserted-by":"crossref","unstructured":"Strubell E, Ganesh A, McCallum A (2019) Energy and policy considerations for deep learning in NLP. In: Proceedings of the 57th annual meeting of the association for computational linguistics, pp 3645\u20133650","DOI":"10.18653\/v1\/P19-1355"},{"key":"5684_CR41","unstructured":"Swersky K, Snoek J, Adams RP (2013) Multi-task Bayesian optimization. In: Advances in neural information processing systems, pp 2004\u20132012"},{"key":"5684_CR42","unstructured":"Vakili S, Picheny V, Durrande N (2020) Regret bounds for noise-free Bayesian optimization. arXiv preprint http:\/\/arxiv.org\/abs\/2002.05096"},{"key":"5684_CR43","volume-title":"Gaussian processes for machine learning, 2(3)","author":"CK Williams","year":"2006","unstructured":"Williams CK, Rasmussen CE (2006) Gaussian processes for machine learning, 2(3). MIT press, Cambridge, MA"},{"key":"5684_CR44","unstructured":"Wilson J, Hutter F, Deisenroth M (2018) Maximizing acquisition functions for Bayesian optimization. In: Advances in neural information processing systems, pp 9884\u20139895"},{"key":"5684_CR45","doi-asserted-by":"crossref","unstructured":"Wolpert DH (2002) The supervised learning no-free-lunch theorems. In: Soft computing and industry, pp 25\u201342. Springer, London","DOI":"10.1007\/978-1-4471-0123-9_3"},{"issue":"1","key":"5684_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.23919\/JCIN.2020.9055106","volume":"5","author":"X Yang","year":"2020","unstructured":"Yang X, Hua S, Shi Y, Wang H, Zhang J, Letaief KB (2020) Sparse optimization for green edge AI inference. J Commun Inf Netw 5(1):1\u201315","journal-title":"J Commun Inf Netw"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05684-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T23:54:02Z","timestamp":1671580442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05684-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,10]]},"references-count":45,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["5684"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05684-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,10]]},"assertion":[{"value":"9 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors have no conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}