mlsanityData to 14 Oct 2026

Same model, better performance: the impact of shuffling on DNA Language Models benchmarking

arXiv 2510.12617 ↗First posted 14 Oct 2025q-bio.GN cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Large Language Models are increasingly popular in genomics due to their potential to decode complex biological sequences. Hence, researchers require a standardized benchmark to evaluate DNA Language Models (DNA LMs) capabilities. However, evaluating DNA LMs is a complex task that intersects genomic's domain-specific challenges and machine learning methodologies, where seemingly minor implementation details can significantly compromise benchmark validity. We demonstrate this through BEND (Benchmarking DNA Language Models), where hardware-dependent hyperparameters -- number of data loading workers and buffer sizes -- create spurious performance variations of up to 4% for identical models. The problem stems from inadequate data shuffling interacting with domain specific data characteristics. Experiments with three DNA language models (HyenaDNA, DNABERT-2, ResNet-LM) show these artifacts affect both absolute performance and relative model rankings. We propose a simple solution: pre-shuffling data before storage eliminates hardware dependencies while maintaining efficiency. This work highlights how standard ML practices can interact unexpectedly with domain-specific data characteristics, with broader implications for benchmark design in specialized domains.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 3 references that are in the map. First posted on arXiv 14 Oct 2025.

Builds on

3 of 3 references.

References · 3

  1. 2023HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide Resolutioncited by 194
  2. 2023BEND: Benchmarking DNA Language Models on biologically meaningful taskscited by 29
  3. 2020High Performance I/O For Large Scale Deep Learningcited by 26

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.