Papers for

large-scale ai developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Prefilling-dLLM v2 speeds up long-context language model decoding

Prefilling-dLLM v2: Learned Chunk Routing for Long-Context Diffusion Language Models

Abstract: Diffusion language models apply bidirectional attention over the whole context at every denoising step, so a longer context makes each step substantially more expensive. Sparsifying only at inference leaves the pretrained weights unchanged, so the model is never trained under the sparse pattern it runs with. We propose Prefilling-dLLM v2, which continues training a diffusion language model so that it routes with its native mask token. One mask is appended at the end of each chunk, and a learned role offset marks it as a routing slot. On every fourth layer, a query keeps a bidirectional local window and the top-K chunks scored from that mask; the other layers use a bidirectional sliding window. Starting from Dream-v0-Base-7B extended to 16K with YaRN, we compare Prefilling-dLLM v2 with bidirectional NSA, DSA, and SWA under the same layout, key budget, and dense initialization, using the same Fast-dLLM decoder. With the YaRN factor scaled to the evaluation length, Prefilling-dLLM v2 leads the other sparse methods on all three RULER tasks from 16K to 128K. Its mean accuracy at 128K is 7.4 points above NSA, the next sparse model, while DSA and SWA remain near zero. At the same length, decoding is 172x faster than with full dense attention.

Tue 13 OctComputation and Language
The gist
Long-context language models can understand very long texts, but the process slows down a lot as the text gets longer. The authors propose Prefilling-dLLM v2, a way to train the model so it learns how to focus only on the most important parts efficiently. This method lets the model handle much longer content quickly without losing accuracy. Tests show it is much faster and more accurate than other similar approaches when dealing with very long documents.
Open → 2610.17868v1

Orbit compresses large language model embeddings with learned geometry

OrBIT: Structure-Guided Embedding Compression

Abstract: Embedding tables are among the largest components of modern language models. Most compression methods fix a coding geometry such as coordinate blocks, low-rank subspaces, or unrestricted codebooks, and optimize within it. We instead ask whether the coding geometry can itself be discovered. We introduce \emph{OrBIT}, a structure-guided embedding compression framework that learns reusable local geometry from orbit dynamics and uses it to constrain a small set of shared codewords. The global reconstruction residual then decides where the fixed coding budget is spent, while redundant overlapping charts let local errors compensate one another after gluing. Our theory shows how tight-chart geometry controls distortion, how the global residual directs sequential allocation, and how data-geometry-guided refinement improves the codec. The resulting orbit machinery is compiled away, leaving a compact decoder in which the learned structure governs what is stored, where capacity is allocated, and how local information is assembled globally. Across four LLM embedding tables, OrBIT achieves $37.9\times$ compression on GPT-2 and over $23\times$ on each 7B table relative to 16-bit storage, while delivering competitive rate-distortion performance against established quantization and low-rank baselines.

Wed 7 OctMachine Learning
The gist
Large language models use tables of numbers called embeddings that take up a lot of space. This paper introduces OrBIT, a method that learns special geometric patterns in these tables to compress them more efficiently. Unlike previous methods that fix a certain compression style, OrBIT discovers and uses reusable local structures to store the data compactly. The authors show that this approach can reduce the size of embedding tables by over 20 times while keeping their quality nearly as good as less compressed versions.
Open → 2610.10385v1

Hierarchical organization boosts teamwork in embodied AI tasks

ORCH: Organizational Principles Enable Collective Intelligence in Embodied AI

Abstract: Collective intelligence depends not only on the capabilities of individual members, but also on how those members are organized. Yet artificial multi-agent systems are typically assembled using fixed organizational structures, even when the physical tasks they perform impose fundamentally different coordination requirements. Here we show that principles from human organization theory can be operationalized to organize large, heterogeneous collectives of embodied artificial agents. We introduce ORCH (Organizing Roles and Coordination Hierarchies), which constructs task-specific hierarchical organizations by combining pooled interdependence for work that can proceed concurrently with sequential interdependence for work governed by prerequisite relationships. Across 25 wildfire-response missions spanning reconnaissance, rescue, transportation, resource management, containment and suppression, we evaluated teams of up to 50 heterogeneous agents using eight large language models. Organizations constructed using these principles consistently outperformed four representative embodied multi-agent approaches across mission outcome, execution efficiency, exploration and computational resource use. Human-designed ORCH organizations improved final score by 63.97% and execution efficiency by 74.29% on average relative to the four prior frameworks. Organizations generated automatically by language models improved these measures by 43.63% and 52.53%, respectively. These advantages persisted across missions and underlying language models. Notably, collective performance was not monotonically determined by model scale. Analysis of long-horizon missions showed that hierarchical organization enabled teams to preserve concurrent activity within specialized groups while coordinating ordered transitions between mission phases.

Thu 10 SeptMultiagent SystemsArtificial IntelligenceMachine Learning
The gist
How a group of robots or agents works together depends not just on their individual abilities but also on how they are organized. The authors introduced ORCH, a method that organizes groups of different robots into hierarchies suited to the task, mixing work that can be done at the same time with steps that must happen in order. Testing on wildfire-response missions showed ORCH led teams of up to 50 agents to perform better and more efficiently than other common coordination methods. This approach worked well using different AI language models and helped teams manage complex tasks by keeping specialized groups active while coordinating overall mission phases.
Open → 2609.11737v1