Skip to content

Elite-Weighted Supervised Fine-tuning for Goal-Directed Molecular Optimization

Aug 2026 · 0 citations · 41 references
Computer Science

TL;DR

This work introduces Elite-Weighted Supervised Fine-tuning (EW-SFT), which uses reward to guide elite selection of high-scoring molecules, and updates the model by its own pretraining loss on that set, and consistently outperforms the corresponding native optimizers.

Abstract

Goal-directed optimization is essential for steering molecular generators to propose candidates with desired properties. However, it is often implemented with policy-gradient reinforcement learning, which requires a generation-trajectory log-probability whose form depends on the model architecture and generation procedure. This makes an optimizer difficult to reuse across architectures and conditional generative designs. Supervised fine-tuning needs none of that machinery, but its update is driven by a fixed dataset, so the reward never enters the update. We introduce Elite-Weighted Supervised Fine-tuning (EW-SFT), which uses reward to guide elite selection of high-scoring molecules, and updates the model by its own pretraining loss on that set. Ablations show that reward information is passed primarily through elite selection, rather than through continuous weighting within the selected set. Because the update consumes only scored molecules and the model's native loss, the same rule applies across autoregressive, masked-diffusion, and discrete-flow generators, and across de novo, motif-extension, and linker-design tasks. Under a fixed budget of 3D shape alignment oracle calls on two kinase reference compounds, EW-SFT consistently outperforms the corresponding native optimizers. It further improves goal-directed optimization under a 2D similarity oracle on four held-out references and achieves comparable performance on a sample-efficiency benchmark without a trajectory-level RL formulation. These results demonstrate that EW-SFT is a unified and effective optimizer across molecular generators, design constraints, references, and oracles.

View source

Similar papers

#reinforcement learning Open access Sep 2026

Controllable molecular generation with fine-tuned flow-matching model

A flexible reinforcement learning method is introduced for flow-matching based generative models, allowing the velocity field to be refined according to a user-defined reward function, enabling dynamic fine-tuning and joint optimization of features, outperforming baseline approaches in diverse optimization scenarios.

Kun-Yu Wang, Jon Paul Janet, Alessandro Tibo · 1 citation
#natural language process... Preprint Sep 2026

Expert-Space Exploration in MoE Reinforcement Learning

ESRL is introduced, an architecture-aware framework that explicitly explores the expert-routing space of MoE models, and preserves high-confidence experts as anchors, and restricts stochastic routing to a plausible candidate pool, thereby retaining reliable computation paths.

Hong-Yi He, Zheng-Wen Lin, Xiao Liu et al. · 0 citations
#machine learning Preprint Sep 2026

MARCO: Multi-Round Agentic Reinforcement for Conditional Molecular Optimization

This work introduces MARCO, an evaluator-grounded reinforcement-learning framework that trains molecular editors on bounded proposal--feedback--revision trajectories and aggregates shaped turn rewards into an undiscounted trajectory return for group-relative policy optimization.

Shi-Cheng Fang, Yu-Xin Wang, Zhuo Yang et al. · 0 citations
Book Open access Aug 2026

POLO: Preference-Guided Multi-Turn Reinforcement Learning for Sample-Efficient Lead Optimization

POLO (Preference-guided Optimization for Lead Optimization), a multi-turn Reinforcement Learning framework for sample-efficient lead optimization, which extracts learning signals from each trajectory at two complementary levels: trajectory-level policy optimization reinforces successful multi-turn strategies, while tur...

Ziqing Wang, Yibo Wen, William Pattie et al. · 0 citations
#machine learning Preprint Sep 2026

Fine-Tuning on Self-Generated and Reward-Weighted Data: Learning Dynamics, Convergence Rates, and Benefits of Off-Policyness

A unified theory for RE(S) is developed that covers the full spectrum of S, and can be interpreted as a stage-wise optimization process, where each stage takes $S$ gradient steps for minimizing the Kullback-Leibler distance to a fixed reward-weighted rollout distribution.

Zhi-Wei Wang, Yan-Xi Chen, Ya-Liang Li et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Timestep Weighting: A Hidden Key to Effective ELBO-Based Flow-Matching RL

ELBO-based reinforcement learning offers a sampler-agnostic approach to fine-tuning flow matching models with reward feedback. Timestep weighting in ELBO-based RL has large impact on performance, and it also provides a unified view (as we show in this work) to understand prediction losses heuristically chosen in prior...

Qin-Wei Ma, Jing-Zhe Shi, Si-Min Fan et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.