UniMatch通过多层级匹配与元学习,提升小样本药物发现的精准度。
UniMatch: Universal Matching from Atom to Task for Few-Shot Drug Discovery
- 构建原子到分子的分层匹配机制,显式捕捉结构特征。
- 在MoleculeNet上提升2.87% AUROC,FS-Mol上提升6.52% delta AUPRC。
- 适合小样本药物研发、跨任务迁移的研究者使用。
药物发现对多种疾病候选药物的识别至关重要,但成功率低导致标注数据稀缺,形成小样本学习难题。现有方法多聚焦单尺度特征,忽视决定分子性质的层次化结构。为此,我们提出通用匹配网络(UniMatch),一种结合显式分层分子匹配与隐式任务级匹配的双匹配框架,弥合多层次分子表征与任务级泛化之间的差距。具体而言,通过分层池化与匹配,显式捕获原子、子结构、分子等多层级结构特征,实现精准分子表征与比较;同时采用元学习策略实现隐式任务级匹配,使模型能捕捉跨任务共享模式并快速适应新任务。该统一匹配框架在确保有效分子对齐的同时,利用共享元知识实现快速适配。实验表明,UniMatch在MoleculeNet和FS-Mol基准上优于当前最优方法,分别提升2.87% AUROC与6.52% delta AUPRC;在Meta-MolNet基准上也展现出优异泛化能力。
原文摘要 · Abstract (English)
Drug discovery is crucial for identifying candidate drugs for various diseases.However, its low success rate often results in a scarcity of annotations, posing a few-shot learning problem. Existing methods primarily focus on single-scale features, overlooking the hierarchical molecular structures that determine different molecular properties. To address these issues, we introduce Universal Matching Networks (UniMatch), a dual matching framework that integrates explicit hierarchical molecular matching with implicit task-level matching via meta-learning, bridging multi-level molecular representations and task-level generalization. Specifically, our approach explicitly captures structural features across multiple levels, such as atoms, substructures, and molecules, via hierarchical pooling and matching, facilitating precise molecular representation and comparison. Additionally, we employ a meta-learning strategy for implicit task-level matching, allowing the model to capture shared patterns across tasks and quickly adapt to new ones. This unified matching framework ensures effective molecular alignment while leveraging shared meta-knowledge for fast adaptation. Our experimental results demonstrate that UniMatch outperforms state-of-the-art methods on the MoleculeNet and FS-Mol benchmarks, achieving improvements of 2.87% in AUROC and 6.52% in delta AUPRC. UniMatch also shows excellent generalization ability on the Meta-MolNet benchmark.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。