Summary
>**Rebuttal:** The provided details satisfy my concerns. I think this paper should be accepted after applying the agreed changes.
>**TL;DR:** The proposed MEFT reduces training activation memory, which is an important topic for the ML community. MEFT outperforms existing PEFT techniques while consuming up to 84% less memory compared to full fine-tuning. However, MEFT comes with significant computation overhead, which is not explored. Furthermore, some key comparisons, such as gradient checkpointing, are missing. Addressing my concerns and questions would improve my score.
This paper proposes the Memory Efficient Fine-Tuning (MEFT) technique that achieves similar accuracy to that of traditional PEFT techniques while consuming up to 84% less memory compared to full fine-tuning. The paper discusses previous PEFT techniques and provides insights on key attributes for them to work. These insights include empirical results and detailed explanations. One of these key insights is the weights initialization. The paper shows the importance of initializing the PEFT weights such that they do not have any effect on the underlying LLM before starting the training process.
The paper proposes to combine reversible models with PEFT existing techniques to create MEFT algorithms that gain from both worlds. The paper provides three different variants of MEFT, which are explained as well as illustrated. The three variants of MEFT are empirically validated on four different architecture backbones BERT, RoBERTa, BART and OPT. The MEFT variants are compared to several popular PEFT techniques as well as some memory efficient techniques. These comparison are conducted on the GLUE dataset.
Strengths
* **S.1.** The proposed MEFT algorithm tackles an important problem in existing PEFT techniques, which makes LLM PEFT training more accessible to researchers with low resources by reducing the activation memory up to 84% of full fine-tuning.
* **S.2.** The paper provides interesting insights that are explained and backed by results and detailed illustrations.
* **S.3.** The proposed MEFT variants outperform existing PEFT techniques on GLUE dataset with several architecture backbones.
* **S.4.** Reproduction code is provided as part of the submission.
Weaknesses
* **W.1.** The training time of MEFT is not well explored and is only noted as "double the training time". Hence, the tradeoff between memory and computation efficiency is not well understood.
* **W.2.** Popular existing memory efficient training techniques such as tensor rematerialization (gradient checkpointing) [2][3] and ZeRO [1] are not compared to. These techniques sacrifice training speed for reduction in memory consumption, similar to the goal of MEFT. Furthermore, these techniques are compatible with existing PEFT approaches. Finally, these techniques are widely available in deep learning frameworks such as PyTorch, DeepSpeed, and Hugging Face Accelerate which makes comparison relatively simple.
* **W.3.** The font sizes in Figures 1,2,3,5, and 6 are too small which makes it very difficult to read. Furthermore, some figures are not self explanatory, such as Figure 5 which does not provide any explanation for the difference between the solid and dotted lines. These problems burden the reading flow of the paper.
**Typos.**
* Line #86: "for obtaining" → "to obtain"
* Line #86: "though we" → "even though we"
* Line #95: "in Figure 2a" → "in Figure 2a,"
* Line #97: "though with" → "even with"
* Line #106: "from an modified" → "from a modified"
* Line #114: "the added and" → "the added"
[1] Ren, J., Rajbhandari, S., Aminabadi, R.Y., Ruwase, O., Yang, S., Zhang, M., Li, D. and He, Y., 2021, July. ZeRO-Offload: Democratizing Billion-Scale Model Training. In USENIX Annual Technical Conference (pp. 551-564).
[2] Jain, P., Jain, A., Nrusimha, A., Gholami, A., Abbeel, P., Gonzalez, J., Keutzer, K. and Stoica, I., 2020. Checkmate: Breaking the memory wall with optimal tensor rematerialization. Proceedings of Machine Learning and Systems, 2, pp.497-511.
[3] Beaumont, O., Eyraud-Dubois, L. and Shilova, A., 2021. Efficient combination of rematerialization and offloading for training dnns. Advances in Neural Information Processing Systems, 34, pp.23844-23857.
Questions
* **Q.1.** The paper proposes MEFT which sacrifices computation speed at the cost of lower peak memory. There are several existing common approaches (such as gradient checkpointing and DeepSpeed) for general memory efficient training which are compatible with PEFT techniques. Why are these comparisons not explored or detailed?
* **Q.2.** In the LoRA modified initialization method, both $W_{up}$ and $W_{down}$ are initialized with a single constant. This causes unwanted symmetries, which makes it more difficult to learn. An alternative approach would be to initialize $W_{down}=1$ (as tested in this paper, but instead of initializing $W_{up}$ to a constant, initialize it with a random gaussian distribution where $c$ can act as the distribution mean. Does this make sense?
* **Q.3.** In Line #175 it is noted that the adapter weights' $W_{down}$ and $W_{up}$ are initialized from a random gaussian distribution with zero mean. It is further noted, that the outputs of the adapter would be close to zero. However, in practice this does not hold true, and the actual outputs can significantly deviate from the desired zero output. What am I missing here?
* **Q.4.** In Figure 6 it seems that LoRA only reduces slightly the peak memory in comparison to the full fine-tuning. However, the optimizer states, which are generally 3 times the size of the model, are significantly smaller in LoRA. Does this result hold for other LLMs and how does the batch size affect it as well?
* **Q.5.** The MEFT technique does not seem to be only compatible with LLMs and can be compatible with other domains, as sted in the conclusion section. However, the experimental results are solely on LLMs. What is the reason for that?
* **Q.6.** In Table 2 the memory usage of Y-Tuning is missing, why is that?
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
The limitations are discussed in paragraph line #315. These limitations include limited compatibility with quantization techniques due to training instabilities and significantly longer training time due to activation re-computation.