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.
This Nature paper discusses Byteification, which offers a novel method to convert traditional subword-based large language models into efficient byte-level models that handle raw text encodings natively. By introducing a two-stage training procedure and a latent tokenizer architecture with non-causal boundary prediction, researchers can bypass the limitations of traditional tokenization—such as English-centric biases and poor character understanding—while preserving the core capabilities of established models. These byteified models achieve competitive performance on par with state-of-the-art systems while enabling high-throughput scientific applications and efficient task arithmetic post-training. Ultimately, this approach removes long-standing performance barriers and significantly reduces the computational investments typically required to build byte-level language models.
This paper introduces Priced Guidance, a novel evaluation framework that assesses language models on their ability to generate novel and future research ideas. Rather than using expensive repeated sampling or verbatim text compression, this methodology measures the compression cost—the exact number of additional bits required for an informed guide to steer a generator model toward a target research concept. By leveraging a structured sequence of multiple-choice questions and probabilistic bids, the framework establishes a mathematical lower bound connecting low compression costs to a high probability of unguided idea generation. Empirical evaluations across multiple frontier language models and deep learning papers demonstrate that generating the essence of an idea requires significantly fewer bits than verbatim text compression, highlighting distinct performance tiers among models and revealing potential improvements through ensembling and post-training.
This paper introduce Context Language Models (CLMs), a novel approach that enables language models to natively manage their own context by treating it as an editable file rather than relying on traditional append-only histories or external harnesses. By granting models unrestricted read and write access to their context, CLMs achieve superior performance and greater efficiency across long-horizon coding, deep research, and open discovery tasks. The literature demonstrates that these models can be further enhanced through in-context learning, natural-language steering, and online reinforcement learning with success-gated efficiency rewards. To address the computational challenges of frequent context edits, the authors propose Suffix Cache Reuse (SCR), an advanced serving optimization that reuses cached states for surviving suffix tokens to significantly reduce server-side compute. Ultimately, this paradigm shift from external harness control to intrinsic model behavior unlocks more adaptive, creative, and resource-efficient context-management strategies.