{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:27:01Z","timestamp":1773271621509,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:00:00Z","timestamp":1695945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:00:00Z","timestamp":1695945600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11590-023-02057-x","type":"journal-article","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T17:01:51Z","timestamp":1696006911000},"page":"1383-1404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A gradient-based bilevel optimization approach for tuning regularization hyperparameters"],"prefix":"10.1007","volume":"18","author":[{"given":"Ankur","family":"Sinha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanmay","family":"Khandait","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raja","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,29]]},"reference":[{"key":"2057_CR1","doi-asserted-by":"crossref","unstructured":"Bennett, K.P., Kunapuli, G., Hu, J., Pang, J.: Bilevel optimization and machine learning. In: Proceedings of the 2008 World Congress on Computational Intelligence, pp. 25\u201347 (2008)","DOI":"10.1007\/978-3-540-68860-0_2"},{"key":"2057_CR2","unstructured":"Von Stackelberg, H.: The Theory of the Market Economy. Oxford University Press, Oxford (1952)"},{"issue":"1","key":"2057_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken, J., McGill, J.T.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1), 37\u201344 (1973)","journal-title":"Oper. Res."},{"issue":"2","key":"2057_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Malo, P., Deb, K.: A review on bilevel optimization: From classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. 22(2), 276\u2013295 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2057_CR5","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Springer, Heidelberg, Germany (2002)"},{"key":"2057_CR6","volume-title":"Practical Bilevel Optimization: Algorithms and Applications","author":"JF Bard","year":"2013","unstructured":"Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications, vol. 30. Springer, Heidelberg, Germany (2013)"},{"key":"2057_CR7","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., K\u00e9gl, B.: Algorithms for hyper-parameter optimization. In: Advances in Neural Information Processing Systems, pp. 2546\u20132554 (2011)"},{"key":"2057_CR8","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13, 281\u2013305 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2057_CR9","first-page":"6765","volume":"18","author":"L Li","year":"2017","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: a novel bandit-based approach to hyperparameter optimization. J. Mach. Learn. Res. 18(1), 6765\u20136816 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2057_CR10","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: International Conference on Learning and Intelligent Optimization, pp. 507\u2013523 (2011). Springer","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"2057_CR11","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2951\u20132959 (2012)"},{"key":"2057_CR12","unstructured":"Snoek, J., Rippel, O., Swersky, K., Kiros, R., Satish, N., Sundaram, N., Patwary, M., Prabhat, M., Adams, R.: Scalable bayesian optimization using deep neural networks. In: International Conference on Machine Learning, pp. 2171\u20132180 (2015)"},{"key":"2057_CR13","unstructured":"Maclaurin, D., Duvenaud, D., Adams, R.: Gradient-based hyperparameter optimization through reversible learning. In: International Conference on Machine Learning, pp. 2113\u20132122 (2015)"},{"key":"2057_CR14","unstructured":"Franceschi, L., Frasconi, P., Salzo, S., Grazzi, R., Pontil, M.: Bilevel programming for hyperparameter optimization and meta-learning. arXiv preprint arXiv:1806.04910 (2018)"},{"issue":"8","key":"2057_CR15","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1162\/089976600300015187","volume":"12","author":"Y Bengio","year":"2000","unstructured":"Bengio, Y.: Gradient-based optimization of hyperparameters. Neural Comput. 12(8), 1889\u20131900 (2000)","journal-title":"Neural Comput."},{"key":"2057_CR16","unstructured":"Pedregosa, F.: Hyperparameter optimization with approximate gradient. arXiv preprint arXiv:1602.02355 (2016)"},{"key":"2057_CR17","unstructured":"Lorraine, J., Duvenaud, D.: Stochastic hyperparameter optimization through hypernetworks. arXiv preprint arXiv:1802.09419 (2018)"},{"key":"2057_CR18","unstructured":"MacKay, M., Vicol, P., Lorraine, J., Duvenaud, D., Grosse, R.: Self-tuning networks: Bilevel optimization of hyperparameters using structured best-response functions. arXiv preprint arXiv:1903.03088 (2019)"},{"key":"2057_CR19","unstructured":"Mehra, A., Hamm, J.: Penalty method for inversion-free deep bilevel optimization. arXiv preprint arXiv:1911.03432 (2019)"},{"key":"2057_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02191670","volume":"81","author":"L Vicente","year":"1994","unstructured":"Vicente, L., Savard, G., J\u00fadice, J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81, 379\u2013399 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"2057_CR21","first-page":"125","volume":"42","author":"U Wen","year":"1991","unstructured":"Wen, U., Hsu, S.: Linear bi-level programming problems\u2014a review. J. Oper. Res. Soc. 42, 125\u2013133 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"2057_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/0305-0548(93)90013-9","volume":"20","author":"O Ben-Ayed","year":"1993","unstructured":"Ben-Ayed, O.: Bilevel linear programming. Comput. Oper. Res. 20, 485\u2013501 (1993)","journal-title":"Comput. Oper. Res."},{"key":"2057_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"J Bard","year":"1982","unstructured":"Bard, J., Falk, J.: An explicit solution to the multi-level programming problem. Comput. Oper. Res. 9, 77\u2013100 (1982)","journal-title":"Comput. Oper. Res."},{"key":"2057_CR24","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32, 783\u2013792 (1981)","journal-title":"J. Oper. Res. Soc."},{"key":"2057_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100237","volume":"3","author":"H Tuy","year":"1993","unstructured":"Tuy, H., Migdalas, A., V\u00e4rbrand, P.: A global optimization approach for the linear two-level program. J. Global Optim. 3, 1\u201323 (1993)","journal-title":"J. Global Optim."},{"key":"2057_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"J Bard","year":"1990","unstructured":"Bard, J., Moore, J.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11, 281\u2013292 (1990)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"2057_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/21.101139","volume":"21","author":"T Edmunds","year":"1991","unstructured":"Edmunds, T., Bard, J.: Algorithms for nonlinear bilevel mathematical programming. IEEE Trans. Syst. Man Cybern. 21, 83\u201389 (1991)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2057_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02098176","volume":"34","author":"F Al-Khayyal","year":"1992","unstructured":"Al-Khayyal, F., Horst, R., Pardalos, P.: Global optimization of concave functions subject to quadratic constraints: an application in nonlinear bilevel programming. Ann. Oper. Res. 34, 125\u2013147 (1992)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2057_CR29","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1137\/16M1098486","volume":"28","author":"I Yanikoglu","year":"2018","unstructured":"Yanikoglu, I., Kuhn, D.: Decision rule bounds for two-stage stochastic bilevel programs. SIAM J. Optim. 28(1), 198\u2013222 (2018)","journal-title":"SIAM J. Optim."},{"key":"2057_CR30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6377(94)90086-8","volume":"15","author":"G Savard","year":"1994","unstructured":"Savard, G., Gauvin, J.: The steepest descent direction for the nonlinear bilevel programming problem. Oper. Res. Lett. 15, 275\u2013282 (1994)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"2057_CR31","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/BF03182744","volume":"43","author":"G Liu","year":"1998","unstructured":"Liu, G., Han, J., Wang, S.: A trust region algorithm for bilevel programing problems. Chin. Sci. Bull. 43(10), 820\u2013824 (1998)","journal-title":"Chin. Sci. Bull."},{"issue":"4","key":"2057_CR32","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(01)00092-X","volume":"29","author":"P Marcotte","year":"2001","unstructured":"Marcotte, P., Savard, G., Zhu, D.L.: A trust region algorithm for nonlinear bilevel programming. Oper. Res. Lett. 29(4), 171\u2013179 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2057_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10589-005-4612-4","volume":"30","author":"B Colson","year":"2005","unstructured":"Colson, B., Marcotte, P., Savard, G.: A trust-region method for nonlinear bilevel programming: algorithm and computational experience. Comput. Optim. Appl. 30(3), 211\u2013227 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"2057_CR34","first-page":"444","volume":"6","author":"E Aiyoshi","year":"1981","unstructured":"Aiyoshi, E., Shimizu, K.: Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans. Syst. Man Cybern. 6, 444\u2013449 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2057_CR35","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","volume":"29","author":"E Aiyoshi","year":"1984","unstructured":"Aiyoshi, E., Shimizu, K.: A solution method for the static constrained Stackelberg problem via penalty method. IEEE Trans. Autom. Control 29, 1111\u20131114 (1984)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2057_CR36","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02098173","volume":"34","author":"Y Ishizuka","year":"1992","unstructured":"Ishizuka, Y., Aiyoshi, E.: Double penalty method for bilevel optimization problems. Ann. Oper. Res. 34, 73\u201388 (1992)","journal-title":"Ann. Oper. Res."},{"key":"2057_CR37","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"D White","year":"1993","unstructured":"White, D., Anandalingam, G.: A penalty function approach for solving bi-level linear programs. J. Global Optim. 3, 397\u2013419 (1993)","journal-title":"J. Global Optim."},{"issue":"1","key":"2057_CR38","first-page":"1","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu, R., Pittard, L., Anandalingam, G.: Genetic algorithm based approach to bi-level linear programming. Oper. Res. 28(1), 1\u201321 (1994)","journal-title":"Oper. Res."},{"issue":"2","key":"2057_CR39","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1061\/(ASCE)0733-947X(2000)126:2(115)","volume":"126","author":"Y Yin","year":"2000","unstructured":"Yin, Y.: Genetic algorithm based approach for bilevel programming models. J. Transp. Eng. 126(2), 115\u2013120 (2000)","journal-title":"J. Transp. Eng."},{"key":"2057_CR40","doi-asserted-by":"crossref","unstructured":"Zhu, X., Yu, Q., Wang, X.: A hybrid differential evolution algorithm for solving nonlinear bilevel programming with linear constraints. In: Cognitive Informatics, 2006. ICCI 2006. 5th IEEE International Conference On, vol. 1, pp. 126\u2013131 (2006)","DOI":"10.1109\/COGINF.2006.365687"},{"key":"2057_CR41","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.cor.2013.07.010","volume":"41","author":"A Sinha","year":"2014","unstructured":"Sinha, A., Malo, P., Frantsev, A., Deb, K.: Finding optimal strategies in a multi-period multi-leader-follower stackelberg game using an evolutionary algorithm. Comput. Oper. Res. 41, 374\u2013385 (2014)","journal-title":"Comput. Oper. Res."},{"key":"2057_CR42","doi-asserted-by":"crossref","unstructured":"Angelo, J., Krempser, E., Barbosa, H.: Differential evolution for bilevel programming. In: 2013 Congress on Evolutionary Computation (CEC-2013) (2013)","DOI":"10.1109\/CEC.2013.6557606"},{"issue":"13","key":"2057_CR43","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"SR Hejazi","year":"2002","unstructured":"Hejazi, S.R., Memariani, A., Jahanshahloo, G., Sepehri, M.M.: Linear bilevel programming solution by genetic algorithm. Comput. Oper. Res. 29(13), 1913\u20131925 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2057_CR44","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TSMCC.2004.841908","volume":"35","author":"Y Wang","year":"2005","unstructured":"Wang, Y., Jiao, Y., Li, H.: An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 35(2), 221\u201332 (2005)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"issue":"1","key":"2057_CR45","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10479-015-1878-5","volume":"235","author":"H Li","year":"2015","unstructured":"Li, H.: A genetic algorithm using a finite search space for solving nonlinear\/linear fractional bilevel programming problems. Annal. Oper. Res. 235(1), 543\u201358 (2015)","journal-title":"Annal. Oper. Res."},{"key":"2057_CR46","doi-asserted-by":"crossref","unstructured":"Sinha, A., Soun, T., Deb, K.: Evolutionary bilevel optimization using KKT proximity measure. In: 2017 IEEE Congress on Evolutionary Computation (CEC-2017), pp. 2412\u20132419 (2017)","DOI":"10.1109\/CEC.2017.7969597"},{"key":"2057_CR47","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.swevo.2018.06.004","volume":"44","author":"A Sinha","year":"2019","unstructured":"Sinha, A., Soun, T., Deb, K.: Using karush-kuhn-tucker proximity measure for solving bilevel optimization problems. Swarm Evol. Comput. 44, 496\u2013510 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"2057_CR48","doi-asserted-by":"crossref","unstructured":"Angelo, J.S., Krempser, E., Barbosa, H.J.C.: Differential evolution assisted by a surrogate model for bilevel programming problems. In: 2014 IEEE Congress on Evolutionary Computation (CEC 2014), pp. 1784\u20131791 (2014)","DOI":"10.1109\/CEC.2014.6900529"},{"issue":"2","key":"2057_CR49","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Malo, P., Deb, K.: Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur. J. Oper. Res. 257(2), 395\u2013411 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2057_CR50","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TEVC.2017.2670659","volume":"21","author":"MM Islam","year":"2017","unstructured":"Islam, M.M., Singh, H.K., Ray, T.: A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans. Evol. Comput. 21(5), 681\u2013696 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"2057_CR51","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10732-019-09426-9","volume":"26","author":"A Sinha","year":"2020","unstructured":"Sinha, A., Lu, Z., Deb, K., Malo, P.: Bilevel optimization based on iterative approximation of multiple mappings. J. Heuristics 26(2), 151\u2013185 (2020)","journal-title":"J. Heuristics"},{"issue":"10","key":"2057_CR52","doi-asserted-by":"publisher","first-page":"10639","DOI":"10.1109\/TCYB.2021.3061551","volume":"52","author":"A Sinha","year":"2021","unstructured":"Sinha, A., Shaikh, V.: Solving bilevel optimization problems using kriging approximations. IEEE Trans. Cybern. 52(10), 10639\u201310654 (2021)","journal-title":"IEEE Trans. Cybern."},{"issue":"5\u20136","key":"2057_CR53","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1080\/02331930701617551","volume":"56","author":"S Dempe","year":"2007","unstructured":"Dempe, S., Dutta, J., Mordukhovich, B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56(5\u20136), 577\u2013604 (2007)","journal-title":"Optimization"},{"issue":"1","key":"2057_CR54","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/120864015","volume":"23","author":"W Wiesemann","year":"2013","unstructured":"Wiesemann, W., Tsoukalas, A., Kleniati, P.-M., Rustem, B.: Pessimistic bilevel optimization. SIAM J. Optim. 23(1), 353\u2013380 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2057_CR55","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1080\/02331934.2012.696641","volume":"63","author":"S Dempe","year":"2014","unstructured":"Dempe, S., Mordukhovich, B.S., Zemkoho, A.B.: Necessary optimality conditions in pessimistic bilevel programming. Optimization 63(4), 505\u2013533 (2014)","journal-title":"Optimization"},{"issue":"2","key":"2057_CR56","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10732-019-09426-9","volume":"26","author":"A Sinha","year":"2020","unstructured":"Sinha, A., Lu, Z., Deb, K., Malo, P.: Bilevel optimization based on iterative approximation of multiple mappings. J. Heuristics 26(2), 151\u2013185 (2020)","journal-title":"J. Heuristics"},{"key":"2057_CR57","doi-asserted-by":"crossref","unstructured":"Sinha, A., Bedi, S., Deb, K.: Bilevel optimization based on kriging approximations of lower level optimal value function. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2018)","DOI":"10.1109\/CEC.2018.8477763"},{"key":"2057_CR58","first-page":"409","volume":"4","author":"J Sacks","year":"1989","unstructured":"Sacks, J., Welch, W.J., Mitchell, T.J., Wynn, H.P.: Design and analysis of computer experiments. Stat. Sci. 4, 409\u201323 (1989)","journal-title":"Stat. Sci."},{"issue":"4","key":"2057_CR59","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Global Optim."},{"key":"2057_CR60","unstructured":"Nocedal, J., Wright, S.J.: Penalty and Augmented Lagrangian Methods, pp. 497\u2013528. Springer, New York, NY (2006)"},{"key":"2057_CR61","unstructured":"UCI Machine Learning Repository: Communities and Crime Data Set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/communities+and+crime. Accessed: 2020-05-1"},{"key":"2057_CR62","unstructured":"LeCun, Y., Cortes, C., Burges, C.: MNIST Handwritten Digit Database (2010)"},{"key":"2057_CR63","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)"},{"key":"2057_CR64","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2623\u20132631 (2019)","DOI":"10.1145\/3292500.3330701"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02057-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02057-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02057-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T08:15:36Z","timestamp":1719044136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02057-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,29]]},"references-count":64,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2057"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02057-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,29]]},"assertion":[{"value":"2 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}