mlsanityData to 14 Oct 2026

GeneZip: Region-Aware Compression for Long Context DNA Modeling

arXiv 2602.17739 ↗First posted 19 Feb 2026q-bio.GN cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Long-context DNA models are limited by token-mixing cost and by how compression allocates representational budget across the genome. Existing approaches operate close to base-pair resolution, apply fixed downsampling, or learn content-dependent chunks without an explicit genomic budget, making long-context pretraining expensive and difficult to control. We introduce GeneZip, a region-aware DNA compression framework that combines H-Net-style dynamic routing with a Region-Aware Ratio (RAR) objective and bounded routing. GeneZip uses static gene-structure annotations during compression training to specify region-wise base-pairs-per-token (BPT) targets; at inference time, it compresses raw unseen DNA without annotations. GeneZip provides three main benefits. First, it is effective: GeneZip variants achieve the best validation PPL among encoder-based compressors, with GeneZip-70M operating at 137.6 BPT, and across four reproducible DNALongBench tasks--contact map prediction, eQTL prediction, enhancer-target gene prediction, and transcription-initiation signal prediction--GeneZip obtains the best average rank among compared sequence models. Second, it is redundancy-aware: a post-hoc RepeatMasker/TRF analysis shows that, without repeat supervision, GeneZip assigns higher local BPT to TE-derived interspersed repeats and tandem repeats, two major classes of repetitive DNA sequence redundancy. Third, it is efficient: by reducing the effective token-mixing length, GeneZip enables longer-context and larger-capacity pretraining, including 128K-context and 636M-parameter variants on a single A100 80GB GPU, and fine-tunes the eQTL task 50.4x faster than JanusDNA (50 vs. 2520 minutes). These results establish GeneZip as an effective, redundancy-aware, and efficient compression interface for long-context DNA modeling.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 54 references that are in the map. First posted on arXiv 19 Feb 2026.

Builds on

18 of 54 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
  4. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  5. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  6. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  7. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
  8. 2023MEGABYTE: Predicting Million-byte Sequences with Multiscale Transformerscited by 170
  9. 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 146
  10. 2024Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modelingcited by 113
  11. 2025Dynamic Chunking for End-to-End Hierarchical Sequence Modelingcited by 72
  12. 2024SpaceByte: Towards Deleting Tokenization from Large Language Modelingcited by 34
6 more
  1. 2024MrT5: Dynamic Token Merging for Efficient Byte-level Language Modelscited by 28
  2. 2024VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modelingcited by 15
  3. 2024Model Decides How to Tokenize: Adaptive DNA Sequence Tokenization with MxDNAcited by 12
  4. 2025JanusDNA: A Powerful Bi-directional Hybrid DNA Foundation Modelcited by 5
  5. 2026dnaHNet: A Scalable and Hierarchical Foundation Model for Genomic Sequence Learningcited by 3
  6. 2025MergeDNA: Context-aware Genome Modeling with Dynamic Tokenization through Token Mergingcited by 2

Built on by

Not cited yet.