Fetching from the wire…
Public story · 2026-07-21 · high
The arXiv abstract skips headline numbers, so how much memory and compute it actually saves isn't disclosed.
Why now: It surfaced in the July 21 research coverage before any independent benchmark of its reported savings has appeared.
SelectInfer skips loading every neuron in a model. An offline profiler flags which ones a given task actually needs, per its arXiv preprint.
That matters for anyone running large models on constrained hardware, where loading fewer neurons per query should cut memory and compute costs. The abstract doesn't publish the size of that reduction.
The setup runs in two stages. An offline profiler separates neurons into task-specific and general-purpose groups ahead of time. At runtime, the model evaluates only the neurons tied to the current task instead of the full network, per the paper.
No retraining or fine-tuning is required. That's the detail that matters most, since most efficiency papers ask for a fine-tuning pass before showing any benefit. SelectInfer claims to work on top of an existing model as-is.
The no-finetune design is the real news here. It lets anyone with a local quantized model test the claim directly, instead of waiting on the abstract's word for it. Watch for whether someone runs it against an open-weight model and publishes real numbers.
It surfaced in the July 21 research coverage before any independent benchmark of its reported savings has appeared.
Each link below shares sources, entities, or timing with this story.
Luan et al. asked whether existing multi-agent repair methods fix causes or just exploit sampling randomness, and built SymTrace, a replay framework that reconstructs execution up to an intervention anchor from recorded logs and regenerates only the downstream trajectory (arXi...
Ockhamareto (arXiv 2608.24473) reinforces a unit-test rollout only when it's non-dominated on both mutation-killing and test count, then ties each test's killing power back to specific source tokens. Against MIST-RL that's a 3.4x better per-test trade-off, plus 30 to 35 percen...
It pairs hierarchical LLM planning with Bayesian partner tracking and interrupts only on direct contradiction, reducing what the authors call the belief-action gap (holding an accurate partner model while acting against it) with roughly an order of magnitude fewer replans than...
WebMASLab holds task, tools, and browser fixed and varies only architecture. The Telephone Loop attack exploits cross-agent delegation to create cyclical task loops, averaging 80% success with 0% detection against multi-agent versions of Claude Sonnet 4.5, GPT-5.2, and GPT-5.4...
arXiv 2607.12227 (Wang et al., incl. Hajishirzi, Tsvetkov, Dasigi) finds two methodological holes in the self-improving-agent literature: methods are never compared against simpler baselines at matched compute budgets, and final performance gets reported on the same public ben...
arXiv 2607.14530 gets Hyper-Connections past the N=4 wall by sparsely updating only k=4 streams plus temporal feature augmentation, scoring 4.0 points higher on average downstream than prior mHC on an 18B MoE. Vanilla and mHC need 1.50x and 1.19x xHC's compute to hit the same...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.