mlsanityData to 7 Oct 2026

NOBLE: Accelerating Transformers with Nonlinear Low-Rank Branches

arXiv 2603.06492 ↗First posted 6 Mar 2026cs.LG cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce NOBLE (Nonlinear lOw-rank Branch for Linear Enhancement), an architectural augmentation that adds nonlinear low-rank branches to transformer linear layers. Unlike LoRA and other parameter-efficient fine-tuning (PEFT) methods, NOBLE is designed for pretraining from scratch. The branch is a permanent part of the architecture as opposed to an adapter for finetuning on top of frozen weights. The branch computes σ(xWdown)Wup where σ is a learnable nonlinearity. We evaluate several activation functions and find that CosNet, a two-layer cosine nonlinearity with learnable frequency and phase with a linear projection in between them in the bottleneck space, performs best. NOBLE achieves substantial improvements with minimal overhead: up to 1.47x step speedup to reach baseline eval loss (up to 32% fewer training steps), with as low as 4% additional parameters and 7% step time overhead, resulting in up to 1.22x net wallclock speedup. Experiments on LLMs (250M and 1.5B parameters), BERT, VQGAN, and ViT consistently show improved training efficiency. We identify one caveat: Mixup/CutMix augmentation interferes with NOBLE's benefits in Imagenet classification along with other stochastic augmentations, but when disabled, ViT also improves. This discrepancy is possibly explained by regularization techniques that encourage smoother fits to the target function while NOBLE may specialize more in sharper aspects of the target function.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 34 references that are in the map. First posted on arXiv 6 Mar 2026.

Builds on

27 of 34 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  5. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  7. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  8. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  9. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  10. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  11. 2020Taming Transformers for High-Resolution Image Synthesiscited by 3,229
  12. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
15 more
  1. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  2. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
  3. 2020GLU Variants Improve Transformercited by 1,724
  4. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  5. 2020Rethinking Attention with Performerscited by 1,584
  6. 2019Root Mean Square Layer Normalizationcited by 1,425
  7. 2018On the Spectral Bias of Neural Networkscited by 1,321
  8. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  9. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
  10. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
  11. 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 272
  12. 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 162
  13. 2024Mixture-of-Subspaces in Low-Rank Adaptationcited by 47
  14. 2020Explicit Regularisation in Gaussian Noise Injectionscited by 37
  15. 2025AuroRA: Breaking Low-Rank Bottleneck of LoRA with Nonlinear Mappingcited by 22

Built on by

Not cited yet.