Search, Select, Explain: A Taxonomy of Automated Optimization for Quantum Machine Learning
编号:53
访问权限:仅限参会人
更新:2026-10-04 23:27:36 浏览:6次
Online
摘要
Variational quantum algorithms are highly sensitive to ansatz design, data encoding, and optimizer hyperparameters, yet most quantum machine learning (QML) studies still tune these choices by hand. Automated hyperparameter optimization (HPO) and automated QML (AutoQML) address this gap by extending the classical Combined Algorithm Selection and Hyperparameter optimization (CASH) problem into the quantum domain, but the resulting literature is fragmented across search strategies and at least three unrelated systems that share the name "AutoQML." This paper surveys automated optimization techniques for QML, organizing the literature into a taxonomy of search strategies, architecture search, model-family selection, multi-objective formulations, and explainability integration, and compares representative open-source systems — AQMLator, the Fraunhofer IPA AutoQML framework, and our own Quoptuna platform — across a common set of capabilities. Among the systems compared here, none combines full architecture search, hyperparameter optimization, and explainability, and explainability-integrated AutoQML remains, to our knowledge, largely unaddressed in the 2021–2026 literature we surveyed. We close by identifying open challenges — barren plateaus' effect on search signal, evaluation cost, benchmark fragmentation, and search-process explainability — toward practical, reproducible AutoQML.
关键词
quantum machine learning,AutoQML,hyperparameter optimization,variational quantum algorithms,NISQ,neural architecture search,,explainable AI
稿件作者
Edwin Jose
Western Michigan University
Zachary D. Asher
Western Michigan University
Elise De Doncker
Western Michigan University
Guan Yue Hong
Western Michigan University
A.C. Fong
Western Michigan University
发表评论