Paper ID: | 3801 |
---|---|

Title: | BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning |

post-rebuttal: Thank you for the clarification. My score remains the same. ----------------------------- It is an interesting work that addresses the degeneracy of batch acquisition when using BALD as a score function. The methods proposed in the paper elegantly deals with the problem of redundant acquisition when using BALD in a greedy manner. I have a few questions and hope the authors can address them: (1) Does this problem of redundant acquisition only happen when one uses BALD as the score? Intuitively I would think no, as if one uses any score function greedily, regardless of the contribution of the other samples selected in the same batch, one can still end up with a biased batch that can potentially harm training. If this is the case, then why are var-ratios and mean-std outperforming random? I guess it is a matter of batch size? Is there any intuition why this problem seems more serious when one uses BALD as the acquisition score? (2) To me, Figure 4 really points out the problem and Figure 5 explains why we want to do AL in a batch manner (due to the computational cost). To avoid confusing though, I would suggest emphasizing that an AL algorithm is considered as good when the "accumulated accuracy" is maximized (Fig 4), as long as it is not at the cost of extra computational burden (Fig 5). Since simply just reading Fig 5 (and the description in the text), one could interpret it as BALD is better since it takes less "time" to achieve 95% accuracy. (3) I'm not sure if I get the meaning of Fig 8. You can probably just randomly permute the RHS and it's going to look equally uniform. Likewise, you can also sort the bins for the BatchBALD's acquisition count, then for sure the difference between the max and min values will be contrasted. Perhaps sorting both of them will be more fair? I would also suggested printing some statistics measuring the dispersion (entropy, range, etc). On a related note, why is it that they end up having different "datasets"? is it that the training set is not exhausted after all of the acquisitions? (4) The section on "scope and limitations" seems a bit hastily written. For example, I don't get the intuition of why BatchBALD is expected to perform well if the test set is balanced, and not so otherwise. Will BALD also perform well if the test set is balanced? Please elaborate. (5) What does the shaded area in all of the figs stand for? "1 stdv from the mean across multiple experiments"? "over test set data points"? (typos) - line110: redundant "p(w" at the end? - line122: I think P_{1:n-1} is of shape c^{n-1} x k ? - line238: "Noisy" estimator

Summary: The paper developed an active learning that selects a batch of images that jointly maximizes the mutual information and hence improves the accuracy of the image classifier. This is an extension of Bayesian Active Learning by Disagreement (BALD) acquisition function that computes a mutual information between a set of points and model parameters. This approach outperforms BALD in three datasets: MNIST, RepeteadMNIST and EMNIST. Originality: The paper proposes an interesting idea of selecting samples to annotate jointly by maximizing the mutual information between a batch of samples and model weights instead of selecting them independently for each batch. Basically, the main contribution is the extension of the BALD acquisition function on image data to jointly score samples that would minimize the number of annotations while maximize the performance of the model; thus it extends the mutual information between model prediction and model parameters to between a joint of multiple model predictions. Despite proposing this novel batch selection acquisition function exploiting mutual information between multiple data points the paper should include some related work on batch selection [1,2,3], particularly regarding a discriminative batch model that also exploits the uncertainty of unlabeled data [1], selection of the best samples that match a distribution [2] and exploiting diversity in a mini batch using K-means clustering[3], and include recent literature in active learning [4]. Significance: This paper seems to be a useful contribution to the literature on Batch Mode Active Learning, showing that using the mutual information between a joint set of multiple data points and model predictions outperforms independent selection of samples using BALD and Random selection on three MNIST-based datasets: Repeated MNIST, MNIST and EMNIST, and VarRatios and Mean STD on Repetead MNIST. Moreover, the paper shows that the proposed approach requires less interactions with the oracle (batch size>1) to achieve the same performance when the oracle is asked at each iteration (batch size =1) (upper bound) although the same amount is annotated; hence it reduces the number of times the model is retrained and the number of requests to annotate the data. However, the main weakness of the paper in my view are: (a) the proposed approach should be also tested on more difficult datasets like CIFAR-10, CIFAR-100, CINIC-10 or ImageNet that requires the annotation of large batches in order to have significant improvement on the performance of the model due to the difficulty of the task. Hence, it would demonstrate that usability of the approach on real world problems. Moreover, (b) a comparison with the most current related work on active learning like CoreSet, Variational Adversarial Active Learning, DeepFool Active Learning, or Expected Gradient Length would be interesting to show the need of using batch mode selection. Finally, (c) it would be interesting to add an ablation study where the performance of BatchBALD and BALD is compared with different sizes of the subsampled dataset pool because the performance of BALD depends also a lot on this hyperparameter and it would reduce the chances of having repeated images on RepeatedMNIST. Quality: The idea of having a mutual information between a joint set of multiple data points and parameter and of how it is optimized by applying two approximations (greedy algorithm that selects one sample each time per batch and Montecarlo sampling to avoid exact computation) are certainly good for joint selection of data points while reduces computational time albeit some careless notation mistakes (symbol in Eq. (2), Lemma 2 and line 370 in supplemental material). It would be interesting to show empirically that these two approximations are negligible to the exact solution besides the theoretical proof in Appendix A. Clarity: The paper is clearly written and structured clearly, and the code help me on clarifying an important point in the paper (see below). The section from 3.3 to 3.4.1 could be improved by describing firstly the computation of BatchBALD and then introduce the greedy approximation and the efficient implementation for solving the NP-hard problem. It would be present smoothly the proposed approach and the contributions. However, the paragraphs from line 127 and 131 that describes the MonteCarlo sampling to avoid exact computation should be described how it is computed clearly because it could confuse since given x_1:n-1 fixed the predictions y_1:n-1 are also fixed. Checking the provided code I figured out how it is calculated the P_1:n-1 for the joint mutual information. References: [1] Yuhong Guo and Dale Schuurmans. Discriminative Batch Mode Active Learning. NIPS 2008. [2] Javad Azimi, Alan Fern, Xiaoli Z. Fern, Glencora Borradaile, and Brent Heeringa. 2012. Batch active learning via coordinated matching. ICML12 [3] Fedor Zhdanov. Diverse mini-batch Active Learning. https://arxiv.org/pdf/1901.05954.pdf [4] Samarth Sinha, Sayna Ebrahimi and Trevor Darrell. Variational Adversarial Active Learning. https://arxiv.org/pdf/1904.00370.pdf ------------------------------------------------------------------------------------------------------------------ First of all, I appreciate the authorâ€™s effort for addressing all our concerns and improvements, specially adding extra experiments during this short time. Therefore, I upgrade my recommendation as a good submission and voting for his acceptance. Moreover, I would encourage the authors to also include an ablation study of how the subsampling size w.r.t. the unlabeled pool affects BALD and BatchBALD. Based on my experience using BALD, the size of the subsampled samples from the unlabeled pool affects on the final performance of the model; hence I recommend adding this ablation study to improve the quality of the paper.

Quality: Pros: Overall, this is a technically sound submission. I really like the proof of the submodularity of the proposed batchBALD acquisition function. Furthermore, the way to estimate that acquisition function using Monte-Carlo as well as the new efficient implementation are quite interesting. Cons: My first concern is about the quality of the estimation in (10) when working with large acquisition sizes $n$. In particular, the number of overall possible configurations of $y_{1:n}$ is $n!$ (# of permutations)--will be extremely large when $n$ increases, while only $m$ samples were chosen. Although this was explained in app. C, it's still unclear for me about the difference between $m$ and $n!$. Furthermore, the experimental results of the submission is not very compelling since they were only conducted on MNIST and its variants. It's would be more convincing if the authors can provide the results on at least one more benchmark data set in the field (e.g., cifar10). Clarity: The submission is clearly written and well organized. However, it's unclear for me about the definition of data repetition. Does a data point x' duplicate the given data point x if x'=x, or these samples are closed enough? That relates to the Alg.1 as well as way to generate the repeated MNIST(sec. 4.1). In particular, Alg. 1 can only guarantee that the new selected data point $x_n$ is different from the previous ones; while in repeated MNIST, a duplicated sample is generated by adding a Gaussian noise to a given sample. Originality: The proposed BatchBALD is a novel extension of one of the most widely studied acquisition function in the Bayesian active learning with disagreement (BALD) framework [10], but targeting the selection of a joint (dependent) batch data samples to improve the data diversity. The paper also introduces the use of a greedy approximation algorithm as well as new ways to estimate the BatchBALD acquisition function. Significance: The main contribution of the paper is to improve the data efficiency of the selected informative data points in BALD w.r.t both the diversity and batch size. The experimental results are quite promising. Post rebuttal comments: I have read the author feedback carefully. Thanks the authors for providing insightful clarifications, especially for providing further experimental results required for the score improvement. Also, based on positive coments/evaluations from fellow reviewers to the paper, I decide to upgrade my score for the paper to 7.