Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets
Not on the map. Why?
Abstract (arXiv)
Protein sequence optimization under tight oracle budgets requires methods that explore vast combinatorial spaces while making each evaluation informative. Existing reinforcement learning and off-policy generative approaches often degrade under surrogate noise, and position-agnostic mutation proposals risk disrupting functionally critical residues. We introduce SILO, a trajectory-level self-improvement imitation framework for oracle-budgeted protein design. SILO uses a hierarchical edit policy that decomposes each mutation into a position choice followed by a residue choice. In each active-learning round, the policy samples candidate trajectories via incremental stochastic beam search without replacement (SBS), and a UCB-based proxy ensemble, combined with an alanine-scan fitness score (AFS), selects candidates with functionally relevant edits for in silico oracle evaluation. The policy is then updated by next-action cross-entropy imitation on the round's best oracle-labeled trajectories, avoiding value-function estimation. Across eight reproduced protein fitness landscapes and five strong baselines from prior work, SILO achieves the highest maximum and top-100 mean fitness on 8 of 8 landscapes within our evaluations, often exhibiting faster early-stage improvement. In low-data and noisy-proxy stress tests on two landscapes per setting, SILO remains competitive or best when several baselines degrade. Ablations show that SBS with AFS account for much of the gains, with iterative imitation providing additional improvement. Code is available at: https://github.com/grimmlab/SILO.git
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 50 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
23 of 50 references.
References · 23
- 2017Attention Is All You Needcited by 59,932
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2017Hindsight Experience Replaycited by 1,096
- 2017Deep Reinforcement Learning that Matterscited by 727
- 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 723
- 2017Ray: A Distributed Framework for Emerging AI Applicationscited by 516
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 384
- 2019Evaluating Protein Transfer Learning with TAPEcited by 229
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 205
- 2022Biological Sequence Design with GFlowNetscited by 172
11 more
- 2019Conditioning by adaptive sampling for robust designcited by 110
- 2021Conservative Objective Models for Effective Offline Model-Based Optimizationcited by 87
- 2020AdaLead: A simple and robust adaptive greedy search algorithm for sequence designcited by 63
- 2024Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvementcited by 32
- 2018Design by adaptive samplingcited by 31
- 2024Self-Improved Learning for Scalable Neural Combinatorial Optimizationcited by 29
- 2024Self-Labeling the Job Shop Scheduling Problemcited by 23
- 2024Robust Optimization in Protein Fitness Landscapes Using Reinforcement Learning in Latent Spacecited by 13
- 2024Improved Off-policy Reinforcement Learning in Biological Sequence Designcited by 13
- 2024GraphXForm: Graph transformer for computer-aided molecular designcited by 6
- 2025ProSpero: Active Learning for Robust Protein Design Beyond Wild-Type Neighborhoodscited by 3
Built on by
Not cited yet.