Summary
This paper tackles the problem that classification tasks in Bayesian meta-learning meet mathematical problems with the softmax function. The previously proposed logistic-softmax function as an alternative can be optimized, but tends to exhibit inherent lack of confidence in prediction. To solve this problem, the authors propose to add a temperature scaling parameter in the function. This simple change not only solves the confidence problem when setting the temperature to less than 1, but also enjoys both theoretical and empirical advantages, as verified in the paper. For efficient and intractable optimization, the authors additionally use the data augmentation technique to derive a fully analytical mean-field inference method for the Bayesian meta-learning model.
Strengths
+ While being simple, the revised logistic-softmax function indeed enjoys better theoretical and empirical advantages, and these are all verified in the paper with proofs or experiments.
+ The proposed logistic-softmax function with temperature has the potential to be applied to broader research areas such as multi-class classification.
+ The writing is clear, making the paper easy to follow.
Weaknesses
- When we just focus on few-shot classification, I have to say that all bayesian meta-learning algorithms are not comparable to even very simple algorithms like ProtoNet or CE Baseline (I mean, if well-tuned, not the performance in Table 1) with the same architecture Conv-4. Also, as standard algorithms now use ResNet-12 as the backbone, all bayesian meta-learning algorithms still use Convnet, making the performance not comparable to those in most recent reported papers. This leads to doubt that do these bayesian meta-learning algorithms still perform well if we use ResNet-12 as the backbone? If the reason not to use ResNet-12 is the computation burden, then the biggest problem may be how to make bayesian inference more tractable. Also, another problem of interest is to figure out why bayesian meta-learning with complicated training steps cannot perform well on few-shot learning, even if equipped with nice theoretical properties. Since this paper does not answer these questions, I think the value of this paper is restricted.
Questions
- In theorem 3.3, $a$ is said to be the mean function with no restriction, so the mean of different sample points can be different. However, in line 444 in the appendix, all different samples have the same mean, can the author explain this?
- How does your method compare with non-Gaussian processes like neural process [1]? It seems that neural process is more flexible and efficient than Gaussian process.
[1] Garnelo et al. Neural processes.
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
The authors have discussed the limitations which I found reasonable. I suggest the authors think more about the role of Gaussian process in bayesian meta-learning, as well as the role of bayesian meta-learning in few-shot classification.