Show Notes
Researchers introduce TailSFT, a modified supervised fine-tuning algorithm designed to better prepare language models for subsequent reinforcement learning. Unlike standard fine-tuning that minimizes overall cross-entropy, TailSFT filters out sequences that the model has already mastered to focus training on the under-modeled "tail" of the data distribution. This approach prioritizes coverage, ensuring the model retains a diverse range of correct responses that reinforcement learning can later identify and amplify. Theoretical analysis and experiments on the OLMo-3 7B model demonstrate that TailSFT significantly boosts performance in math and coding tasks, particularly by improving pass@K metrics. Ultimately, the authors show that a higher-coverage initialization leads to faster learning and superior final accuracy after reinforcement learning. This work advocates for a stage-aware approach to AI development, where intermediate training phases are optimized specifically to benefit the next stage of the pipeline.
More from Best AI papers explained
Automated research agents powered by large language models often experience performance plateaus during open-ended discovery tasks as their accumulated history makes their edits overly conservative. To overcome this limitation, researchers introduce a novel strategy called forgetting, which periodically discards previous agent sessions and candidate search histories while retaining only the single best solution found so far. When combined with a collaborative multi-agent team setup that allows asynchronous communication, this reset mechanism clears out unproductive contextual baggage and unblocks fresh exploration. Experimental evaluations across diverse domains—including heuristic programming, algorithm design, kernel optimization, and machine learning training—demonstrate that teams utilizing forgetting consistently outperform single-agent baselines and parallel configurations. Ultimately, the findings emphasize that managing what an automated discovery agent is allowed to remember is just as critical to its overall success as the amount of computational resources provided.
AI-driven scientific discovery increasingly relies on automated verification to evaluate candidate solutions, but the scarcity of reliable automated metrics makes human expert review essential for validating complex research. Because generating candidate solutions often outpaces human review capacity, OSVERIFY introduces an innovative algorithmic framework that separates verification into hierarchical error proposal and error validation to maximize the rejection of invalid solutions while preserving rare valid ones. Experiments across mathematical benchmarks demonstrate that this approach significantly reduces human review workload compared to standard voting baselines while maintaining strict false-rejection constraints. Furthermore, the application of OSVERIFY to real-world research successfully identifies subtle mistakes in published papers and helps resolve open conjectures in the Langlands program. Ultimately, this methodology facilitates human-AI research collaboration by providing a structured, scalable solution to the verification bottleneck in open-ended scientific domains.
This paper introduces a scalable algorithm called Skills Estimate Empowerment (SEE) that bridges unsupervised skill learning and empowerment maximization to train intelligent agents in complex, open-ended environments. By treating mutual information skill learning as a lower bound for potential empowerment, the method utilizes a two-stage policy where a potential policy navigates toward controllable states while effective skill policies explore local options. Through experiments in challenging settings such as Craftax-Classic, AntSoccer, and BuilderBench, the authors demonstrate that this approach successfully overcomes previous computational limitations. Consequently, the trained agents exhibit emergent behaviors like resource gathering, tool crafting, environmental modification, and survival without relying on external rewards.
This paper introduces HybridAgents, a novel framework that blends continuous latent reasoning with explicit text interactions within a unified generation framework. By utilizing a lightweight adapter called HybridLink, the system seamlessly transitions between internal thinking modes and external tool usage without losing crucial context. The model leverages continuous working memory to maintain multi-turn hybrid generation, effectively eliminating the need for traditional token-space reconstruction across different conversational steps. Furthermore, specialized post-training protocols involving Hybrid Supervised Fine-Tuning and Hybrid Reinforcement Learning stabilize generation and scale reasoning capabilities. Extensive empirical evaluations demonstrate that this architecture significantly outperforms standard language models, achieving superior accuracy while concurrently reducing inference latency, token consumption, and computational overhead.
This research demonstrates that unfaithful large language model service providers can artificially inflate the number of reasoning paths generated during test-time compute to overcharge users. By utilizing a specific algorithm to generate and strategically reorder extra paths, a provider can make every reported output appear necessary under adaptive stopping rules. Furthermore, the authors show that this manipulation enables providers to successfully evade exact likelihood-ratio audits. Experiments across multiple open and distilled model families reveal that these additional reasoning paths follow a heavy-tailed distribution, meaning substantial overcharging remains possible even under strict auditing constraints.