mlsanityData to 14 Oct 2026

SALT: Parameter-Efficient Fine-Tuning via Singular Value Adaptation with Low-Rank Transformation

arXiv 2503.16055 ↗First posted 20 Mar 2025eess.IV cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

The complex nature of medical image segmentation calls for models that are specifically designed to capture detailed, domain-specific features. Large foundation models offer considerable flexibility, yet the cost of fine-tuning these models remains a significant barrier. Parameter-Efficient Fine-Tuning (PEFT) methods, such as Low-Rank Adaptation (LoRA), efficiently update model weights with low-rank matrices but may suffer from underfitting when the chosen rank is insufficient to capture domain-specific nuances. Conversely, full-rank Singular Value Decomposition (SVD) based methods provide comprehensive updates by modifying all singular values, yet they often lack flexibility and exhibit variable performance across datasets. We propose SALT (Singular Value Adaptation with Low-Rank Transformation), a method that selectively adapts the most influential singular values using trainable scale and shift parameters while complementing this with a low-rank update for the remaining subspace. This hybrid approach harnesses the advantages of both LoRA and SVD, enabling effective adaptation without relying on increasing model size or depth. Evaluated on 5 challenging medical datasets, ranging from as few as 20 samples to 1000, SALT outperforms state-of-the-art PEFT (LoRA and SVD) by 2% to 5% in Dice with only 3.9% trainable parameters, demonstrating robust adaptation even in low-resource settings. The code for SALT is available at: https://github.com/BioMedIA-MBZUAI/SALT

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 20 Mar 2025.

Builds on

22 of 33 references.

References · 22

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
  3. 2023Segment Anythingcited by 8,234
  4. 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,864
  5. 2018Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentationcited by 3,223
  6. 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,940
  7. 2024SAM 2: Segment Anything in Images and Videoscited by 2,863
  8. 2018UNet++: A Nested U-Net Architecture for Medical Image Segmentationcited by 1,525
  9. 2015SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentationcited by 1,487
  10. 2017A Survey on Deep Learning in Medical Image Analysiscited by 1,186
  11. 2021UNETR: Transformers for 3D Medical Image Segmentationcited by 959
  12. 2023Medical SAM Adapter: Adapting Segment Anything Model for Medical Image Segmentationcited by 490
10 more
  1. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  2. 2018nnU-Net: Self-adapting Framework for U-Net-Based Medical Image Segmentationcited by 291
  3. 2023Hiera: A Hierarchical Vision Transformer without the Bells-and-Whistlescited by 290
  4. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  5. 2024Segment Anything Model for Medical Image Segmentation: Current Applications and Future Directionscited by 97
  6. 2023SAM on Medical Images: A Comprehensive Study on Three Prompt Modescited by 82
  7. 2020ROSE: A Retinal OCT-Angiography Vessel Segmentation Dataset and New Modelcited by 78
  8. 2023Computer-Vision Benchmark Segment-Anything Model (SAM) in Medical Images: Accuracy in 12 Datasetscited by 45
  9. 2024S-SAM: SVD-based Fine-Tuning of Segment Anything Model for Medical Image Segmentationcited by 11
  10. 2023DIAS: A Dataset and Benchmark for Intracranial Artery Segmentation in DSA sequencescited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.