Efficient and Scalable Fine-Tune of Language Models for Genome Understanding
Not on the map. Why?
Abstract (arXiv)
Although DNA foundation models have advanced the understanding of genomes, they still face significant challenges in the limited scale and diversity of genomic data. This limitation starkly contrasts with the success of natural language foundation models, which thrive on substantially larger scales. Furthermore, genome understanding involves numerous downstream genome annotation tasks with inherent data heterogeneity, thereby necessitating more efficient and robust fine-tuning methods tailored for genomics. Here, we present textscLingo: textscLanguage prefix ftextscIne-tuning for textscGentextscOmes. Unlike DNA foundation models, textscLingo strategically leverages natural language foundation models' contextual cues, recalibrating their linguistic knowledge to genomic sequences. textscLingo further accommodates numerous, heterogeneous downstream fine-tune tasks by an adaptive rank sampling method that prunes and stochastically reintroduces pruned singular vectors within small computational budgets. Adaptive rank sampling outperformed existing fine-tuning methods on all benchmarked 14 genome understanding tasks, while requiring fewer than 2% of trainable parameters as genomic-specific adapters. Impressively, applying these adapters on natural language foundation models matched or even exceeded the performance of DNA foundation models. textscLingo presents a new paradigm of efficient and scalable genome understanding via genomic-specific adapters on language models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 37 references that are in the map. First posted on arXiv 12 Feb 2024.
Builds on
17 of 37 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 689
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2022InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutionscited by 482
- 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
- 2023Language Modeling Is Compressioncited by 225
- 2022LIFT: Language-Interfaced Fine-Tuning for Non-Language Machine Learning Taskscited by 148
- 2023DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genomecited by 143
5 more
- 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 141
- 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 141
- 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 133
- 2022State-of-the-art generalisation research in NLP: A taxonomy and reviewcited by 98
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
Built on by
Not cited yet.