Variational Search Distributions

Daniel M. Steinberg, Rafael Oliveira, Cheng Soon Ong, Edwin V. Bonilla
2/12/2026

No official code found. Best implementation: csiro-funml/variationalsearch (9 stars, last commit 2026-04-16).

Abstract

We develop VSD, a method for conditioning a generative model of discrete, combinatorial designs on a rare desired class by efficiently evaluating a black-box (e.g. experiment, simulation) in a batch sequential manner. We call this task active generation; we formalize active generation's requirements and desiderata, and formulate a solution via variational inference. VSD uses off-the-shelf gradient based optimization routines, can learn powerful generative models for desirable designs, and can take advantage of scalable predictive models. We derive asymptotic convergence rates for learning the true conditional generative distribution of designs with certain configurations of our method. After illustrating the generative model on images, we empirically demonstrate that VSD can outperform existing baseline methods on a set of real sequence-design problems in various protein and DNA/RNA engineering tasks.

View on arXivView PDF

Code Implementations(1)

Variational search distributions

92Shell, PythonApr 18, 20246 months agoNOASSERTION

Similar Papers

Cite this paper

@article{steinberg2026variational,
  title  = {Variational Search Distributions},
  author = {Daniel M. Steinberg and Rafael Oliveira and Cheng Soon Ong and Edwin V. Bonilla},
  year   = {2026},
  eprint = {2409.06142},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2409.06142},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.06142.svg)](https://codeofpaper.com/paper/2409.06142)

Discussion