- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes IMPFM, a multi-particle sampling framework for feedback-efficient inference-time search. The method combines flow-map-based posterior sampling with value-guided particle updates and kernel-based interactions. It also introduces an interaction-aware reweighting mechanism to improve sample diversity and reduce weight degeneracy.
The authors evaluate IMPFM on ImageNet-based search and text-to-image alignment tasks, including compositional and counting prompts. The results show improvements in reward scores and sample diversity over several SMC-based and reward-guided sampling methods under the same feedback budget.
Critical strengths
-
The author proposes an interesting approach to multi-particle guidance. The paper combines value-based guidance with particle interactions to balance reward optimization and diversity. Sharing information across particles is a useful idea, especially when reward feedback is expensive.
-
The paper gives promising experimental results. IMPFM shows clear improvements over several baselines across both search and alignment tasks. The ablation studies also provide useful evidence for the benefits of particle interaction and reweighting.
Critical weaknesses
-
Unclear KL-tilted target. Proposition 4.3 defines the target using a KL divergence between distributions, which is a scalar rather than a function of . It is unclear how this produces the claimed reweighting.
-
Questionable SVGD derivation. Appendix A modifies the normalization of the standard SVGD update, but without sufficient justification. It is unclear whether the resulting update still gives the claimed steepest descent direction.
-
Lack of posterior sampling guarantees. The iterative sampling procedure in Eq. (12) is not theoretically justified. Do the generated samples follow the desired conditional posterior?
-
Unclear importance weighting. The scores in Eq. (9) are not necessarily positive. The paper does not clearly explain how they are converted into valid importance weights for resampling.
-
Limited computational and statistical evaluation. The experiments mainly compare feedback budgets, without reporting comparable runtime or computational costs.
Questions for authors
-
Could the authors clarify the definition of the KL-tilted distribution in Proposition 4.3? In particular, how does the proposed KL term produce an -dependent reweighting?
-
Why do the particle updates in Eqs. (6) and (9) differ from those in Eqs. (10) and (11)? Could the authors also explain the normalization used in Appendix A?
-
What guarantees that the iterative procedure in Eq. (12) samples from the conditional posterior associated with the original ? Is there any empirical validation of this approximation?
-
How are the scores in Eq. (9) converted into nonnegative importance weights? Are exponentiated log-weights used to compute ESS and perform resampling?
-
Could the authors provide comparisons under matched computational budgets? This would help clarify the practical efficiency and stability of IMPFM.