mlsanityData to 14 Oct 2026

Bidirectional Learning for Offline Model-based Biological Sequence Design

arXiv 2301.02931 ↗First posted 7 Jan 2023cs.CEcited by 20

Not on the map. Why?

Abstract (arXiv)

Offline model-based optimization aims to maximize a black-box objective function with a static dataset of designs and their scores. In this paper, we focus on biological sequence design to maximize some sequence score. A recent approach employs bidirectional learning, combining a forward mapping for exploitation and a backward mapping for constraint, and it relies on the neural tangent kernel (NTK) of an infinitely wide network to build a proxy model. Though effective, the NTK cannot learn features because of its parametrization, and its use prevents the incorporation of powerful pre-trained Language Models (LMs) that can capture the rich biophysical information in millions of biological sequences. We adopt an alternative proxy model, adding a linear head to a pre-trained LM, and propose a linearization scheme. This yields a closed-form loss and also takes into account the biophysical information in the pre-trained LM. In addition, the forward mapping and the backward mapping play different roles and thus deserve different weights during sequence optimization. To achieve this, we train an auxiliary model and leverage its weak supervision signal via a bi-level optimization framework to effectively learn how to balance the two mappings. Further, by extending the framework, we develop the first learning rate adaptation module textitAdaptive-η, which is compatible with all gradient-based algorithms for offline model-based optimization. Experimental results on DNA/protein sequence design tasks verify the effectiveness of our algorithm. Our code is available~hrefhttps://anonymous.4open.science/r/BIB-ICLR2023-Submission/README.mdhere.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jan 2023.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 4; 2024: 8; 2025: 6; 2026: 2.

20 papers.

Sort:

By area:

  1. 2023A Comprehensive Survey of Dataset Distillationcited by 115
  2. 2024Diffusion Models as Constrained Samplers for Optimization with Unknown Constraintscited by 35
  3. 2023Bootstrapped Training of Score-Conditioned Generator for Offline Design of Biological Sequencescited by 23
  4. 2024Compositional Generative Inverse Designcited by 20
  5. 2024Importance-Aware Adaptive Dataset Distillationcited by 18
  6. 2024ParetoFlow: Guided Flows in Multi-Objective Optimizationcited by 17
  7. 2025Offline Model-Based Optimization: Comprehensive Reviewcited by 15
  8. 2024Improved Off-policy Reinforcement Learning in Biological Sequence Designcited by 13
  9. 2024Offline Model-Based Optimization by Learning to Rankcited by 13
  10. 2024Design Editing for Offline Model-based Optimizationcited by 10
  11. 2024Robust Guided Diffusion for Offline Black-Box Optimizationcited by 8
  12. 2025Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddingscited by 7
8 more
  1. 2025Neural Genetic Search in Discrete Spacescited by 5
  2. 2023Protein Representation Learning via Knowledge Enhanced Primary Structure Modelingcited by 3
  3. 2025Overconfident Oracles: Limitations of In Silico Sequence Design Benchmarkingcited by 3
  4. 2023Towards Hybrid-grained Feature Interaction Selection for Deep Sparse Networkcited by 2
  5. 2026On the Learnability of Offline Model-Based Optimization: A Ranking Perspectivecited by 2
  6. 2025AffinityFlow: Guided Flows for Antibody Affinity Maturationcited by 1
  7. 2025Video-Enhanced Offline Reinforcement Learning: A Model-Based Approachcited by 1
  8. 2026Generative Refinement for Low-Budget Black-Box Optimizationcited by 0