Adapting models pre-trained on large-scale datasets is a proven way to reach strong performance quickly for down-stream tasks. However, the growth of state-of-the-art mod-els makes traditional full fine-tuning unsuitable and difficult, especially for multi-task learning (MTL) where cost scales with the number of tasks. As a result, recent studies investigate parameter-efficient fine-tuning (PEFT) using low-rank adaptation to significantly reduce the number of trainable parameters. However, these existing methods use a single, fixed rank, which may not be optimal for differ-ent tasks or positions in the MTL architecture. Moreover, these methods fail to learn spatial information that cap-tures inter-task relationships and helps to improve diverse task predictions. This paper introduces Frequency-Aware and Automatic Rank (FAAR) for efficient MTL fine-tuning. Our method introduces Performance-Driven Rank Shrink-ing (PDRS) to allocate the optimal rank per adapter location and per task. Moreover, by analyzing the image frequency spectrum, FAAR proposes a Task-Spectral Pyramidal Decoder (TS-PD) that injects input-specific context into spatial bias learning to better reflect cross-task relationships. Experiments performed on dense visual task benchmarks show the superiority of our method in terms of both accuracy and efficiency compared to other PEFT methods in MTL. FAAR reduces the number of parameters by up to 9 times compared to traditional MTL fine-tuning whilst improving overall performance. Our code is available.
Figures & tables
Figure 1: Accuracy/Efficiency trade-off comparison of FAAR with other PEFT MTL methods on PASCAL. FAAR achieves better overall performance thank traditional fine-tuning methods or MTL low-rank PEFT methods, while using fewer parameters.
Figure 2: (a) Overview of our FAAR method. An input image embedding is given to a pre-trained backbone, in our case, a Swin Transformer [ 30 ] . At each stage of that backbone, representing a different resolution, DoRA [ 28 ] adapters are placed at attention and MLP layers (illustrated in Fig. 2(b) ). Up until the last block, shared feature adaptation takes place. The last block is kept for task-specific updates. Each shared and task-specific stage-wise representation are retained for our Task-Spectral Pyramidal Decoders (TS-PD). (b) Illustration of the DoRA adapters. For simplicity, only the multi-task version is shown. Shared adapters consist only of the green path.
Figure 3: Our Task-Spectral Pyramidal Decoder (TS-PD) consists of a Channel-Wise task-specific Spectral Filter (CW-SP) and a Cross-Task Consensus Alignment (XT-Cons) module to maintain geometric consistency.
Method
SemSeg (mIoU ↑ )
HumanParts (mIoU ↑ )
Saliency (mIoU ↑ )
Normals (rmse ↓ )
Δm (%)
Trainable Parameters (M)
Single inf. (all tasks)
Single Task
67.21
61.93
62.35
17.97
0
112.62
✕
MTL - Tuning Decoders Only
65.09
53.48
57.46
20.69
-9.95
1.94
✓
MTL - Full Fine Tuning
67.56
60.24
65.21
16.64
+2.23
30.06
✓
Adapter [ 18 ]
69.21
57.38
61.28
18.83
-2.71
11.24
✕
Bitfit [ 56 ]
68.57
55.99
60.64
19.42
-4.60
2.85
✕
VPT-shallow [ 21 ]
62.96
52.27
58.31
20.90
-11.18
2.57
✕
Table 1: Performance comparison on PASCAL-Context [ 34 ] using Swin-Tiny pretrained on ImageNet-1k as the backbone. We compare all methods with respect to Δm , the relative improvement vs. single-task full fine-tuning. FAAR improves all tasks with fewer parameters.
Method
SemSeg (mIoU ↑ )
Depth (rmse ↓ )
Normals (rmse ↓ )
Δm (%)
Trainable Parameters (M)
Single Task
42.65
0.60
22.83
0
84.00
MTL - Full Fine Tuning
38.85
0.66
24.33
-8.49
28.10
MTLoRA [ 2 ] ( r=64 )
39.85
0.66
29.53
-15.30
9.70
TADFormer [ 4 ] ( r=64 )
40.85
0.64
27.48
-10.42
8.90
DiTASK [ 33 ]
41.13
0.65
27.25
-10.45
3.06
FAAR ( rinit=64 )
41.27
0.63
26.35
-7.88
2.85
Table 2: Performance comparison on NYUD-v2 [ 35 ] of LoRA-based MTL methods using Swin-Tiny pretrained on ImageNet-1k as the backbone. We report Δm as the relative improvement vs. single-task full fine-tuning.
Figure 4: Rank distribution across task-specific and shared layers for each transformer stage during early training.
Multi-task learning (MTL) aims to enable a single model to solve multiple tasks efficiently; however, current parameter-efficient fine-tuning (PEFT) methods remain largely limited to single-task adaptation. We introduce Free Sinewich, a parameter-efficient multi-task learning framework that enables near-zero-cost weight modulation via frequency switching (Free). Specifically, a Sine-AWB (Sinewich) layer combines low-rank factors and convolutional priors into a single kernel, which is then modulated elementwise by a sinusoidal transformation to produce task-specialized weights. A lightweight Clock Net is introduced to produce bounded frequencies that stabilize this modulation during training. Theoretically, sine modulation enhances the rank of low-rank adapters, while frequency separation decorrelates the weights of different tasks. On dense prediction benchmarks, Free Sinewich achieves state-of-the-art performance-efficiency trade-offs (e.g., up to +5.39% improvement over single-task fine-tuning with only 6.53M trainable parameters), offering a compact and scalable paradigm based on frequency-based parameter sharing. Project page: https://casperliuliuliu.github.io/projects/Free-Sinewich.
Shih-Wen Liu, Yen-Chang Chen, Wei-Ta Chu +2
National Cheng Kung University, Tainan, Taiwan · NVIDIA Research, Taiwan
Multi-task supervised fine-tuning (SFT) often casts a heterogeneous data mixture as a single optimization problem, even though different tasks may reach their best generalization at different times. msft exposes this mismatch through task-wise roll-out, exclusion, and rollback, but its original formulation materializes the scheduler state as full-model checkpoints, making stage transitions costly to store, restore, and deploy. This paper introduces AuroSFT, a parameter-efficient framework that recasts the carried state of overfitting-aware multi-task SFT as a compact, mergeable adapter state. AuroSFT freezes the pretrained backbone, trains only injected adapters, rolls back adapter checkpoints at task-wise peaks, and continues on the remaining active mixture. At the layer level, each adapter applies an AuroRA-inspired adaptive nonlinear layer to a low-rank weight factor rather than to the sample representation. The resulting update remains linear in the input, rank-bounded, and exactly mergeable into the frozen projection. Under the retained-backbone comparison protocol, AuroSFT achieves 61.36% average accuracy, compared with 59.85% for the corresponding msft reference row, and obtains higher accuracy on all five backbones. Our code is available at the anonymous repository: https://anonymous.4open.science/r/AuroSFT-80D1.
Yue Han, Ziniu Liu
College of Systems Engineering, National University of Defense Technology · College of Computer Science and Technology, National University of Defense Technology
Parameter-efficient fine-tuning (PEFT) has emerged as a crucial paradigm for adapting large language models (LLMs) under constrained computational budgets. However, standard PEFT methods often struggle in multi-task fine-tuning settings, where diverse optimization objectives induce task interference and limited parameter budgets lead to representational deficiency. While recent approaches incorporate mixture-of-experts (MoE) to alleviate these issues, they predominantly operate in the spatial domain, which may introduce structural redundancy and parameter overhead. To overcome these limitations, we reformulate adaptation in the spectral domain. Our spectral analysis reveals that different tasks exhibit distinct frequency energy distributions, and that LLM layers display heterogeneous frequency sensitivities. Motivated by these insights, we propose FourierMoE, which integrates the MoE architecture with the inverse discrete Fourier transform (IDFT) for frequency-aware adaptation. Specifically, FourierMoE employs a frequency-adaptive router to dispatch tokens to experts specialized in distinct frequency bands. Each expert learns a set of conjugate-symmetric complex coefficients, preserving complete phase and amplitude information while theoretically guaranteeing lossless IDFT reconstruction into real-valued spatial weights. Extensive evaluations across 28 benchmarks, multiple model architectures, and scales demonstrate that FourierMoE consistently outperforms competitive baselines in both single-task and multi-task settings while using significantly fewer trainable parameters. These results highlight the promise of spectral-domain expert adaptation as an effective and parameter-efficient paradigm for LLM fine-tuning.
Juyong Jiang, Fan Wang, Hong Qi +2
The Hong Kong University of Science and Technology (Guangzhou) · The Hong Kong University of Science and Technology