用量子硬件实现高阶特征选择,捕捉复杂依赖关系。
Quantum Feature Selection with Higher-Order Binary Optimization on Trapped-Ion Hardware

- 基于三体相互作用的量子优化框架,融合多变量依赖信息
- 在真实离子阱设备上实现,比传统方法更紧凑且保留关键特征
- 适合需要高效降维的机器学习预处理场景
我们提出一种基于高阶无约束二值优化(HUBO)的量子特征选择框架,显式包含超出标准二次编码的多变量依赖关系。与传统QUBO方法不同,该模型引入基于互信息计算的一、二、三体相互作用项,统一建模特征重要性、成对冗余及高阶统计结构。为避免全选等平凡解,加入结构化线性惩罚项以促进稀疏性并保留有用变量。所生成的HUBO实例通过离子阱硬件上的数字反绝热量子优化求解,并与无噪声量子模拟及两种经典降维方法(基于互信息的SelectKBest和主成分分析PCA)对比。在胆结石数据集和Spambase数据集上的实验表明,硬件执行结果与理想模拟高度一致,验证了当前离子阱处理器实现高阶特征选择哈密顿量的可行性。量子方法在保持竞争力分类性能的同时,生成紧凑且信息丰富的特征子集,凸显高阶量子优化在机器学习预处理中的潜力。
原文摘要 · Abstract (English)
We present a quantum feature-selection framework based on a higher-order unconstrained binary optimization (HUBO) formulation that explicitly incorporates multivariate dependencies beyond standard quadratic encodings. In contrast to QUBO-based approaches, the proposed model includes one-, two-, and three-body interaction terms derived from mutual-information measures, enabling the objective function to capture feature relevance, pairwise redundancy, and higher-order statistical structure within a unified energy model. To suppress trivial all-selected solutions, we further include structured linear penalties that promote sparsity while preserving informative variables. The resulting HUBO instances are optimized with digitized counterdiabatic quantum optimization on IonQ Forte and compared against noiseless quantum simulation as well as two classical dimensionality-reduction baselines: SelectKBest based on mutual information and principal component analysis (PCA). We evaluate the proposed workflow on two benchmark classification datasets, namely the Gallstone dataset and the Spambase dataset, and analyze both predictive performance and selected-subset structure. The results show good qualitative agreement between hardware executions and noiseless simulations, supporting the feasibility of implementing higher-order feature-selection Hamiltonians on current trapped-ion processors. In addition, the quantum approach yields competitive classification performance while producing compact and informative feature subsets, highlighting the potential of higher-order quantum optimization for machine-learning preprocessing tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。