- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes CAGE, a policy-gradient method for LLM workflows that separates Router and Specialist gradient estimation. It ensures that every route is sampled, computes Router gradients across routes, and uses route-specific baselines for Specialist gradients.
Critical strengths
-
The paper provides some mathematical proofs for the proposed gradient estimators, including their unbiasedness under the stated assumptions.
-
The paper honestly reports its experimental limitations and acknowledges that the current results do not demonstrate a significant improvement over the baseline.
Critical weaknesses
-
Figure 1 has overlapping lines and labels and does not clearly show the key idea of CAGE or how it improves upon existing methods. It strongly resembles an AI-generated image.
-
The paper is difficult to follow because the writing is unnecessarily complicated and the explanations lack a clear logical flow.
-
The experiments are very limited, and the results do not show that CAGE improves learning performance or that its components are effective.
-
The novelty is unclear because CAGE mainly combines existing techniques and does not actually use graph structure for credit assignment.
-
The theoretical proofs assume that the sampling and gradient calculations use the same policy distribution, but the reported experiments do not fully satisfy this assumption.
-
The paper does not explain why forcing every route to be sampled improves learning, especially when this may waste samples on rarely selected routes without producing useful gradients.
-
The supplementary materials appear to contain only the LaTeX source of the paper, rather than the code or additional experimental evidence needed to verify and reproduce the results. This was weird.
Questions for authors
Please answer each question listed in the Weakness.