From: NeurIPS.cc/2022/Conference/Program_Chairs
title: Paper Decision
decision: Accept

From: NeurIPS.cc/2022/Conference/Paper5414/Area_Chair_YUu9
metareview: The problem is well introduced and the main results are clearly presented
While there are no experimental results, the theoretical contribution seems strong.
Please add the main open problems to the final version.


recommendation: Accept
confidence: Certain
award: No

From: NeurIPS.cc/2022/Conference/Paper5414/Authors
title: Reply by the authors
comment: We thank the reviewer for appreciating our contribution even though it does not fall into their area of expertise.

From: NeurIPS.cc/2022/Conference/Paper5414/Authors
title: Reply by the authors
comment: R: “No experimental results limit the impact of the work.”

A: Our work has a theoretical goal: understanding whether, by carefully combining two types of query, one can bypass the well-known computational and information-theoretic limitations of each of them. We believe we fulfill that goal, and we do not see the lack of experiments as a weakness. This is in line with related works, see e.g. (Kane et al., 2017) or (Hopkins et al., 2021). Moreover, we believe that implementing our algorithm leaves so much room for engineering and tuning (recall that it uses cutting planes, hit-and-run, isotropic position estimation, ...) that any reasonable experimental evaluation would be a work on its own.

R: “It would be nice to see some mentions of future work and remaining open problems.”

A: Thank you for the suggestion. The main open problems are (1) closing the gap between upper and lower bounds, and (2) providing a tradeoff between label and seed complexity (that is: if we are allowed at most S seed queries, how many label queries do we need?). We will add them to the final version.

R: “For the query complexities, it seems like the lower bound is linear in the dimension while the upper bound for the label query is quadratic. Which of the two could be improved?”

A: Actually, our bounds are somewhat tight: if $\gamma = O(n^{-m})$, then the lower bound is in $\Omega(m^2 \log n)$ and matches the label part of the upper bound; and if $\gamma = O(m^{-a})$ for some constant $a > 0$, then the lower bound is in $\Omega(m \log (m/\gamma))$ and matches the seed part of the upper bound. One could explicit this by writing the lower bounds as a $\min(\ldots)$, but we preferred to keep it light. We will however add a remark.

R: “Are there interesting cases where the upper and lower bounds match?”

A: One such case is the class of instances given by the lower bound (Theorem 4); we do not know if that can be deemed interesting though. We have not found other particularly interesting cases yet.

R: “Is there a problem dependent quantity that characterizes the problem?”

A: Our bounds are parameterized by $n, m, k, \gamma$, so they are already instance-dependent in some sense. But we agree that developing an even more refined (and possibly tight) instance-dependent parameterization would be interesting.

R: “Are the algorithms BinLearn and KClassLearn implementable in practice?”

A: Definitely yes, if one can implement label and seed queries (see our answer to Reviewer 4ffc). The only tricky part in our opinion is the near-uniform sampler for convex bodies used by CPLearn. In our proof we use hit-and-run because it has crisp theoretical guarantees, but in practice one can use any efficient sampler of choice; and since such samplers are used by standard LP solvers, our algorithm is implementable as much as those LP solvers are.

R: “It might still be valuable to mention what could go wrong if the suggested algorithms were actually deployed.”

A: We believe there are no specific risks involved in deploying our algorithms. The potential risks are comparable to those of any other general-purpose active learning technology.

From: NeurIPS.cc/2022/Conference/Paper5414/Authors
title: Reply by the authors
comment: R: “no experiments is done”

A: Our work has a theoretical goal: understanding whether, by carefully combining two types of query, one can bypass the well-known computational and information-theoretic limitations of each of them. We believe we fulfill that goal, and we do not see the lack of experiments as a weakness. This is in line with related works, see e.g. (Kane et al., 2017) or (Hopkins et al., 2021). Moreover, we believe that implementing our algorithm leaves so much room for engineering and tuning (recall that it uses cutting planes, hit-and-run, isotropic position estimation, ...) that any reasonable experimental evaluation would be a work on its own.

R: “Are there any practical scenarios where seed queries are realizable?”

A: Yes. For instance, seed queries can be realized efficiently when outlier detection is possible. This is the case for vision and cybersecurity, where accurate out-of-distribution tests are available.

From: NeurIPS.cc/2022/Conference/Paper5414/Authors
title: Rebuttal
comment: We thank all reviewers for their constructive comments. We would like to point out that we have improved the lower bound of Theorem 4 by removing the $\log m$ factor at the denominator. This makes our bounds tight for some range of the parameters, as we explain in the replies.

From: NeurIPS.cc/2022/Conference/Paper5414/Reviewer_4ffc
rating: 7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed 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.
summary: This paper considers learning of k-class classifiers using label and seed queries, where seed queries are special ones that ask for some labeled examples in the specified region. The paper proposes an algorithm which learns the concepts in polynomial time, where the complexity involves convex-hull margin, an extension of margin in linear classes. The paper also shows a lower bound of necessary queries which shows the tightness of the analysis. 

strengths_and_weaknesses: Strength:
- strong theory paper with a lower bound



Weakness:
- no experiments is done
questions: Are there any practical scenarios where seed queries are realizable? 
limitations: N/A
ethics_flag: No
soundness: 3 good
presentation: 3 good
contribution: 3 good

From: NeurIPS.cc/2022/Conference/Paper5414/Reviewer_TPhg
rating: 7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed 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.
summary: This paper tackles the problem of active learning on classifiers with strong convex hull margin classes. In this framework that generalizes SVM margins, it is known that the query complexity of learning with only label queries is exponential in the dimension and that learning with seed queries is computationally inefficient. Is designed in this paper an approach that combines label and seed queries to learn such classifiers with a low query complexity in polynomial time. In addition to the upper bound on the query complexity of the provided algorithm, is established here a worst case lower bound on the query complexity of learning a k-class classifier with strong convex hull margin.
strengths_and_weaknesses: Strengths:
- Presentation: the problem is well introduced and the main results are clearly presented
- Impact: some of the results established seem to be of general interest (in particular CPLearn’s guarantees) in addition to solving the problem of learning through label and seed queries with a computationally efficient algorithm whose total query complexity is polynomial in the dimension of the space.
- The paper is technically sound.

Weaknesses: 
- No experimental results limit the impact of the work.
- It would be nice to see some mentions of future work and remaining open problems

questions: For the query complexities, it seems like the lower bound is linear in the dimension while the upper bound for the label query is quadratic. 
- Which of the two could be improved?
- Are there interesting cases where the upper and lower bounds match?
- Is there a problem dependent quantity that characterizes the problem? 

Are the algorithms BinLearn and KClassLearn implementable in practice?

limitations: The assumptions made are adequately stated. It would be nice to more clearly address the limitations of the work: without empirical support the algorithms provided in this work seem more like proofs of concept and it feels like there are still some open problems on the query complexity upper bounds. The authors state that the potential negative societal impacts of their work is N/A due to its theoretical nature. It might still be valuable to mention what could go wrong if the suggested algorithms were actually deployed. 
ethics_flag: No
soundness: 4 excellent
presentation: 4 excellent
contribution: 3 good

From: NeurIPS.cc/2022/Conference/Paper5414/Reviewer_Z1n9
rating: 5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.
confidence: 1: Your assessment is an educated guess. The submission is not in your area or the submission was difficult to understand. Math/other details were not carefully checked.
summary: This paper studies active learning of classifiers with margin (assumption of strong convex hull margin), by combining label and seed queries. Using seed queries only, the target classifier can be learned in $\mathcal{O}(m\text{log}n)$ -- for a set of n points in $\mathbb{R}^m$ -- but the algorithm has superpolynomial time complexity. The paper shows that using both label and seed queries, a binary classifier can be learned in $\text{poly}(n+m)$ time, using $\mathcal{O}(m \frac{\text{log}m}{\gamma})$ seed queries, where $\gamma$ is the strong convex hull margin and $\mathcal{O}(m^2 \text{log}n)$ label queries. These results are extended for multi-class classifiers with $k! k^2$ multiplicative overhead. The authors also show that the results hold even when only one class has strong convex hull margin, or when input points have bounded bit complexity.
strengths_and_weaknesses: The paper is written and presented well, the assumptions are stated well, and it solves a well motivated issue of efficiently leveraging seed queries, by combining with label queries. It also provides a novel efficient algorithm (CPLearn) for seed which provides the upper bound on seed queries.  


questions: The results and some algorithms seem novel, however I am not familiar with the area, so I cannot assess the significance fully. 
limitations: The assumptions are stated clearly and there are no negative direct negative societal impacts.  
ethics_flag: No
soundness: 3 good
presentation: 4 excellent
contribution: 3 good