Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking
Authors: Daria Frolova, Talgat Daulbaev, Egor Sevriugov, Sergei A. Nikolenko, Dmitry N. Ivankov, Ivan Oseledets, Marina A. Pak
Organizations: Ligand Pro, Moscow, Russia · Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia · Skolkovo Institute of Science and Technology, Center for Molecular and Cellular Biology, Moscow, Russia · Artificial Intelligence Research Institute, Moscow, Russia
Predicting a protein--ligand binding pose is central to structure-based drug design, yet current docking methods still struggle to combine speed, accuracy and physical plausibility. We introduce Matcha, which refines a ligand pose by three flow-matching stages in translation, rotation and torsion space, then minimizes, filters and ranks candidates with GNINA. Across the benchmarks considered, Matcha attains the strongest physical plausibility and runs about 28× faster than modern large-scale co-folding models. Code and benchmarking artifacts are available at https://github.com/LigandPro/Matcha and archived at https://doi.org/10.5281/zenodo.23568093. Model checkpoints are archived at https://doi.org/10.5281/zenodo.23569055.
Figures & tables
Figure 1: Matcha overview. (a) Multi-stage docking pipeline. Matcha uses three flow-matching stages to generate candidate ligand poses, followed by GNINA minimization, unsupervised plausibility filtering and GNINA -based pose selection. Rotatable bonds and their periods define the torsional component of the generative state space. (b) Architecture of the Matcha velocity model used in stages 1–3. Ligand atoms, protein residues and dedicated translation and rotation tokens are processed by a transformer with distance-aware attention biases, followed by specialized heads for translation, rotation and torsion prediction.
Figure 2: Blind ligand docking performance across benchmarks. (a) Astex diverse set ( n=85 ). (b) PoseBusters V2 benchmark set ( n=308 ). (c) PDBBind test set ( n=363 ). (d) DockGen dataset ( n=330 ). For Matcha , bars show the mean over five inference seeds, and the error bars are one standard deviation across those seeds. The interval to the left of each Matcha bar is the variability of the PB-valid rate; the interval to the right is the variability of the RMSD≤2\text{,}\mathrm{\text{\AA}}$$ rate.
Figure 3: Pocket-aware ligand docking performance. Docking success is evaluated with the true binding-site center provided, separating pose-generation accuracy from pocket-localization accuracy. (a) Astex diverse set. (b) PDBBind test set. (c) PoseBusters V2 . (d) DockGen . Success is reported as the percentage of predictions with symmetry-corrected heavy-atom RMSD ≤2\text{,}\mathrm{\text{\AA}}$$ and, where indicated, satisfying the PoseBusters validity criteria.
Figure 4: Average inference time on Astex and RMSD≤2\text{,}\mathrm{\text{\AA}}$$ & PB-valid success on PoseBusters V2 .
Figure 5: Ablation and sampling analyses of Matcha . Blind docking performance is evaluated after progressively varying generation stages, post-processing steps and the number of sampled poses. (a–c) Stage-wise performance on Astex , PDBBind and PoseBusters V2 , respectively. (d–f) Contribution of post-processing steps on the same benchmarks, respectively. (g) On Astex , full Matcha (blind and pocket-aware), the same poses ranked by the GNINA CNN score without validity filtering, and GNINA docking from Stage 1 or from a pocket center. (h) Sample-size dependence on PoseBusters V2 . Success is reported as the percentage of predictions with symmetry-corrected heavy-atom RMSD ≤2\text{,}\mathrm{\text{\AA}}$$ and, where indicated, satisfying the PoseBusters validity criteria.
Appendix figures & tables13 assets
Supplementary material from the paper’s appendix.
Appendix
Method
Time (s)
Matcha latte
8.5
Matcha
13.6
DiffDock-L
32
NeuralPlexer
65
FlowDock
39
GNINA (P2Rank) for one initial pose
18
Appendix
Table 1: Comparison of the average inference time for blind docking models (for Astex test set)
Figure 6: Blind ligand docking success rates with different pocket prediction methods on Astex Diverse set.
Figure 7: Blind ligand docking success rates with different pocket prediction methods on PDBBind test set.
Figure 8: Blind ligand docking success rates with different pocket prediction methods on PoseBusters V2 dataset.
Figure 9: Blind ligand docking success rates with different pocket prediction methods on DockGen dataset.
Figure 10: Comparison of full and pocket-based alignment strategies in blind docking for Astex Diverse set.
Figure 11: Comparison of full and pocket-based alignment strategies in blind docking for PDBBind test set.
Figure 12: Comparison of full and pocket-based alignment strategies in blind docking for PoseBusters V2 dataset.
Figure 13: Comparison of full and pocket-based alignment strategies in blind docking for DockGen dataset.
Figure 14: Blind ligand docking success rates on the PoseBusters V2 dataset for the full benchmark and the temporally held-out subset.
Figure 15: Effect of the number of Riemannian Euler integration steps. We evaluate the inference-time integration budget by varying the number of Euler steps used by Matcha . (a–c) Blind docking success rates as a function of the number of Euler steps on Astex , PDBBind and PoseBusters V2 , respectively. Success is reported as the percentage of predictions with symmetry-corrected heavy-atom RMSD ≤2\text{,}\mathrm{\text{\AA}}$$ and, where indicated, satisfying the PoseBusters validity criteria.
Figure 16: Effect of the Matcha post-processing module applied to the baseline methods. (a) Astex . (b) PoseBusters V2 . (c) PDBBind . (d) DockGen .
Figure 17: Speed–accuracy trade-off on PoseBusters V2 when every method receives the same Matcha post-processing module ( Minimized & scored success rate; see Figs. 16 – 16 ). Complexes per hour is computed on one NVIDIA A100 40GB GPU.
Diffusion models have become a dominant approach to structure-based drug design. However, because they are trained primarily to fit reference structures, they often place ligands in physically implausible poses that clash with the protein. We introduce MLIPDiff, an inference-time guidance method that can be applied to pretrained diffusion models for ligand generation. The method uses physics-informed guidance from UMA (Universal Models for Atoms), a machine-learned interatomic potential (MLIP). The guidance combines four weighted energy terms (protein-ligand interaction, ligand strain, steric clash, and pocket anchoring) and uses the original model checkpoint without retraining. On CrossDocked2020, MLIPDiff completely eliminates protein-ligand collisions while preserving the ligand's local geometry, improving bond-length distributions and physical plausibility relative to the base model. Compared to models such as NucleusDiff that are specifically designed to reduce atomic clashes, MLIPDiff achieves clash-free structures without compromising local geometry. It maintains the base model's PoseBusters pass rate and attains the best median Vina Score, Vina Min, and Vina Dock, surpassing both the base model and NucleusDiff, with a median of 59.6% of ligands per pocket binding more strongly than the reference. MLIPDiff thus addresses a limitation of prior methods by generating physically plausible structures with favorable predicted binding affinity using a single frozen model and no additional training.
All-atom generative modeling of 3D biomolecular complexes has emerged as the dominant paradigm for predicting the structure of proteins and protein-ligand systems. Generating structures at the atomic level of fidelity, however, typically requires expensive iterative diffusion rollouts, making both conventional deployment and inference-time search techniques computationally costly. In this paper, we introduce the Denoiser Cofolding All-Atom Flowmap (DeCAF) framework for distilling state-of-the-art all-atom cofolding models into all-atom flow maps that produce high-quality samples in only a few inference steps. We build DeCAF on a denoiser-based formulation of flow maps with endpoint losses that naturally support SE(3) rigid alignment, which we show is critical for training accurate models. We further derive a simple change of variables that lets DeCAF operate in the σ-space noise schedule of EDM-style architectures, enabling direct distillation from pretrained cofolding diffusion models. Equipped with DeCAF's flowmap lookahead, we introduce a purpose-built inference-time framework that improves sampling through reward-guided search. Empirically, DeCAF-Boltz statistically improves over Boltz-1x in both accuracy (RMSD) and physical validity scores of protein-ligand poses at strict NFE budgets on the challenging Runs N' Poses, while also showing a more optimal Pareto frontier across all inference compute budgets on PoseBusters. Distilling the state-of-the-art Pearl cofolding model, DeCAF-Pearl outperforms diffusion-based cofolding models and matches its teacher on success rate while using 5x fewer NFEs. We release our code at https://github.com/genesistherapeutics/decaf.
Gianluca Scarpellini, Ron Shprints, Peter Holderrieth +7
1Genesis Molecular AI · Massachusetts Institute of Technology · Carnegie Mellon University +2
Virtual screening performance depends heavily on the chosen docking and scoring methods. Recent AI-based tools such as DiffDock and NMDN have reported strong benchmark results, but their practical utility on realistic, experimentally-derived datasets remains unclear. Here we perform a large-scale evaluation on the LIT-PCBA library (15 targets, 578,295 ligand-target pairs with experimentally confirmed actives and inactives). We compare AutoDock-GPU and DiffDock for pose generation, followed by rescoring with GNINA and NMDN. We further evaluate rank-based consensus strategies and supervised machine learning models trained on docking features. GNINA rescoring of AutoDock-GPU poses (AutoDock-GNINA) emerged as the strongest single method with a median EF1% of 2.14. DiffDock-based approaches underperformed relative to AutoDock-GNINA, particularly on challenging targets such as OPRK1. Carefully designed consensus ranking improved robustness but did not surpass the best single scorer. Supervised ML re-ranking delivered the largest gains, achieving a median EF1% of 4.49 (+110% over AutoDock-GNINA). Our results highlight that even the best classical+ML hybrid workflows provide only modest early enrichment on realistic benchmarks. We conclude that no single docking method dominates across targets and that rigorously validated, cost-effective combinations with supervised re-ranking currently offer the most practical value for virtual screening.
Youssef Abo-Dahab, Xiaoiang Xiang, Joanne Chun +1
Department of Bioengineering and Therapeutic Sciences, Schools of Pharmacy and Medicine, University of California, San Francisco, San Francisco, CA, USA · UCSF–Stanford Center of Excellence in Regulatory Science and Innovation (CERSI), San Francisco, CA, USA