REVIEW 3 major objections 7 minor 33 references
DualReward: A Dynamic Reinforcement Learning Framework for Cloze Tests Distractor Generation
T0 review · 3 major / 7 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read DualReward claims that separating rewards for human and machine distractors lifts cloze-test ranking quality.
desk verdict Plausible gains, but the 'RL' objective in Sec. 3.2 is weighted cross-entropy over fixed labels, and the adaptive reward scale is a global loss-dependent multiplier that acts like a learning-rate schedule. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is a weighted maximum-likelihood objective written as $L_{RL} = -\mathbb{E}_{(s,a)\sim\pi_\theta}[\mathrm{reward}(s,a)\log\pi_\theta(a|s)]$, trained on a fixed set of ten labels per instance: three gold distractors and seven model-generated candidates. Rewards are set by the dual structure ($1$ for gold, $0.9 \times$ BERT confidence for generated) and scaled by $\mathrm{reward\ scale} = \mathrm{base} + (\mathrm{max}-\mathrm{base})\,\sigma(\alpha(\mathrm{avg\ loss}-\mathrm{threshold}))$. The confidence score is the softmax probability from BERT's masked-language-model head at the blank position. This machinery converts the quality distinction between human and generated candidates into different gradient magnitudes.
What would settle it
Train the same T5 model with the same ten labels per instance using standard weighted cross-entropy where gold distractors receive weight 1 and generated distractors receive weight 0.9 × confidence, with no adaptive scaling or reinforcement-learning framing. If P@1 on MCQ remains at or above 37.84%, the adaptive dual-reward mechanism is not responsible for the gain; if it falls below the reported number, the claim survives this test.
Extended reading notes
Core claim
The central claim is that a dual reward structure — gold distractors scored at 1×scale, generated candidates at 0.9×scale×confidence — combined with a loss-based adaptive scale yields better distractor ranking than uniform rewards, constant reward scales, and existing baselines, on both passage-level and sentence-level cloze benchmarks. On CLOTH-F the reported P@1 is 28.87% with larger gains in ranking metrics; on MCQ with retrieval-augmented pretraining the reported P@1 is 37.84%, exceeding the RAP-PT5 baseline by 6.18 percentage points. The authors attribute the cross-domain advantage to the adaptive scaling mechanism, which provides stronger signals when loss is high and gentler signals as performance stabilizes.
Load-bearing premise
The premise that a single fixed set of ten labels per instance with confidence-based rewards is a genuine policy-gradient training signal; if the objective is just weighted cross-entropy, the reported gains may come from reweighting rather than from reinforcement learning.
Editorial extensions
If this is right
- Distractor ranking models can be trained without discarding low-confidence candidates, using them as controlled negative examples with discounted reward.
- The adaptive scale offers a way to reduce sensitivity to the choice of reward magnitude, since the same base, max, and threshold settings work across homogeneous and cross-domain data.
- The ranking-metric gains (MRR@3, NDCG@3) imply that even when top-1 precision moves little, the ordered list of distractors becomes more useful for assembling real multiple-choice items.
- On diverse sentence-level data, pretraining plus dual reward appears complementary, with the MCQ gains coming largely from the reward mechanism rather than from pretraining alone.
- The framework transfers to other text-generation tasks where training examples have graded reliability, not just cloze distractors.
Reading between the lines
- The reported objective is formally identical to reward-weighted maximum likelihood over a static set of labels; whether the gains come from reward-driven exploration or from reweighting the training distribution is not settled by the experiments, since no online rollouts are used.
- A testable extension would be to compare against plain weighted cross-entropy with the same weights; if gains persist, the reinforcement-learning framing is not needed to explain them.
- The dual reward hierarchy could be reinterpreted as a regularizer that prevents the model from overfitting to its own generations, which would predict larger benefits on small, diverse datasets like MCQ.
- The adaptive scaling schedule depends only on training loss; using validation-based or confidence-calibration-based triggers could make the mechanism more robust across domains.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes DualReward, a framework for distractor generation in cloze tests. It builds a fixed set of 10 candidate labels per instance (3 gold distractors from human references and 7 candidates generated once by a BERT-based CSG module), and trains a T5-base model with a loss that weights each label by a reward: gold labels receive reward 1 times a scale, generated labels receive 0.9 times the same scale times a static BERT confidence score. The scale is computed adaptively from the average training loss via a sigmoid. The authors evaluate on CLOTH-F and MCQ, reporting P@1 improvements over baselines, and ablations showing benefits of dual over uniform reward and adaptive over constant scale.
Significance. If the reported improvements are real, the dual-reward weighting of gold versus model-generated distractors is a practically useful idea for distractor ranking, especially on cross-domain MCQ data. The paper includes a code link, ablation studies, and qualitative examples, which are strengths. However, the 'reinforcement learning' framing is not substantiated: the objective is a weighted maximum-likelihood update over fixed labels, and the adaptive scale is a global multiplier that is approximately cancelled by the AdamW optimizer, so the central mechanism described is not what the experiments claim to test. The paper's own limitations section appropriately acknowledges that the evaluation matches human distractors rather than measuring pedagogical effectiveness. The significance of the empirical results therefore depends on re-interpreting the method as supervised reweighting and on providing evidence that the adaptive component has any measurable effect.
major comments (3)
- [Section 3.2, Eq. (2)] The loss L_RL = -E_{(s,a)~pi_theta}[reward(s,a) log pi_theta(a|s)] is presented as a policy-gradient RL objective, but the training set is fixed: for each instance, Section 3.1 precompiles exactly 10 labels (3 gold plus 7 generated by the BERT CSG module), and the expectation is taken over this fixed multiset. There is no on-policy sampling, no replay from the current policy, no importance-weighting, and no baseline or advantage term. The implemented update is therefore -Sigma_i reward_i log p(y_i|s_i), i.e., weighted maximum likelihood or weighted cross-entropy, not a policy-gradient update. This is not merely a presentational issue: the paper's claim to 'dynamic reinforcement learning' and its interpretation of the dual-reward ablation as 'reward-driven exploration' depend on the RL framing. The authors should either re-describe the method as reward-weighted supervised learning or introduce an actual sampling-based RL objective.
- [Section 3.2, Eq. (3) and Section 4.3 (AdamW)] The adaptive reward scale is a single global scalar that multiplies both reward_gold and reward_gen. It therefore cannot change the relative weighting between gold and generated distractors, because reward_gold/reward_gen = 1/(0.9*confidence) is independent of the scale. Furthermore, with the AdamW optimizer, a global multiplicative factor on all gradients is approximately normalized away by the bias-corrected moment estimates (m_hat/sqrt(v_hat) is invariant to a constant scaling of gradients). The reported differences between adaptive and constant rewards in Table 4 (0.21-0.46% on CLOTH-F and 3.48-3.86% on MCQ) cannot, under the described algorithm, be attributed to the adaptive mechanism. The authors need to either (a) provide direct evidence that the adaptive scale changes the optimization trajectory (e.g., gradient norms, parameter updates, or comparisons with SGD), or (b) revise the claims and ablation to reflect that the adaptive component is not the source of the observed gains.
- [Table 4 and Table 2 (MCQ test set size)] The MCQ test set contains only 258 examples (Table 2). A 3.48-3.86% P@1 difference corresponds to roughly 9-10 questions. The paper reports no variance, confidence intervals, or significance tests across random seeds, so it is unclear whether the adaptive-versus-constant differences in Table 4 are beyond noise. This is particularly relevant given the theoretical concern in the previous comment. Please report multiple seeds and statistical significance, or temper the claims accordingly.
minor comments (7)
- [Section 3.2] The 'discount factor' of 0.9 is a constant reward weight, not a discount factor in the reinforcement-learning sense; please rename it to avoid confusion.
- [Table 3] Some baseline cells are '—' (R@1 for CSG+DS, MRR@3/NDCG@3 for CDGP). Report the values or explicitly state that they are unavailable.
- [Section 5.2] Figure 2 is referenced in the text but no plot appears in the submitted manuscript; please include the figure or remove the reference.
- [Section 4.1, Table 2] The CLOTH-F row shows '6500' for the All column but the column headings are ambiguous; please align the columns and ensure the totals match the sum of train, dev, and test splits.
- [Table 5] The qualitative examples include apparent truncations or typos such as 'Undrate' and 'eva'; please correct them or mark them as model outputs in a way that does not confuse the reader.
- [Section 4.3] The statement that adaptive scaling provides 'stronger reinforcement signals when the model struggles' should be made precise by connecting it to Eq. (3); as written, the direction (high loss leads to high scale) is correct but the explanation is informal.
- [Section 4.2] The description of the T5 multi-task baseline mentions 'pseudo Kullback-Leibler divergence regulation' without a citation; please add the appropriate reference.
Circularity Check
No circularity: rewards are external (human labels plus static BERT confidence) and all benchmark comparisons are against independent baselines.
full rationale
The derivation chain is self-contained with respect to circularity. Gold and generated rewards are defined from external human labels and a static BERT MLM confidence score (Section 3.2), not from the trained policy's outputs and not from the evaluation metric. The RL objective L_RL = -E[reward log pi] is implemented over a fixed precompiled set of 10 labels per instance (Section 3.1), which means the practical update is weighted maximum likelihood rather than an on-policy policy gradient; this is a correctness or novelty concern about the 'RL' framing, not a circularity, because the weights come from outside the trained model and the test-set numbers are compared against independent baselines. The adaptive scale is a single global multiplier computed from average loss, so its effect may be partly absorbed by AdamW, but this again concerns efficacy, not definitional dependence. The hyperparameters (alpha = 5, threshold = 1.0, pool size 10) were set by pilot or preliminary experiments and are reported as tuning choices, not as predictions derived from the model. No self-citations are load-bearing; all cited baselines (CDGP, RAP-PT5, T5 multi-task) are external prior work. The paper's stated limitation that evaluation measures matching human distractors rather than pedagogical effectiveness is acknowledged in Section 7 and does not create circularity.
Assumptions & free parameters
free parameters (6)
- base_scale =
0.1
- max_scale =
0.2
- alpha =
5
- threshold =
1.0
- discount_factor =
0.9
- candidate_pool_size =
7 generated + 3 gold
assumptions (5)
- domain assumption The confidence score from BERT's masked LM head is a valid reward signal for distractor quality.
- ad hoc to paper The training objective is a valid policy-gradient RL update.
- domain assumption Gold-standard distractors are fully reliable and should be imitated at higher weight than model-generated candidates.
- domain assumption Average training loss is a good proxy for model performance when adjusting reward scale.
- domain assumption Matching human-created distractors is a valid proxy for distractor quality.
Cite this review
Pith. "Pith review of DualReward: A Dynamic Reinforcement Learning Framework for Cloze Tests Distractor Generation." pith.science (2026). https://pith.science/paper/M2NKBJBS
@misc{pith2026250711875,
author = {Pith},
title = {Pith review of: DualReward: A Dynamic Reinforcement Learning Framework for Cloze Tests Distractor Generation},
year = {2026},
howpublished = {\url{https://pith.science/paper/M2NKBJBS}},
note = {Machine review of arXiv:2507.11875}
}
read the original abstract
This paper introduces DualReward, a novel reinforcement learning framework for automatic distractor generation in cloze tests. Unlike conventional approaches that rely primarily on supervised learning or static generative models, our method employs a dual reward structure with adaptive scaling that differentiates between human-created gold standard distractors and model-generated candidates. The framework dynamically adjusts reward signal intensity based on model performance and confidence. We evaluate our approach on both passage-level (CLOTH-F) and sentence-level (MCQ) cloze test datasets, demonstrating consistent improvements over state-of-the-art baselines. Experimental results show that our adaptive reward scaling mechanism provides modest but consistent benefits on homogeneous datasets (CLOTH-F) and more substantial improvements (3.48-3.86% in P@1) on diverse, cross-domain data (MCQ), suggesting its particular effectiveness for handling varied question types and domains. Our work offers a flexible framework that effectively balances learning from reliable human examples while exploring novel, high-quality distractors for automated test generation.
Figures
Reference graph
Works this paper leans on
-
[1]
eating / working, preparing, thinking
-
[2]
plan / suggestion, demand, re- quest
- [3]
-
[4]
occupied, attracted, invited 4
involved / trapped, lost, bathed 4. occupied, attracted, invited 4. occupied, lost, included
- [5]
-
[6]
qualify / appeal, look, call 3. appeal, provide, care 3. arrange, provide, care
-
[7]
finally / eagerly, gradually, gratefully
-
[8]
speech / lecture, discussion, debate
Show all 33 references
-
[9]
discussion, joke, story
lecture, discussion, report 5. discussion, joke, story
-
[10]
listened / calculated, drank, ex- plained
-
[11]
cried, shouted, talked
cried, laughed, drank 6. cried, shouted, talked
-
[12]
life / progress, performance, investment
-
[13]
suddenly, luckily, immediately
suddenly, luckily, immediately 7. suddenly, luckily, immediately
-
[14]
admitted / interrupted, apolo- gized, complained
-
[15]
refused, agreed, argued
refused, agreed, argued 8. refused, agreed, argued
-
[16]
automatic / slow, independent, changing
-
[17]
natural, ordinary, important
natural, important, difficult 9. natural, ordinary, important
-
[18]
hit / confused, informed, pleased
-
[19]
beat, attracted, comfort
beat, pleased, attracted 10. beat, attracted, comfort
-
[20]
decision/comment, an- nouncement, arrangement
-
[21]
promise, suggestion, expla- nation
plan, promise, suggestion 11. promise, suggestion, expla- nation
-
[23]
family, career, study
progress, study, family 12. family, career, study
-
[24]
conversation / contract, nego- tiation, argument
-
[25]
decision, competition, agree- ment
-
[26]
connection, competition, agreement
-
[27]
gave, lent, sent 14
showed / lent, sold, offered 14. gave, lent, sent 14. sent, lent, brought
-
[28]
recognized / recalled, de- fined, declared
-
[29]
hoped, imagined, guessed
believed, hoped, imagined 15. hoped, imagined, guessed
-
[30]
method, chance, road 16
way / tool, method, rule 16. method, chance, road 16. gift, road, place
-
[31]
save, use, provide 17
buy / provide, give, deliver 17. save, use, provide 17. save, use, borrow
-
[32]
work, study, gather 18
grow / survive, move, gather 18. work, study, gather 18. live, work, study
-
[33]
difficult, simple, common 19
wise / difficult, random, firm 19. difficult, simple, common 19. difficult, simple, strange Table 6: CLOTH - F Generated Distractors Example
-
[2024]
In Findings of the Association for Computational Linguistics: ACL 2024 , pages 11019–11029
Enhancing distractor generation for multiple-choice questions with retrieval augmented pretraining and knowledge graph integration. In Findings of the Association for Computational Linguistics: ACL 2024 , pages 11019–11029. Zesch, T. and O. Melamud. 2014, June. Automatic gener...
2024
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.