FAR-DPO: Feasibility-Aware and Robust Direct Preference Optimization for Cyclic Peptide Design
Not on the map. Why?
Abstract (arXiv)
Cyclic peptides are emerging as promising molecular scaffolds in drug discovery due to their high binding affinity and structural stability. However, extending generative models from linear to cyclic peptide design remains challenging, as cyclization sharply restricts the feasible design space through coupled geometric and biophysical constraints. Moreover, limited training data has led existing approaches to rely largely on zero-shot generation or post hoc filtering, resulting in low yields of feasible designs and limited control over multi-objective trade-offs. To address these limitations, we propose FAR-DPO (Feasibility-Aware and Robust Direct Preference Optimization), an architecture-agnostic framework that steers generative models toward structurally and biophysically feasible cyclic peptide designs, particularly for challenging targets. FAR-DPO integrates feasibility-aware preference construction with difficulty-aware group-robust optimization. Specifically, it constructs within-target preference pairs through feasibility-gated multi-objective dominance and adaptively reweights predefined difficulty groups according to their current preference losses. On the CPSea LNR benchmark, under a fixed generation budget, FAR-DPO increases overall success rate from 46.89% to 57.79% on PepGLAD and from 47.96% to 49.57% on PepFlow. These gains also extend to the hardest target quartile and are accompanied by more favorable best-per-target binding scores. Together, these results demonstrate FAR-DPO's effectiveness in improving feasibility and target-wise robustness.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 31 references that are in the map. First posted on arXiv 20 Aug 2026.
Builds on
12 of 31 references.
References · 12
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2017Molecular De Novo Design through Deep Reinforcement Learningcited by 267
- 2024PepTune: De Novo Generation of Therapeutic Peptides with Multi-Objective-Guided Discrete Diffusioncited by 37
- 2024Full-Atom Peptide Design based on Multi-modal Flow Matchingcited by 34
- 2024Antigen-Specific Antibody Design via Direct Energy-based Preference Optimizationcited by 30
- 2024PPFlow: Target-aware Peptide Design with Torsional Flow Matchingcited by 26
- 2025Zero-Shot Cyclic Peptide Design via Composable Geometric Constraintscited by 4
- 2026Linear-DPO: Linear Direct Preference Optimization for Diffusion and Flow-Matching Generative Modelscited by 4
- 2025Designing Cyclic Peptides via Harmonic SDE with Atom-Bond Modelingcited by 2
- 2026GeoCycler: Reward-Aligned 3D Diffusion for Constraint-Conditioned Cyclic Peptide Designcited by 1
- 2026APCyc: Property-Informed Design of Cyclic Peptides via Automated Cyclizationcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025PepThink-R1: LLM for Interpretable Cyclic Peptide Optimization with CoT SFT and Reinforcement Learning
- 2024Improving Inverse Folding for Peptide Design with Diversity-regularized Direct Preference Optimization
- 2026Confidence is the key: how conformal prediction enhances the generative design of permeable peptides
- 2025Improving Protein Sequence Design through Designability Preference Optimization
- 2024Decomposed Direct Preference Optimization for Structure-Based Drug Design
- 2026PepALD: Macrocyclic Peptide Generation via Autoregressive Latent Diffusion
- 2026DC-Flow: Target-Conditioned Cyclic Peptide Design via Delayed-Coupling Flow Matching
- 2025De Novo Molecular Design Enabled by Direct Preference Optimization and Curriculum Learning