- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
MGPO trains a diffusion model to create small synthetic training sets. It uses reinforcement learning with two rewards. A fixed task model gives the first reward. This reward measures whether an image matches the requested class or task. The second reward uses a minimum spanning tree (MST) built from real image features. It rewards generated features that are close to real nodes. It also rewards generation steps that follow nearby tree edges. The paper tests classification, object detection, and segmentation. It also gives theoretical results about how well the tree approximates the data geometry.
Critical strengths
- The problem has practical value. Perceptual quality is not equivalent to the training value of a small data set; directly considering the task signal in the generation stage is a reasonable route. Replacing offline optimization costs with a generation process that does not require reward guidance also has potential value.
Critical weaknesses
- The paper gives two different direction rewards.
Equation (4), on page 5, uses
1 - |cos|. Appendix C.2, on page 25, uses1 - cos, without the absolute value. I checked both formulas in the rendered PDF. The difference changes the reward. An MST edge has no fixed direction. Reversing its endpoints changes the signed version, but leaves the absolute version unchanged. The two penalties also have different ranges: [0,2] and [0,1]. Appendix A uses the absolute version. It does not establish which version produced the results. The authors must identify the actual implementation and make the formulas consistent. If they used the signed version, they should test whether reversing edges changes the results. - Two parts of the theory need correction.
Theorem 10 gives a sample threshold that does not depend on the confidence parameter η. It requires
C(log(n/η)/n)^(1/m)to stay below a fixed geometric threshold. For fixed n, this expression grows without limit as η approaches zero. Thus, the stated result cannot hold for every η in (0,1). Corollary 13 uses an excess-risk theorem that the paper does not provide. This missing theorem should connect the generated data to the classifier's test risk. I searched the complete PDF and checked Appendix A. The required theorem and assumptions are missing. Theorem 10 also uses edge distance where Equation (4) uses node distance. Its reward expression omits the distance coefficient from Equation (4). The authors need consistent definitions and a complete proof for the risk claim.
Questions for authors
See weakness.