Summary
The paper proposes AdaLink, an parameter efficient adaptation module for large multi-modal foundation models. AdaLinks comprise of down- and up- projections and identity connections, forming a bottleneck-shaped residual architecture. AdaLinks are inserted exclusively to the middle between token embeddings and the transformer, and are modal-aware, i.e., a separate set of weights is used for each supported input modality. The claimed advantages of such non-intrusive adapters include low computational costs, minimal interference between tasks, and less engineering efforts to serve the model. The adapted models are evaluated on various tasks, including captioning and VQA for multi-modal understanding, and NLU tasks from GLUE for natural language understanding, and obtained results comparable to full-finetuning and other parameter-efficient fine-tuning baselines.
Strengths
* The writings and illustrations are clear and easy to follow. The experiments cover a wide range of tasks.
* Among non-intrusive adaptation methods, the proposed method can outperform the baseline prompt tuning.
Weaknesses
* **The advantages of being non-intrusive is not persuasive.** This is by far the most concerning point of mine. Since the performance of AdaLinks still fall behind intrusive methods (e.g., LoRA) in many experiments, it is very important that AdaLinks clearly excel in some other aspects. I list my questions for each of the point 1 and 3 mentioned in section 3.3 as follows:
* *Scalable computational cost.* (1) The statement *prompt tuning ... increasing the sequence length, which leads to a quadratic increase in computational complexity* is misleading. The *added complexity* of prompt tuning is actually $O(Ld_{emb}^2r + LNd_{emb}r)$, with the $r$ being number of prompts, $L$ being transformer depth, first item being *added complexity* in linear layers and the second term being *added complexity* in attention layers, from which we can see that the *added complexity* is in fact *linear* to the sequence length if measured by the same standard (i.e., by consider only the additional computation on top of the backbone computation) as used in the previous statement about the paper's own method. (2) Nevertheless, the total cost of the adapted network will be dominated by the backbone cost for most (if not all) known adaptation methods, in which case further optimizing the additional cost of adaptation will bring very limited advantages according to Amdahl's law. (3) It is indeed possible that for some methods, the theoretical additional cost is small but the actual additional cost on hardware is large, in which case the paper needs to give some fundamental reasons why this is difficult to resolve (e.g., due to hardware limitations), ideally with measured performance numbers (e.g., throughput or latency on actual hardware).
* *Configurable Serving.* The ease of deployment need to be compared to the other well-known adaptation methods in more details. For example: (1) LoRA weights can be merged into the backbone weights as $W_{adapt} = W_{backbone} + W_{up} W_{down}$ without any architectural change. On what specific infrastructure will AdaLink be easier to deploy than merged LoRA with exactly the same architecture before and after PEFT? (2) Adapters [1] are usually inserted before / after / parallel to a whole transformer block. What are the specific reasons making them much harder to deploy than AdaLinks [e.g., What are the specific cases in which *adaptation weights (are difficult) to be transferred to the internal architecture* (quoted from section 5.2)? Or why a fused operator needs to cross the block boundary to make intrusive adapters difficult to insert?]
* **Limited novelty.** Other than introducing the modal-specific adaptation for different tokens, the concept and architecture are very similar to the original adapters [1]. Applying modal-specific projections is also among the first attempts of adapting language models to multiple modalities (e.g., [2, 3] but far from being complete).
* **Community accessibility.** Most results in the paper reported using PaLI-X, which I believe is still not open-sourced at the time of this review. Thus, the community may face difficulties reproducing the results or further developing the method. It would be helpful if the paper could also include some open-source model results for future reference.
[1] Houlsby, Neil, et al., Parameter-efficient transfer learning for NLP., ICML 2019.
[2] Eichenberg, Constantin, et al., MAGMA - Multimodal Augmentation of Generative Models through Adapter-based Finetuning, EMNLP 2022.
[3] Yang, Antoine, et al., Zero-shot video question answering via frozen bidirectional language models, NeurIPS 2022.
Questions
My questions currently focus on section 3.3 or weakness 1. To summarize, I'm most interested in the details about a specific and broadly applicable case (hardware or infrastructure architecture) where AdaLinks are the only favorable / feasible way of adaptation compared to other methods. I would raise my rating once the explanation about this is clearer.
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.