mlsanityData to 7 Oct 2026

Investigating Data Pruning for Pretraining Biological Foundation Models at Scale

arXiv 2512.12932 ↗First posted 15 Dec 2025cs.LG cs.AI cs.CEcited by 1

Not on the map. Why?

Abstract (arXiv)

Biological foundation models (BioFMs), pretrained on large-scale biological sequences, have recently shown strong potential in providing meaningful representations for diverse downstream bioinformatics tasks. However, such models often rely on millions to billions of training sequences and billions of parameters, resulting in prohibitive computational costs and significant barriers to reproducibility and accessibility, particularly for academic labs. To address these challenges, we investigate the feasibility of data pruning for BioFM pretraining and propose a post-hoc influence-guided data pruning framework tailored to biological domains. Our approach introduces a subset-based self-influence formulation that enables efficient estimation of sample importance at low computational cost, and builds upon it two simple yet effective selection strategies, namely Top-k Influence (Top I) and Coverage-Centric Influence (CCI). We empirically validate our method on two representative BioFMs, RNA-FM and ESM-C. For RNA, our framework consistently outperforms random selection baselines under an extreme pruning rate of over 99 percent, demonstrating its effectiveness. Furthermore, we show the generalizability of our framework on protein-related tasks using ESM-C. In particular, our coreset even outperforms random subsets that are ten times larger in both RNA and protein settings, revealing substantial redundancy in biological sequence datasets. These findings underscore the potential of influence-guided data pruning to substantially reduce the computational cost of BioFM pretraining, paving the way for more efficient, accessible, and sustainable biological AI research.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 48 references that are in the map. First posted on arXiv 15 Dec 2025.

Builds on

17 of 48 references.

References · 17

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  4. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  5. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  6. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
  7. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
  8. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 259
  9. 2013Revisiting Natural Gradient for Deep Networkscited by 157
  10. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 115
  11. 2022PEER: A Comprehensive and Multi-Task Benchmark for Protein Sequence Understandingcited by 77
  12. 2016Coresets and Sketchescited by 63
5 more
  1. 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
  2. 2024SmallToLarge (S2L): Scalable Data Selection for Fine-tuning Large Language Models by Summarizing Training Trajectories of Small Modelscited by 43
  3. 2019ProteinNet: a standardized data set for machine learning of protein structurecited by 39
  4. 2024TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Datacited by 28
  5. 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.