- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the problem of finding a set-valued predictor that, with high probability, contains the ground truth for the matching problem. The authors connect the matching problem with conformal prediction and provide graph representations. The authors further propose a definition of the bottleneck score, which characterizes a permutation by the nonconformity of its worst-selected edge.
Critical strengths
The paper proposes a novel problem and introduces interesting notations that characterize it.
Critical weaknesses
There are several issues I have with this paper. The main issue is regarding a lack of clarity on why the problem is interesting and what the paper is trying to achieve:
- It is not clear how the problem setting is used in its applications and why this problem setting is interesting or studied previously. How the paper connects to conformal prediction in previous settings, and why conformal prediction is needed in this setting, are not very clear.
- The problem setting and the terms used are not properly defined in the experiment section. It is hard to understand why the bottleneck score is important and how graph representability is a useful property.
Questions for authors
Mentioned in the weakness.