### Potential limitations of model soup
1. Currently, we have observed that although there are significant gains in the early stages, it becomes increasingly difficult to improve the model's performance as the process continues. This phenomenon has also been noted in a recent study[1]. The main reason is that as model soup progresses, the similarity between models increases, making it challenging for the model to break through the original local optimum to reach a better local optimum.
2. We believe that the distribution differences in the dataset do not have a significant negative impact on model soup; instead, they may actually provide benefits. For example, as shown in Figure 3 of the original paper, performing model soup with a model trained on the Base Set + MathV360K and a model trained on the Base Set + ScreenQA can significantly improve the model's performance. MathV360K is a dataset related to mathematics, while ScreenQA is a dataset related to screen-based question answering. There are significant differences between the two datasets in terms of both images and questions.
3. Model soup do not show overfit to a specific benchmark. We conducted model soup primarily based on the Overall Score metric in Table 1. However, in the final presentation of results, we also provided metrics for MME, RealWorldQA, and LLaVA-Wild, where we achieved good performance as well. Additionally, we further tested on the recently released MEGABench and obtained impressive results. The specific results are shown below.
### Risks of reduced generalization ability due to a smaller pre-training dataset size
1. When selecting model data, we primarily referred to the Overall Score metric in Table 1. However, in the final presentation of results, we also provided metrics for MME, RealWorldQA, and LLaVA-Wild, on which we achieved good performance as well.
2. Additionally, we further tested on the recently released MEGABench[2], which covers over 500 real-world tasks. The specific results are as follows:
| Method | Overall SI |
| --- | --- |
| InternVL2-8B | 29.21 |
| POINTS-Qwen2-7B | 26.10 |
| MiniCPM-V2.6-8B | 25.95 |
| LLava-OneVision-7B | 25.69 |
| Idefics3-8B-LLaMA3 | 12.06 |
To maintain consistency with previous works, such as LLaVA-OneVision, we have newly added the POINTS-Qwen2-7B model, which uses Qwen2-7B as the LLM.
3. The current pre-training of MLLMs is essentially a process of aligning language and image signals. The learning of knowledge has already been accomplished separately during the training of the Vision Encoder and the LLM. Therefore, using less data during the alignment phase does not significantly impact the model's ability to acquire knowledge.
In summary, the reduction in pre-training data has not weakened the generalization capability of POINTS.
### Have any areas been observed where CATTY is not as good as DHR?
1. In our response to the Reviewer eeM9, we mentioned that CATTY introduces additional computational overhead compared to DHR, but this overhead is negligible relative to the total computational cost.
2. As shown in Table 1, the main advantage of CATTY over DHR is its improved performance on OCR-related tasks, such as OCRBench. This is because OCR tasks are more sensitive to image pixels, a point that has been noted in previous work[3]. However, for some other tasks, the performance of CATTY is comparable to, or even slightly lower than, that of DHR, such as in MMVet. But compared to DHR, CATTY will bring overall improvement to the model.
[1] Exploring Model Kinship for Merging Large Language Models
[2] MEGA-Bench: Scaling Multimodal Evaluation to over 500 Real-World Tasks
[3] Improved Baselines with Visual Instruction Tuning