A Kernel Perspective on Training-Free Few-Shot Adaptation of Large Vision-Language Models
Few-shot Learning;Vision-Language;CLIP;Efficient adaptation
Yes
No ethics review needed.
- Additional comparisons with more recent few-shot adaptation methods, e.g. DMN, is necessary.

- Discussion and/or experiments on zero-shot adaptation is important to fully explore the boundary of the proposed method.
- ProKeR’s kernel-based approach is theoretically grounded and provides a fresh perspective for improving Tip-Adapter’s framework.

- ProKeR effectively enhances local adapters with global information, striking a balance between local adaptability and global regularization to prevent overfitting.

-  The method is both memory- and computation-efficient, leveraging Random Fourier Features and a closed-form solution in kernel ridge regression to reduce resource demands.
The authors propose ProKeR, a training-free few-shot adaptation method for vision-language models like CLIP that leverages a kernel perspective. Building on Tip-Adapter, they frame the caching-based adaptation as a kernel regression problem, introducing a proximal regularization in a reproducing kernel Hilbert space to capture both local and global features. ProKeR integrates global regularization with few-shot data, incorporating global information in local adapters. Extensive experiments on both fine-grained and OOD datasets demonstrate that ProKeR consistently outperforms existing methods.
- ProKeR is only tested on training-free few-shot adaptation, which restricts its scope. Exploring the effects of loosening or reinforcing this constraint could enhance the method's practical relevance. For instance, would additional computational resources improve ProKeR’s performance, for example by training? Alternatively, if no few-shot samples were available, could it still operate effectively? Additionally, recent methods like DMN[1], which utilize an attention-based cache for both zero-shot and few-shot adaptation in training and training-free contexts, are absent from ProKeR’s comparison set.

- ProKeR aims to enhance few-shot adaptation by aligning few-shot and zero-shot features in RKHS. However, the paper does not adequately assess the effectiveness of this alignment. A deeper analysis of feature alignment, such as using metrics like cosine similarity between few-shot and zero-shot features or visualizations via t-SNE, could bolster the credibility of the method and provide clearer insights into how effectively ProKeR bridges this feature gap.

- ProKeR  is evaluated for few-shot adaptation only in the experiments. It is not explicitly discussed if the method could handle zero-shot adaptation instead.

[1] Zhang, Yabin, et al. "Dual memory networks: A versatile adaptation approach for vision-language models." Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. 2024.
Yes
No ethics review needed.
1.I think the paper has shortcoming in theory or motivation, which needs to be researched and revised.

2.The insight is inspiring, but the author should simplify their methods and improve the writing to make the paper looks more appealing.
1.The paper provides a novel theoretical framework for better understanding the caching models, coming with detailed derivation.

2.The proposed ProKeR achieves competitive performance on most few-shot classification datasets.
This paper focuses on the few shot adaptation of large scale vision-language models (VLMs), particularly for CLIP-based cache model. 
The paper first rethinks the Tip-Adapter from the perspective of kernel, and then proposes a training-free method called ProKeR (Proximal Kernel ridge Regression) based on such kernel perspective. 
Extensive experiments reveal that ProKeR achieves a new SOTA on few-shot classification benchmarks.
1.Rigorousness of theory:

①Some claims have no theoretical basis, e.g., in line 201 & 277-279, the author claims that the regularization preserves prior knowledge, and predictions are not far from the zero-shot predictor, which is better for few-shot classification. 
But why predictions close to zero-shot predictor will be better, can you provide some theoretical evidence? 

Relatively, there are some contrasting methods, like AMU-Tuning, which does not perform regularization or require to be close to zero-shot predictor, but it gets better results.
Moreover, after introducing features from extra model, AMU-Tuning’s prediction will be further away from zero-shot predictor, but it achieves much better performance (about 5% higher than author’s on ImageNet before fine-tuning).
The important thing is that a single model’s prediction have low performance, but when their prediction are combined, it will achieve a high performance.

Does the conclusion of AMU-Tuning indicate that CLIP's zero-shot prediction is sub-optimal? This seems contradict to author's claims and motivation.
Can author compare their methods, and explain why AMU-Tuning’s prediction is far from CLIP's zero-shot predictor, but achieves extremely better results?
Is this reveals CLIP's zero-shot prediction is sub-optimal? 
Or is it because your method does not fully capture novel knowledge from support set? 
Is this related to overfitting on the few-shot data?
If CLIP's zero-shot prediction is indeed sub-optimal, is it reasonable for author to believe that the prediction should be close to CLIP's zero-shot prediction?

②There are many estimates and approximations in paper, but without providing any analysis of errors. However, in extreme low-data situations, such errors may be fatal.
For example, from equation 6 to equation 7, you have quantified the continuous mapping into a discrete form. But in fact, for few-shot problem, the value of K is very small. 
It is suggested to calculate the quantization errors and analyze the impact of K on such errors.


2.The contribution and practical value.
The paper integrates large number of components like RBF, LLR, local method, global metric, RKHS, RFF, Polynomial, etc., making the mechanism very complex and cumbersome, but the advantages compared to SOTAs are not obvious.
In summary, it has complex mechanism and non-competitive resource consumption, but does not achieve much better performance, i.e., on CoOp’s benchmark, only a bit higher than GDA.
A comprehensive component ablation should be conducted for readers to clearly identify the main components and their effect.


3.Weakness on writing. 
The paper lists a series of components and proprietary terms, some of which are secondary, but the author only describes them one by one without highlighting the core components.
And some components, like RKHS, have no introduction or contextual support, making it difficult for readers to understand their principles and why author need to use them.
The mentioned problems make the key points of paper not clear and prevent readers to understand it. 
It is more like a document introducing the process rather than explaining an interesting method.
I think the authors should reorganize the paper with a high-level overview, a clear pipeline illustration and a road-map of their method early in the paper.  
And they can consider including the descriptions of the unimportant components into the appendix to highlight their core framework.



Reference: AMU-Tuning: Effective Logit Bias for CLIP-based Few-shot Learning
Yes
No ethics review needed.
see weaknesses
1. The paper provides a theoretical explanation from a kernel perspective for methods like Tip-Adapter, validating the effectiveness of existing approaches.
2. Based on this theoretical framework, a new algorithmic design that incorporates global information is proposed.
3. There are improved results on standard benchmarks reported, illustrating the practical efficacy of the proposed method.
This paper explores training-free methods like Tip-Adapter from a kernel perspective, providing theoretical analysis and algorithmic innovations. By categorizing caching methods as Local adapters, the paper proposes a new global adapter that learns a proximal regularizer in a reproducing kernel Hilbert space. Experiments are conducted on standard benchmarks.
1. The citation format in the paper does not align with the ICLR template; the paper uses numerical references, whereas ICLR prefers author-name citations (e.g., CLIP by Radford et al., 2021).
2. The relationship between equations (2) and (3) is unclear. Equation (3) includes a denominator that is absent in equation (2); how should these be corresponded and understood?
3. The concept of "global" as opposed to "local" is confusing in this context. Familiar Tip-Adapter methods use weighted few-shot samples to predict test sample outcomes, utilizing all training samples, which seems global in nature. What explicit meanings are assigned to "global" and "local" in this paper?
4. The focus of the paper on training-free CLIP adaptation could benefit from a discussion of recent related works such as [1].

[1]Dual memory networks: A versatile adaptation approach for vision-language models, CVPR2024
Yes
No ethics review needed.
See weakness.
I am happy to revise my score if authors could address my concerns.
- The overall presentation is clear and easy to follow. 

- This paper analyses Tip-Adapter from the kernel-based perspective and provides a novel theoretical foundation, which provides some insights for understanding training-free adapting methods.

- Based on the understanding, the authors further propose ProKeR, which leverages the RKHS framework to introduce global regularization, addressing biases present in local nonparametric methods like Tip-Adapter.

- ProKeR achieves the state-of-the-art for training-free few-shot adaptation under two settings.
This paper introduces a kernel-based method to understand and enhance the training-free adaptation methods (Tip-adapter).  The authors provide a novel analysis of the Tip-Adapter method from a kernel perspective and identify that Tip-Adapter functions as a modified Nadaraya-Watson estimator. Then, the authors propose ProKeR and RKHS proximal regularizers. Extensive experiments are conducted and  the results validate the effectiveness of the proposed ideas.
- Reproducibility: Authors should report the values of the hyperparameters in the implementation part. Moreover, in CoOp's setting, the ImageNet dataset has no validation dataset, how do authors select hyper-parameter?

- What is validation shots? It is validation set or shots from validation set? If it is validation set, it is better to name it as validation set to avoid confusion.

- The implementation part missed many details. For example, did authors follow CoOp to run 3 times for each experiment and report the average results? How did authors use data augmentation? Since authors did not provide code, they should clarify these clearly for reproducibility.

- Table 5 missed the results of GAD.

- I understand that this paper is mainly for training-free settings. However, I am concerned about the practical usage. If we are provided with K-shot samples, why do we only use training-free methods without fine-tuning, as fine-tuning usually leads to much better results (as shown in Tip-Adapter)? Could authors further discuss how to develop ProKeR with fine-tuning (like Tip-Adapter-F) or could we combine ProKeR with fine-tuning methods to further boost their performances?

- ProKeR seems sensitive to different kernels. Could authors further discuss why specific kernels have better results for better understanding?

- An important goal of fine-tuning is to maintain the generalization ability of CLIP. Could authors report the base-to-new setting results as done in GDA to demonstrate the generalization ability of ProKeR?

- It seems that ProKeR only surpasses GDA by a little margin on CoOp's datasets, but with nearly 3 times of inference time. Could authors further discuss the advantages of ProKeR over GDA?

- Hyperparameter $\lambda$ is an important factor of the proposed method, but the sensitivity analysis is placed in the appendix. It is suggested to place this part in the main paper part. Moreover, it is strange that authors use $\lambda$ instead of true values for sensitivity analysis, could authors specify the values of $\lambda$ for analysis for better understanding?
A  theoretical understanding of training-free few-shot adaptation of  Vision-Language Models based on which we propose a state-of-the-art approach
@inproceedings{
anonymous2024a,
title={A Kernel Perspective on Training-Free Few-Shot Adaptation of Large Vision-Language Models},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=C7ffKahGty},
note={under review}
}
The growing popularity of Contrastive Language-Image Pretraining (CLIP) has led to its widespread application in various visual downstream tasks. To enhance CLIP's effectiveness, efficient few-shot adaptation techniques have been widely adopted. Among these approaches, training-free methods, particularly caching methods exemplified by Tip-Adapter, have gained attention for their lightweight adaptation without the need for additional fine-tuning. In this paper, we revisit Tip-Adapter from a kernel perspective, showing that caching methods function as local adapters and are connected to a well-established kernel literature. Leveraging this insight, we offer a theoretical understanding of how these methods operate and suggest multiple avenues for enhancing over the Tip-Adapter baseline. Notably, our analysis shows the importance of incorporating global information in local adapters. Therefore, we subsequently propose a global method that learns a proximal regularizer in a reproducing kernel Hilbert space (RKHS) using CLIP as a base learner. Our method, that we call ProKeR (Proximal Kernel ridge Regression), has a closed form solution and achieves state-of-the-art performance across 11 datasets in the standard few-shot adaptation benchmark.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Few-shot Learning Vision-Language CLIP Efficient adaptation
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/5a9c1013097f1c06ad72ae646462f0f7ab505ad2.pdf
transfer learning, meta learning, and lifelong learning
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
A Kernel Perspective on Training-Free Few-Shot Adaptation of Large Vision-Language Models
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission