Skip to main content
Search

# Qwen2.5

4 related articles

Subscribe to updates
  1. arXiv

    No Formal Answer, Still Learnable: Reward Training Lifts Spontaneous Correct Refusal From 25% to 100%

    On evidence-sufficiency judgment, a domain with no decidable correctness reward, a boundary-keeping recipe of supervised fine-tuning followed by GRPO on an LLM-judge reward raised spontaneous correct refusal under action pressure from 25% in the instruction-tuned baseline to 100% (40 per arm; Wilson 95% CI lower bound 91.2%, non-overlapping with the baseline interval [14.2%, 40.2%]), while a scrambled-pairing placebo fell to 5%. The same recipe's automatic false refusal on 281 well-formed claims was 1.1% (Wilson upper bound 3.09%), so the effect is boundary-specific rather than blanket refusal; SFT saturates the face, leaving the GRPO increment not separately identifiable, and ratings come from model sessions, not human experts.

  2. arXiv

    Jev holds high NDCG@10 across three Amazon domains while its latency grows far more gradually than pointwise Qwen

    On Movies and TV, Video Games, and Books from Amazon Reviews 2023, the study builds controlled hard candidate sets from SASRec's highly ranked negatives (candidate sizes 10 to 100) and compares Jev, a decision-oriented "System One Model" from TypeSafe AI, against SASRec, DCNv2, and pointwise and listwise Qwen2.5 7B Instruct rerankers, finding that Jev maintains strong recommendation effectiveness (NDCG@10, Hit Rate@10, MRR) while its observed serving latency grows substantially more gradually than pointwise Qwen, though it remains far above recommendation-specific models.

  3. arXiv

    ZJU team runs 25 same-family on-policy distillation pairs on Qwen2.5 from 0.5B to 14B, finding peak capability is predictable from student scale and teacher score, and that weaker teachers can teach stronger students

    The study systematically characterizes the scaling properties of same-family on-policy distillation (OPD) on Qwen2.5 (0.5B–14B) math reasoning, finding a regular early useful-transfer regime in which held-out accuracy rises approximately linearly with the square root of token-level reverse KL from the student initialization, and fitting power laws in student scale, teacher scale, and teacher gold score that predict peak accuracy and transfer rate, with every weak-to-strong student peaking above its own teacher.

  4. arXiv

    Dynamic Adaptation of the LLM Context for Generating Routines with Coupled Semantics

    The work proposes dynamic context adaptation: a validation-generation loop in which a validation agent extracts structured diagnostic feedback from execution traces, a generation agent proposes multiple candidates per iteration, a knowledge graph supplies semantic constraints, and simulated annealing performs non-greedy selection, targeting the LLM code-generation limitation the authors call static binding; across eight problems the method outperforms zero-shot, Reflexion, and OpenEvolve on seven of eight problems at both 300 and 600 evaluations (p < 0.01), achieves the best score at 1000 evaluations on the primary motivating problem of cross-coupled optimization (0.694 vs. 0.681, p = 0.019, d = 0.52), and ablations identify structured execution feedback as the primary driver.

You’re all caught up