Closed-Form Test Functions for Biophysical Sequence Optimization Algorithms
Not on the map. Why?
Abstract (arXiv)
There is a growing body of work seeking to replicate the success of machine learning (ML) on domains like computer vision (CV) and natural language processing (NLP) to applications involving biophysical data. One of the key ingredients of prior successes in CV and NLP was the broad acceptance of difficult benchmarks that distilled key subproblems into approachable tasks that any junior researcher could investigate, but good benchmarks for biophysical domains are rare. This scarcity is partially due to a narrow focus on benchmarks which simulate biophysical data; we propose instead to carefully abstract biophysical problems into simpler ones with key geometric similarities. In particular we propose a new class of closed-form test functions for biophysical sequence optimization, which we call Ehrlich functions. We provide empirical results demonstrating these functions are interesting objects of study and can be non-trivial to solve with a standard genetic optimization baseline.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 13 of its 40 references that are in the map. First posted on arXiv 28 Jun 2024.
Builds on
13 of 40 references.
References · 13
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018GuacaMol: Benchmarking Models for De Novo Molecular Designcited by 294
- 2021Therapeutics Data Commons: Machine Learning Datasets and Tasks for Drug Discovery and Developmentcited by 258
- 2019Evaluating Protein Transfer Learning with TAPEcited by 229
- 2023Protein Design with Guided Discrete Diffusioncited by 154
- 2022Accelerating Bayesian Optimization for Biological Sequence Design with Denoising Autoencoderscited by 99
- 2022PEER: A Comprehensive and Multi-Task Benchmark for Protein Sequence Understandingcited by 77
- 2020AdaLead: A simple and robust adaptive greedy search algorithm for sequence designcited by 63
- 2020Accelerating high-throughput virtual screening through molecular pool-based active learningcited by 59
- 2020Population-Based Black-Box Optimization for Biological Sequence Designcited by 29
1 more
Built on by
Citing papers per year: 2024: 1; 2025: 5; 2026: 1.
7 papers.
- 2025Offline Model-Based Optimization: Comprehensive Reviewcited by 14
- 2024Variational Search Distributionscited by 6
- 2025A Variational Perspective on Generative Protein Fitness Optimizationcited by 4
- 2025Generative Bayesian Optimization: Generative Models as Acquisition Functionscited by 2
- 2025Amortized Active Generation of Pareto Setscited by 1
- 2025Why risk matters for protein binder designcited by 0
- 2026Active Flow Matchingcited by 0
- 2026Active Flow Matching1 Mar 2026
- 2025Generative Bayesian Optimization: Generative Models as Acquisition Functions29 Oct 2025
- 2025Amortized Active Generation of Pareto Sets23 Oct 2025
- 2025Why risk matters for protein binder design31 Mar 2025
- 2025Offline Model-Based Optimization: Comprehensive Review21 Mar 2025
- 2025A Variational Perspective on Generative Protein Fitness Optimization31 Jan 2025
- 2024Variational Search Distributions10 Sep 2024