Employee attrition is a costly operational risk marked by class imbalance and asymmetric misclassification costs. We study a cost-sensitive, gate-based Quantum-enhanced Support Vector Machine (Q-SVM) with class-dependent box constraints, implemented as a data re-uploading fidelity kernel and evaluated by exact statevector simulation with a depolarizing sensitivity check. We state three assumption-bound theoretical results: a convergence rate for cost-weighted kernel-target-alignment optimization under a weighted Polyak-Łojasiewicz condition; a reproducing-kernel-Hilbert-space margin bound that holds under an explicit disjoint-convex-hull separation hypothesis; and a high-probability Nyström error bound with a stratified minority-block scaling estimate in which all sampling factors are retained. On the IBM HR Analytics benchmark ( , attrition ), evaluated by repeated ( ) nested stratified cross-validation with all metrics computed from saved prediction vectors, the Q-SVM reaches a minority-class recall of 0.571, on a par with classical SVM kernels on the same features, while gradient-boosted trees lead on threshold-free metrics. A methodological finding of independent interest emerges from this comparison: threshold metrics on imbalanced data are strongly sensitive to the map from SVM margin to reported score, with recall at a fixed cut differing by more than 0.5 between two standard conventions applied to identical fitted models. We therefore report every threshold metric under both conventions. A factorial ablation attributes the recall regime to cost weighting rather than to the quantum kernel. We further identify the encoding bandwidth as the dominant hyperparameter of the pipeline: tuning it inside the inner loop raises AUC from 0.660 to 0.734 at four qubits and brings the Q-SVM to statistical parity with a tuned classical RBF at matched feature count, although a classical trigonometric map on the same encoding angles matches it in turn, so the gain is attributable to the encoding rather than to the quantum feature space. The principal empirical model is the fixed-kernel Q-SVM; the trainable variant, which the convergence theory describes, is evaluated separately, and a factorial localizes the entire cost-sensitivity effect in the SVM decision layer rather than in the kernel. A direct estimate of the RKHS convex-hull distance shows that the separation hypothesis of the margin bound is not satisfied on this benchmark. We frame the study as a feasibility indicator, not a demonstration of quantum advantage, and add calibration, decision-utility, and responsible-use analyses.
Cost-sensitive quantum kernels for imbalanced attrition prediction / Sáez-Ortuño, L., Forgas-Coll, S., Huertas-García, R., Ferrara, M.. - In: QUANTUM MACHINE INTELLIGENCE. - ISSN 2524-4906. - 8:2(2026). [10.1007/s42484-026-00464-8]
Cost-sensitive quantum kernels for imbalanced attrition prediction
Ferrara, MassimilianoConceptualization
2026-01-01
Abstract
Employee attrition is a costly operational risk marked by class imbalance and asymmetric misclassification costs. We study a cost-sensitive, gate-based Quantum-enhanced Support Vector Machine (Q-SVM) with class-dependent box constraints, implemented as a data re-uploading fidelity kernel and evaluated by exact statevector simulation with a depolarizing sensitivity check. We state three assumption-bound theoretical results: a convergence rate for cost-weighted kernel-target-alignment optimization under a weighted Polyak-Łojasiewicz condition; a reproducing-kernel-Hilbert-space margin bound that holds under an explicit disjoint-convex-hull separation hypothesis; and a high-probability Nyström error bound with a stratified minority-block scaling estimate in which all sampling factors are retained. On the IBM HR Analytics benchmark ( , attrition ), evaluated by repeated ( ) nested stratified cross-validation with all metrics computed from saved prediction vectors, the Q-SVM reaches a minority-class recall of 0.571, on a par with classical SVM kernels on the same features, while gradient-boosted trees lead on threshold-free metrics. A methodological finding of independent interest emerges from this comparison: threshold metrics on imbalanced data are strongly sensitive to the map from SVM margin to reported score, with recall at a fixed cut differing by more than 0.5 between two standard conventions applied to identical fitted models. We therefore report every threshold metric under both conventions. A factorial ablation attributes the recall regime to cost weighting rather than to the quantum kernel. We further identify the encoding bandwidth as the dominant hyperparameter of the pipeline: tuning it inside the inner loop raises AUC from 0.660 to 0.734 at four qubits and brings the Q-SVM to statistical parity with a tuned classical RBF at matched feature count, although a classical trigonometric map on the same encoding angles matches it in turn, so the gain is attributable to the encoding rather than to the quantum feature space. The principal empirical model is the fixed-kernel Q-SVM; the trainable variant, which the convergence theory describes, is evaluated separately, and a factorial localizes the entire cost-sensitivity effect in the SVM decision layer rather than in the kernel. A direct estimate of the RKHS convex-hull distance shows that the separation hypothesis of the margin bound is not satisfied on this benchmark. We frame the study as a feasibility indicator, not a demonstration of quantum advantage, and add calibration, decision-utility, and responsible-use analyses.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


