{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:10:49Z","timestamp":1760148649922,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The performance of optimization algorithms, and consequently of AI\/machine learning solutions, is strongly influenced by the setting of their hyperparameters. Over the last decades, a rich literature has developed proposing methods to automatically determine the parameter setting for a problem of interest, aiming at either robust or instance-specific settings. Robust setting optimization is already a mature area of research, while instance-level setting is still in its infancy, with contributions mainly dealing with algorithm selection. The work reported in this paper belongs to the latter category, exploiting the learning and generalization capabilities of artificial neural networks to adapt a general setting generated by state-of-the-art automatic configurators. Our approach differs significantly from analogous ones in the literature, both because we rely on neural systems to suggest the settings, and because we propose a novel learning scheme in which different outputs are proposed for each input, in order to support generalization from examples. The approach was validated on two different algorithms that optimized instances of two different problems. We used an algorithm that is very sensitive to parameter settings, applied to generalized assignment problem instances, and a robust tabu search that is purportedly little sensitive to its settings, applied to quadratic assignment problem instances. The computational results in both cases attest to the effectiveness of the approach, especially when applied to instances that are structurally very different from those previously encountered.<\/jats:p>","DOI":"10.3390\/a16060267","type":"journal-article","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T16:17:33Z","timestamp":1685204253000},"page":"267","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Individualized Hyperparameter Settings"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1220-1235","authenticated-orcid":false,"given":"Vittorio","family":"Maniezzo","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Bologna, 47521 Cesena, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0397-0603","authenticated-orcid":false,"given":"Tingting","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No Free Lunch Theorems for Optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","article-title":"Benders decomposition, Lagrangean relaxation and metaheuristic design","volume":"15","author":"Boschetti","year":"2009","journal-title":"J. Heuristics"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Boschetti, M., and St\u00fctzle, T. (2021). Matheuristics, Springer International Publishing. EURO Advanced Tutorials on Operational Research.","DOI":"10.1007\/978-3-030-70277-9"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2996355","article-title":"A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms","volume":"49","author":"Aleti","year":"2016","journal-title":"ACM Comput. Surv."},{"key":"ref_6","first-page":"1","article-title":"Automated Algorithm Selection: Survey and Perspectives","volume":"27","author":"Kerschke","year":"2018","journal-title":"Evol. Comput."},{"key":"ref_7","first-page":"1","article-title":"Machine Learning into Metaheuristics: A Survey and Taxonomy","volume":"54","author":"Talbi","year":"2021","journal-title":"ACM Comput. Surv."},{"key":"ref_8","unstructured":"Flasch, O., Koch, P., and Konen, W. (2010). Proceedings 20. Workshop Computational Intelligence, KIT Scientific Publishing."},{"key":"ref_9","unstructured":"Langdon, W., Cant\u00fa-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., and Wegener, J. (2002, January 9\u201313). A Racing Algorithm for Configuring Metaheuristics. Proceedings of the GECCO 2002, New York, NY, USA."},{"key":"ref_10","first-page":"186","article-title":"Automated Configuration of Mixed Integer Programming Solvers","volume":"Volume 6140","author":"Lodi","year":"2012","journal-title":"Proceedings of the CPAIOR 2010"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","article-title":"ParamILS: An Automatic Algorithm Configuration Framework","volume":"36","author":"Hutter","year":"2009","journal-title":"J. Artif. Intell. Res."},{"key":"ref_12","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"Birattari","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Bacanin, N., Bezdan, T., Tuba, E., Strumberger, I., and Tuba, M. (2020). Optimizing Convolutional Neural Network Hyperparameters by Enhanced Swarm Intelligence Metaheuristics. Algorithms, 13.","DOI":"10.3390\/a13030067"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Filippou, K., Aifantis, G., Papakostas, G., and Tsekouras, G. (2023). Structure Learning and Hyperparameter Optimization Using an Automated Machine Learning (AutoML) Pipeline. Information, 14.","DOI":"10.3390\/info14040232"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Esmaeili, Z.A., and Ghorrati, E.T.M. (2023). Agent-Based Collaborative Random Search for Hyperparameter Tuning and Global Function Optimization. Systems, 11.","DOI":"10.3390\/systems11050228"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T., Chiarandini, M., Paquete, L., and Preuss, M. (2010). Experimental Methods for the Analysis of Optimization Algorithms, Springer.","DOI":"10.1007\/978-3-642-02538-9"},{"key":"ref_17","unstructured":"Rechenberg, I. (1973). Evolutionsstrategie\u2014Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution, Frommann-Holzboog-Verlag."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","article-title":"Evolution Strategies\u2014A Comprehensive Introduction","volume":"1","author":"Beyer","year":"2002","journal-title":"Nat. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","article-title":"The Algorithm Selection Problem","volume":"15","author":"Rice","year":"1976","journal-title":"Adv. Comput."},{"key":"ref_20","unstructured":"Xu, L., Hutter, F., Hoos, H., and Leyton-Brown, K. (2023, May 04). SATzilla2009: An Automatic Algorithm Portfolio for SAT. Available online: https:\/\/www.cs.ubc.ca\/~hutter\/papers\/09-SATzilla-solver-description.pdf."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1162\/evco_a_00215","article-title":"Leveraging TSP Solver Complementarity through Machine Learning","volume":"26","author":"Kerschke","year":"2017","journal-title":"Evol. Comput."},{"key":"ref_22","first-page":"210","article-title":"Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection","volume":"24","author":"Xu","year":"2010","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_23","unstructured":"Kotthoff, L. (2013). LLAMA: Leveraging Learning to Automatically Manage Algorithms. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3572895","article-title":"Instance Space Analysis for Algorithm Testing: Methodology and Software Tools","volume":"55","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"ref_25","first-page":"751","article-title":"ISAC\u2014Instance-Specific Algorithm Configuration","volume":"215","author":"Kadioglu","year":"2010","journal-title":"Front. Artif. Intell. Appl."},{"key":"ref_26","unstructured":"Dobslaw, F. (2010). A Parameter Tuning Framework for Metaheuristics Based on Design of Experiments and Artificial Neural Networks, World Academy of Science, Engineering and Technology."},{"key":"ref_27","unstructured":"Maniezzo, V. (2023, February 09). LagrHeu Public Code. Web Page. Available online: https:\/\/github.com\/maniezzo\/LagrHeu."},{"key":"ref_28","unstructured":"Taillard, E. (2023, February 09). \u00c9ric Taillard Public Codes. Web Page. Available online: http:\/\/mistic.heig-vd.ch\/taillard\/."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1985). Minimization Methods for Non-Differentiable Functions, Springer.","DOI":"10.1007\/978-3-642-82118-9"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of Unsmooth functionals","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"ref_31","unstructured":"Maniezzo, V. (2023, February 09). GAPlib: Bridging the GAP. Some Generalized Assignment Problem Instances. Web Page. Available online: http:\/\/astarte.csr.unibo.it\/gapdata\/GAPinstances.html."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu Search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Glover, F., and Laguna, M. (1997). Tabu Search, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref_35","unstructured":"Burkard, R., \u00c7ela, E., Karisch, S.E., Rendl, F., Anjos, M., and Hahn, P. (2023, February 09). QAPLIB\u2014A Quadratic Assignment Problem Library\u2014Problem Instances and Solutions. Web Page. Available online: https:\/\/datashare.ed.ac.uk\/handle\/10283\/4390."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1015454612213","article-title":"On the Hardness of the Quadratic Assignment Problem with Metaheuristics","volume":"8","author":"Angel","year":"2002","journal-title":"J. Heuristics"},{"key":"ref_37","unstructured":"Yagiura, M. (2023, February 09). GAP (Generalized Assignment Problem) Instances. Web Page. Available online: https:\/\/www-or.amp.i.kyoto-u.ac.jp\/members\/yagiura\/gap\/."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalized assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","unstructured":"(2023, February 09). Accord.net. Web Page. Available online: http:\/\/accord-framework.net\/."},{"key":"ref_40","unstructured":"(2023, February 09). ANNT. Web Page. Available online: https:\/\/github.com\/cvsandbox\/ANNT."},{"key":"ref_41","unstructured":"(2023, February 09). Tensorflow. Web Page. Available online: https:\/\/www.tensorflow.org\/."},{"key":"ref_42","unstructured":"(2023, February 09). Nnet (caret). Web Page. Available online: https:\/\/cran.r-project.org\/web\/packages\/nnet."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/267\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:43:10Z","timestamp":1760125390000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":42,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["a16060267"],"URL":"https:\/\/doi.org\/10.3390\/a16060267","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}