Fetching from the wire…
Research2026-07-18 · source-backed
arXiv 2607.15217 replaces synchronous layer-by-layer processing with delay-mediated asynchronous propagation through a shared neuron pool, co-evolving topology, weights, delays, and connectivity via a genetic algorithm across a 14,602-gene genome. 204 active paths through 266 hidden neurons, 156 shared, one neuron participating in 11 paths. 85.9% on MNIST features, which is bad. The task is easy and the accuracy is modest, so read this as architecture exploration, not a performance claim. The interesting parts are per-sample adaptive compute depth and the 115 KB model size.
Each link below shares sources, entities, or timing with this story.
Most adversarial work on continual learning targets catastrophic forgetting. This paper attacks plasticity instead: "learning blockers" are manipulated data that reduce the learnability of *upcoming* training iterations, which makes them nearly undetectable during the current...
SpecPath found 35 of 100 passing implementations broke when only the revision path changed, with aggregate accuracy looking identical across paths. Build your eval set from real multi-turn clarification threads with amendments and reversals. Path sensitivity is invisible to st...
Nearly all cache-compaction research assumes a static context where future queries are known offline, which agents never have. Comparing token eviction against attention matching across proxy-query sources on BrowseComp-Plus and WideSearch, compacting a turn immediately often...
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...
A June 26 paper (arXiv:2606.26294) describes a self-improving architecture where the agent and the evaluator that scores it evolve together, specifically to avoid the stagnation of optimizing against a fixed, gameable reward. (arXiv) Anyone building a self-improving harness ha...
Agent-Orchestrated Adaptive RAG (arXiv:2606.05658) finds agentic enhancements are not universally beneficial. Dynamic query decomposition gained +0.17 MRR on a structured DevOps benchmark but degraded ranking precision on a multi-hop benchmark, and the self-reflective loop onl...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.