y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#post-training News & Analysis

69 articles tagged with #post-training. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

69 articles
AINeutralarXiv – CS AI · Mar 47/103
🧠

Spectrum Tuning: Post-Training for Distributional Coverage and In-Context Steerability

Researchers introduce Spectrum Tuning, a new post-training method that improves AI language models' ability to generate diverse outputs and follow in-context steering instructions. The technique addresses limitations in current post-training approaches that reduce models' distributional coverage and flexibility when tasks require multiple valid answers rather than single correct responses.

AIBullisharXiv – CS AI · Mar 47/103
🧠

Param$\Delta$ for Direct Weight Mixing: Post-Train Large Language Model at Zero Cost

Researchers introduce Param∆, a novel method for transferring post-training capabilities to updated language models without additional training costs. The technique achieves 95% performance of traditional post-training by computing weight differences between base and post-trained models, offering significant cost savings for AI model development.

AIBullisharXiv – CS AI · Feb 277/109
🧠

Sparse Attention Post-Training for Mechanistic Interpretability

Researchers have developed a post-training method that makes transformer attention 99.6% sparser while maintaining performance, reducing attention connectivity to just 0.4% of edges in models up to 7B parameters. This breakthrough demonstrates that most transformer computation is redundant and enables more interpretable AI models through simplified circuit structures.

AIBullishSynced Review · Apr 247/105
🧠

Can GRPO be 10x Efficient? Kwai AI’s SRPO Suggests Yes with SRPO

Kwai AI has developed SRPO, a new reinforcement learning framework that reduces LLM post-training steps by 90% while achieving performance comparable to DeepSeek-R1 in mathematics and coding tasks. The two-stage approach with history resampling addresses efficiency limitations in existing GRPO methods.

AIBullisharXiv – CS AI · Jun 256/10
🧠

Supervised Post-training of Speech Foundation Models for Robust Adaptation in Speech Deepfake Detection

Researchers propose a supervised post-training method for speech foundation models that improves deepfake detection by addressing the mismatch between self-supervised learning objectives and spoof-detection requirements. The approach achieves state-of-the-art results on multiple benchmarks, demonstrating that targeted adaptation strategies can enhance AI model robustness for security applications.

AINeutralarXiv – CS AI · Jun 236/10
🧠

Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning

A comprehensive survey maps reinforcement learning algorithm design decisions across three stages—MDP creation, exploration strategies, and learning approaches—revealing significant research gaps in LLM training where value-based methods and off-policy techniques remain underexplored despite proven effectiveness in classical RL.

AIBullisharXiv – CS AI · Jun 196/10
🧠

Which Pairs to Compare for LLM Post-Training?

Researchers present a theoretical framework for optimizing which comparison pairs to label during large language model preference-based post-training, showing that strategic pair selection can significantly improve sample efficiency. By formulating the problem as a sampling-design challenge with bounds on policy performance, the work provides practical guidance for allocating limited labeling budgets when training models like those using Direct Preference Optimization.

AINeutralarXiv – CS AI · Jun 116/10
🧠

ProcessThinker: Enhancing Multi-modal Large Language Models Reasoning via Rollout-based Process Reward

ProcessThinker introduces a novel post-training method for multimodal large language models that provides step-level process rewards without requiring explicit reward model training. By using rollout-based sampling to verify intermediate reasoning steps, the approach improves visual question answering across multiple benchmarks while reducing computational overhead compared to traditional process reward models.

AINeutralarXiv – CS AI · Jun 106/10
🧠

When RL Fails after SFT: Rejuvenating Model Plasticity for Robust SFT-to-RL Handoff

Researchers identify a critical problem in LLM post-training where excessive Supervised Fine-Tuning (SFT) reduces model plasticity, limiting subsequent Reinforcement Learning (RL) effectiveness. They propose 'Rejuvenation,' a method combining base-anchored model fusion and targeted neuron reset to restore plasticity while preserving SFT knowledge, demonstrating improved RL performance on reasoning and agentic tasks.

AINeutralarXiv – CS AI · Jun 106/10
🧠

Provenance-Grounded Gating and Adaptive Recovery in Synthetic Post-Training Data Curation

Researchers present a controlled study on synthetic data curation for post-training large language models, examining whether filtering decisions are grounded in source evidence and whether rejected samples can be recovered. Their findings show that provenance-aware filtering improves faithfulness detection, different gate types catch different errors, and adaptive recovery strategies significantly improve overall yield compared to simple resampling.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Post-training is (Massive) Supervised Learning

A new arXiv paper argues that current LLM post-training methods (SFT and RL) function primarily as distribution-fitting mechanisms rather than developing general capabilities, reverting to pre-BERT era approaches. The authors demonstrate that randomly initialized models achieve non-trivial performance when fine-tuned on modern benchmarks, suggesting the field should shift toward training systems that learn how to learn rather than optimizing for specific tasks.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Training-Inference Kernel Contracts: Bounding Divergence in Post-Training and Deployment

Researchers propose 'kernel contracts,' a framework for managing divergence between training and inference implementations of AI models that operate at different precision levels. The work formalizes how finite-precision optimizations can produce different outputs at identical weights and provides mathematical bounds on resulting policy drift, with implications for reliable AI deployment.

AINeutralarXiv – CS AI · Jun 56/10
🧠

Cross-Epoch Adaptive Rollout Optimization for RL Post-Training

Researchers present CERO, a method for optimizing reinforcement learning post-training in large language models by dynamically allocating rollout budgets across prompts based on their training signal value. The approach uses Bayesian inference to estimate which prompts benefit most from additional computation, improving sample efficiency compared to fixed-budget methods.

AINeutralarXiv – CS AI · Jun 46/10
🧠

Rollout-Level Advantage-Prioritized Experience Replay for GRPO

Researchers propose a rollout-level advantage-prioritized experience replay system for GRPO (Group Relative Policy Optimization) that improves sample efficiency in LLM post-training. By storing individual rollouts with age-based eviction and prioritizing high-advantage samples, the method achieves 4.35 percentage point gains on math benchmarks while maintaining on-policy data freshness.

AINeutralarXiv – CS AI · Jun 26/10
🧠

"I've Seen How This Goes": Characterizing Diversity via Progressive Conditional Surprise

Researchers propose a novel metric called 'Decan' for measuring diversity in AI-generated creative outputs using in-context learning and language model probabilities, achieving 84.6% accuracy on benchmark tests. The approach detects mode collapse and diversity loss across training stages without requiring specialized embedding models or human annotation, offering a practical tool for evaluating generative AI systems.

AINeutralarXiv – CS AI · Jun 26/10
🧠

A Primer in Post-Training Reasoning Data: What We Know About How It Works

A comprehensive academic primer synthesizes over 150 studies on post-training reasoning data for large language models, organizing the field around four core questions: what data objects exist, what makes them useful, how they are constructed, and how they scale. This foundational work provides an attribution framework for future reasoning-data releases and post-training approaches in AI development.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Post-Training LLMs as Better Decision-Making Agents: A Regret-Minimization Approach

Researchers introduce Iterative Regret-Minimization Fine-Tuning (Iterative RMFT), a post-training method that improves LLMs' decision-making capabilities by iteratively distilling low-regret trajectories back into models. The approach addresses fundamental limitations in how LLMs handle online decision problems without relying on rigid algorithmic templates, demonstrating improvements across multiple model architectures.

🧠 GPT-4
AINeutralarXiv – CS AI · May 296/10
🧠

From Meta-Thought to Execution: Cognitively Aligned Post-Training for Generalizable and Reliable LLM Reasoning

Researchers propose a cognitively-inspired post-training framework for large language models that separates abstract reasoning from problem-specific execution, mirroring how humans actually think. The approach, combining Chain-of-Meta-Thought supervised learning with Confidence-Calibrated Reinforcement Learning, achieves 2-3% performance improvements across benchmarks while improving generalization and robustness.

AINeutralarXiv – CS AI · May 286/10
🧠

Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training

Researchers propose a taxonomy of chain-of-thought (CoT) reasoning in LLM post-training, distinguishing between explicit, composed, and implicit reasoning formats. The study reveals that compressed reasoning data requires different training approaches, with composed CoT benefiting from data scaling while implicit CoT risks memorization, and that reinforcement learning can decompose compressed steps learned during supervised fine-tuning.

AINeutralarXiv – CS AI · May 286/10
🧠

Quantifying Empirical Compute-Supervision Tradeoffs in RLVR

Researchers empirically tested whether increased compute can overcome imperfect verifier performance in reinforcement learning from verifiable rewards (RLVR), finding that verifier quality and training compute are not interchangeable. The study reveals that false negatives degrade model performance more severely than false positives, and compute scaling alone cannot close performance gaps caused by supervision noise.

AINeutralarXiv – CS AI · May 276/10
🧠

GAC: Noise-Aware Adaptive Mixing for Hybrid SFT-RL Post-Training

Researchers introduce GAC, a noise-aware adaptive controller that optimizes the mixing of supervised fine-tuning and reinforcement learning during AI model post-training. By dynamically adjusting mixing weights based on gradient variance and signal disagreement, GAC outperforms fixed schedules across math, code, science, and logic tasks with minimal computational overhead.

AIBullisharXiv – CS AI · May 276/10
🧠

Spend Your Rollouts Where It Counts: Rollout Allocation for Group-Based RL Post-Training

Researchers introduce Pilot-Commit, a new framework for optimizing reinforcement learning post-training of large language models by intelligently allocating computational budget to high-value prompts. The method achieves training speedups of 1.9x to 4.0x by identifying prompts with high reward variance where group-based updates are most effective, rather than uniformly distributing rollouts across all prompts.

AINeutralarXiv – CS AI · May 276/10
🧠

Reasoning Depth and Environment Complexity: A Controlled Study of RLVR Data Allocation across Logical Reasoning Tasks

Researchers conducted a controlled study on reinforcement learning with verifiable rewards (RLVR) for reasoning models, revealing that training data allocation across multiple reasoning dimensions—depth, environment complexity, and reasoning types—significantly impacts model performance. The study found that joint coverage of these dimensions outperforms single-axis training approaches, and that models exhibit systematic weaknesses in abductive reasoning regardless of training setup.

AINeutralarXiv – CS AI · May 126/10
🧠

On Distinguishing Capability Elicitation from Capability Creation in Post-Training: A Free-Energy Perspective

Researchers propose distinguishing between capability elicitation and capability creation in large language model post-training, arguing that the SFT vs. RL debate oversimplifies how models improve. The framework suggests post-training either reweights existing behaviors or expands what models can practically achieve, with significant implications for how AI development is understood and evaluated.

← PrevPage 2 of 3Next →