Work

Homology-Aware Performance and Robustness of Hamiltonian-Inspired Graph-Spectral Learning for Protein Drug-Target Classification

Year: 2026
Type: article
Abstract: Graph-spectral representations may capture relationships among protein descriptors, but their predictive and robustness benefits require matched evaluation. We assessed a classical Hamiltonian-inspired filter using 88 descriptors for 9213 proteins with five outer and three inner homology-disjoint folds. In the principal 30% identity analysis, Spectral-64 achieved a Matthews correlation coefficient (MCC) of 0.4507 versus 0.4747 for Raw-88. A separate five-method refit gave MCC 0.4767 for Spectral-16 and 0.4579 for Spectral-64; both required more measured workflow time and memory than raw or principal-component controls. An additional 14-model robustness experiment froze clean-trained pipelines before 43 held-out input scenarios. Across 1%, 5% and 10% random descriptor missingness, Spectral-64 lost 0.0100 MCC versus 0.0269 for Raw-88: a retention advantage of 0.0169 (conditional 95% interval 0.0090–0.0245; Holm-adjusted p = 0.0004). Average-precision loss corroborated this result, but a higher absolute corrupted MCC was not established. No primary retention advantage was established over PCA-64 or under continuous-feature noise. Secondary coarse-rounding tests favored spectral retention against selected controls, without establishing an advantage over uniform spectral weighting. The contribution is therefore condition-specific performance retention alongside an inspectable predictive and computational trade-off, rather than general accuracy, quantum, or formal robustness superiority. Same-cohort development and synthetic perturbations limit external interpretation.
Language: English
Subfield: Drug Discovery
Open Access status: gold
Estimated APC paid: $3,258
OpenAlex ID: W7234942218
FWCI:
Cites: 46
Cited by:
Related to: 10