Search arXiv⌕ Search

arXiv · 2611.00716

Uncertainty Aware Quality-Diversity Optimization For Offline Biological Sequence Design

Abstract

Designing sequences such as nucleic acids and proteins with desired properties is a fundamental challenge in biology. Due to the vast, discrete nature of sequence spaces and the high cost of experimental evaluation, offline computational sequence design plays a crucial role in proposing novel sequences before costly wet-lab validation. In practice, it is also essential that proposed designs are diverse to increase the likelihood of downstream experimental success. This motivates methods that balance performance, novelty, and diversity, whilst mitigating against uncertainty inherent to offline optimization. Quality-Diversity optimization (QD) can discover diverse, high-performing solutions, making it well suited to this problem, but its elitist nature makes reliable exploration under uncertainty challenging. To address this, we introduce Prior-guided Offline MAP-Elites (POME), an uncertainty-aware QD framework explicitly adapted to the offline regime. Our method leverages foundation models as priors to guide search toward biologically plausible regions and enable robust exploration under uncertainty. Across three sequence design tasks, POME consistently improves both performance and diversity over prior offline QD methods, and achieves the most reliable balance compared to offline MBO baselines, obtaining the best performance on two tasks and the second-best on the third, while maintaining high diversity and novelty.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alona Rimon, Hannah Janmohamed, Maxime Allard, Antoine Cully. 2026-10-31. Uncertainty Aware Quality-Diversity Optimization For Offline Biological Sequence Design. https://arxiv.org/abs/2611.00716

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Subspace Node Pruning

Node pruning is the art of removing computational units such as neurons, filters, attention heads, or even entire layers to significantly reduce inference time while retaining network performance. In this work, we show that a broad family of importance measures, from activation-based to Fisher-based, share a common quadratic form. Through a lower-triangular change of basis, this form yields a pruning subspace in which entire nodes can be removed while the impact of the lost units is simultaneously recovered via linear least squares. Furthermore, the importance measures within our subspace are decoupled and additive through an orthogonalization of the layer activations, allowing multi-node pruning within layers without interference between importance scores. Our method, Subspace Node Pruning (SNP), outperforms the compared baselines on VGG-16 and ResNet-50 on ImageNet. On OPT-125M and LLaMA-2 7B, SNP matches the state-of-the-art LLM Surgeon at a 40-shot schedule and outperforms it whenever fewer shots are used, all without any retraining after pruning.

cs.LG↗

On the growth of the parameters of approximating ReLU neural networks

This work focuses on the analysis of fully connected feed forward ReLU neural networks as they approximate a given, smooth function. In contrast to conventionally studied universal approximation properties under increasing architectures, e.g., in terms of width or depth of the networks, we are concerned with the asymptotic growth of the parameters of approximating networks. Such results are of interest, e.g., for error analysis or consistency results for neural network training. The main result of our work is that, for a ReLU architecture with state of the art approximation error, the realizing parameters grow at most polynomially. The obtained rate with respect to a normalized network size is compared to existing results and is shown to be superior in most cases, in particular for high dimensional input.

cs.LG↗

Correlations Are Ruining Your Gradient Descent

Natural gradient descent, and the preconditioned optimizers which have followed from it, correct gradient descent by estimating curvature and applying its inverse to the gradient. For any single layer of a deep neural network, this correction can be shown to approximately separate into two factors: one which accounts for correlations in the gradient signal, and one which accounts for correlations in the data arriving at that layer. Herein we show that this second factor can be expressed as a change of basis rather than of curvature and, considered thus, it can be removed from the optimizer entirely and placed within the network itself. Specifically, we show that, once forward weights are corrected, right-sided natural gradient descent can be implemented in a form which has three exactly equivalent forms: a gradient preconditioner, a decorrelating linear transform in the forward pass, or a set of recurrent dynamics in which all updates are Hebbian and rely only upon locally available signals. The (recurrent) decorrelation method we discover aligns closely with proposed methods for inhibitory learning and homeostatic plasticity in the brain. Notably, our transform requires no matrix inverse, no matrix decomposition, and no information beyond that which is available at an individual synapse. It can therefore be applied in distributed and physically constrained systems, including neuromorphic hardware and nervous systems, where existing preconditioners cannot. We demonstrate its effectiveness empirically in convolutional and residual network models while significantly improving a range of approximate biologically plausible methods for credit assignment.

cs.LG↗