Latent Imputation before Prediction: A New Computational Paradigm for De Novo Peptide Sequencing
Ye Du, Chen Yang, Nanxi Yu, Wanyu Lin, Qian Zhao, Shujun Wang
TL;DR
This work addresses the challenge of missing fragmentation in de novo peptide sequencing from MS/MS data. It introduces LIPNovo, a latent-imputation-before-prediction framework that treats imputation as a set-prediction problem and uses bipartite matching to align latent theoretical peaks with observed spectra. By imputing latent peak representations prior to sequence decoding, LIPNovo achieves state-of-the-art performance across amino-acid, peptide, and PTM-level metrics on three benchmark datasets, significantly outperforming strong baselines. The approach demonstrates that latent-space augmentation can reduce ambiguity between spectra and peptide sequences, offering a practical and scalable paradigm for proteomics analysis.
Abstract
De novo peptide sequencing is a fundamental computational technique for ascertaining amino acid sequences of peptides directly from tandem mass spectrometry data, eliminating the need for reference databases. Cutting-edge models usually encode the observed mass spectra into latent representations from which peptides are predicted autoregressively. However, the issue of missing fragmentation, attributable to factors such as suboptimal fragmentation efficiency and instrumental constraints, presents a formidable challenge in practical applications. To tackle this obstacle, we propose a novel computational paradigm called \underline{\textbf{L}}atent \underline{\textbf{I}}mputation before \underline{\textbf{P}}rediction (LIPNovo). LIPNovo is devised to compensate for missing fragmentation information within observed spectra before executing the final peptide prediction. Rather than generating raw missing data, LIPNovo performs imputation in the latent space, guided by the theoretical peak profile of the target peptide sequence. The imputation process is conceptualized as a set-prediction problem, utilizing a set of learnable peak queries to reason about the relationships among observed peaks and directly generate the latent representations of theoretical peaks through optimal bipartite matching. In this way, LIPNovo manages to supplement missing information during inference and thus boosts performance. Despite its simplicity, experiments on three benchmark datasets demonstrate that LIPNovo outperforms state-of-the-art methods by large margins. Code is available at \href{https://github.com/usr922/LIPNovo}{https://github.com/usr922/LIPNovo}.
