NeuroAda: Activating Each Neuron's Potential for Parameter-Efficient Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Existing parameter-efficient fine-tuning (PEFT) methods primarily fall into two categories: addition-based and selective in-situ adaptation. The former, such as LoRA, introduce additional modules to adapt the model to downstream tasks, offering strong memory efficiency. However, their representational capacity is often limited, making them less suitable for fine-grained adaptation. In contrast, the latter directly fine-tunes a carefully chosen subset of the original model parameters, allowing for more precise and effective adaptation, but at the cost of significantly increased memory consumption. To reconcile this trade-off, we propose NeuroAda, a novel PEFT method that enables fine-grained model finetuning while maintaining high memory efficiency. Our approach first identifies important parameters (i.e., connections within the network) as in selective adaptation, and then introduces bypass connections for these selected parameters. During finetuning, only the bypass connections are updated, leaving the original model parameters frozen. Empirical results on 23+ tasks spanning both natural language generation and understanding demonstrate that NeuroAda achieves state-of-the-art performance with as little as ≤ 0.02% trainable parameters, while reducing CUDA memory usage by up to 60%. We release our code here: https://github.com/FightingFighting/NeuroAda.git.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 53 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
34 of 53 references.
References · 34
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,302
22 more
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
- 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
- 2021Tip-Adapter: Training-free CLIP-Adapter for Better Vision-Language Modelingcited by 431
- 2016Solving General Arithmetic Word Problemscited by 360
- 2021VL-Adapter: Parameter-Efficient Transfer Learning for Vision-and-Language Taskscited by 320
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
- 2023LEACE: Perfect linear concept erasure in closed formcited by 267
- 2023In-context Vectors: Making In Context Learning More Effective and Controllable Through Latent Space Steeringcited by 245
- 2024ReFT: Representation Finetuning for Language Modelscited by 197
- 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
- 2024CoIR: A Comprehensive Benchmark for Code Information Retrieval Modelscited by 60
- 2023Parameter-Efficient Fine-Tuning without Introducing New Latencycited by 59
- 2025MMDocIR: Benchmarking Multimodal Retrieval for Long Documentscited by 43
- 2024Advancing Parameter Efficiency in Fine-tuning via Representation Editingcited by 37
- 2025Benchmarking Retrieval-Augmented Multimodal Generation for Document Question Answeringcited by 36
- 2024Sparse High Rank Adapterscited by 17
- 2024Proactive Gradient Conflict Mitigation in Multi-Task Learning: A Sparse Training Perspectivecited by 12
- 2024Expanding Sparse Tuning for Low Memory Usagecited by 10
- 2024Sparse Matrix in Large Language Model Fine-tuningcited by 8
Built on by
Not cited yet.