Dataset Condensation Atlas

Application · Kernel and closed-form inner solvers

BIB

Bidirectional Learning for Offline Model-based Biological Sequence Design

Can Chen, Yingxue Zhang, Xue Liu, Mark Coates

ICML 2023 · first public 2023-01-07 · arXiv 2301.02931

paper ↗code ↗catalogued✓ abstract read

In one paragraph

Extends the bidirectional (forward/backward) offline model-based optimization idea to biological sequence design by replacing the NTK proxy with a linearized pretrained language model, giving a closed-form loss that keeps the biophysical information the NTK could not represent. A bi-level auxiliary model learns how to weight the forward and backward mappings, and a derived learning-rate-adaptation module is reported to improve DNA/protein sequence design over the NTK-only predecessor.

Where it sits

Design choices

Optimization regimesingle-level
Prior / networks usedllm

Builds on

Abstract (verbatim from 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 \textit{Adaptive}-$\eta$, 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~\href{https://anonymous.4open.science/r/BIB-ICLR2023-Submission/README.md}{here.}

BibTeX (generated; prefer the venue's official entry)
@article{chen2023bidirectional,
  title   = {Bidirectional Learning for Offline Model-based Biological Sequence Design},
  author  = {Can Chen and Yingxue Zhang and Xue Liu and Mark Coates},
  journal = {ICML 2023},
  year    = {2023}
}

Nearby in Kernel and closed-form inner solvers

2026-01

MMDD — Efficient Multi-modal Dataset Distillation via Analytic Parameter Matching

Deyu Bo, Xinchao Wang · ICML 2026notableVision–languagepaper ↗code ↗

2024-12

Provable KRR DD — Provable and Efficient Dataset Distillation for Kernel Ridge Regression

Yilan Chen, Wei Huang, Tsui-Wei Weng · NeurIPS 2024notablepaper ↗

2023-11

Rethinking Backdoor Attacks on Dataset Distillation: A Kernel Method Perspective

Ming-Yu Chung, Sheng-Yen Chou, Chia-Mu Yu et al. · ICLR 2024notablepaper ↗

2023-10

KRR-ST — Self-Supervised Dataset Distillation for Transfer Learning

Dong Bok Lee, Seanie Lee, Joonho Ko et al. · ICLR 2024corePre-training & transferpaper ↗code ↗

2023-06

SFGC — Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data

Xin Zheng, Miao Zhang, Chunyang Chen et al. · NeurIPS 2023notableGraphspaper ↗code ↗