AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers introduce DEAR, a novel on-policy distillation method that improves AI model training by distinguishing between decision tokens (where models branch) and evidence tokens (supporting intermediate steps). The technique achieves significant performance gains of up to 5.7% on code generation and 2.5% on math benchmarks compared to standard distillation approaches.
AIBullisharXiv – CS AI · Jun 47/10
🧠Researchers introduce Speculative Thinking, a training-free framework that leverages larger AI models to guide smaller ones during inference, improving reasoning accuracy while reducing output length. The method achieves a 6.2% accuracy boost on mathematical reasoning tasks for a 1.5B parameter model with 15.7% shorter outputs, demonstrating efficiency gains without costly retraining.
AIBullisharXiv – CS AI · May 117/10
🧠Researchers propose Adaptive Negative Sample Reinforcement (A-NSR) and Confidence-Weighted Negative Reinforcement (CW-NSR) to improve LLM reasoning by dynamically adjusting penalty weights during training rather than applying fixed penalties. The methods are evaluated on challenging math datasets using Qwen2.5-Math-1.5B, demonstrating that intelligent error correction can match or exceed complex frameworks like PPO.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers identify a critical blind spot in pass@k, the standard metric for evaluating math reasoning difficulty in large language models. Their analysis reveals that 10-23% of problems marked as unsolvable through sampling can actually be solved using deterministic inference with activation grafting perturbations, suggesting current difficulty assessments systematically underestimate model capabilities.
AIBullisharXiv – CS AI · Jun 116/10
🧠Researchers present SWARR, a two-stage method combining supervised fine-tuning and reinforcement learning to make sliding-window attention (SWA) competitive with standard self-attention for mathematical reasoning tasks. By using RL to adapt model trajectories to SWA's architectural constraints, the approach recovers much of the accuracy lost during conversion while maintaining linear-complexity efficiency benefits.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose a Bayesian stopping strategy that reduces LLM inference costs by up to 50% while maintaining answer accuracy. The method samples multiple LLM responses and stops once sufficient consistency is detected, using an efficient L-aggregated policy that tracks only the top 3 answer frequencies and achieves theoretical optimality.
AINeutralarXiv – CS AI · May 286/10
🧠IRDS introduces a new data selection method for reinforcement learning with verifiable rewards (RLVR) that uses sparse autoencoders to identify interpretable, high-value training instances. The approach achieves significant accuracy improvements on math reasoning benchmarks while reducing computational costs by an order of magnitude compared to existing methods.
🧠 Llama
AINeutralHugging Face Blog · Dec 43/109
🧠The article appears to be incomplete or missing content, with only a title mentioning DeepMath as a lightweight math reasoning agent built with smolagents. Without the full article body, specific details about capabilities, performance, or implementation cannot be analyzed.
