Summary
The authors start by providing a theoretical analysis of the proportion matching algorithm, a standard algorithm from the literature that simply minimizes the loss over the average instance-level predictions.
Strengths
I find the way the authors approach to the problem of learning from label proportions, and the goal they set out to achieve to be very worthwhile. I also believe the theoretical results therein might of interest to the community. I did, however, struggle at times in managing to follow the paper. Therefore, in my opinion, the authors really need to spend some effort polishing and refining the exposition to make it accessible to the broader community.
Weaknesses
- My main gripe with the paper is that I would've liked to see more discussion, or intuition following each Theorem, corollary or proposition. For instance, I really would've liked the authors to spend some time discussing the assumption upon which Theorem 3.2 hinges, and if such an assumption is expected to hold in practice (although I do appreciate them giving an example for when it fails due to the model class not containing the true conditional distribution)
- Empirical evaluation seems to suggest improvement only with large bag sizes (2^7), and on some dataset not at all, compared to the baselines.
Questions
- Could you please say more regarding the sentence starting line 166? While the objective being approximation by equation (1) is clear to me, I'm not clear own what it means for equation (1) to "correctly approximate" it.
- In Figure 1, left plot, why does the prop matching loss start out much lower compared to other methods?
- Could you please elaborate on the statement of Theorem 3.2? In particular, I've been trying to conclude how strong of an assumption it is that the minimizer of the expected loss the average of $Z$ (I do believe it is very strong, and seldom holds in any realistic setting)
- In definition 4.1:
- Is $p$ as defined in the notation section or Theorem 3.2?
- I find the use of $\alpha$ here confusing, as my first instinct was to think of it as a label proportion, but in the notation section you only define $\alpha$ as a function of a bag. I then noticed that it is any real-valued parameter in $\[0,1\]$.
- Why does this definition make sense? I interpret this as somehow correcting the bias introduced by using bags instead of instances. If that is true, why does this correction term make sense?
- I think this definition requires some notion of distribution due to the presence of $p$?
- In proposition 4.2:
- the notation does not make it clear how $x_j$ is related to $\mathcal{B}$. I think something along the lines of $\mathbb{E}_{(x_j, \alpha) \sim (\mathcal{B}, \alpha)}$ would perhaps better convey your intent? But then I'm confused again, because somehow $\tilde{g}$ is a function of an individual instance and $\alpha$? But $\alpha$ is a function of the entire bag?
- Am I correct in reading the equations as saying that the soft-label corrected function averaged over all bags and proportions is simply equal to $g$ averaged over the instance-level data distribution? If so, then it is my opinion that this needs be framed and discussed since, from what I understand, your entire approach hinges upon this result, and it is by no means easy to see.
- I'm very confused by Equation 5,
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
Adequately addressed