Fetching from the wire…
Research2026-08-02 · source-backed
arXiv 2607.27919 argues long-term memory should be a separately scalable parametric module rather than entangled with reasoning in one weight set, backed by distributed Faiss indexing and sparse batch-wise loading of kNN distributions. The 410M+6.9B pairing lifts the 17-benchmark average from 29.86 to 37.34, edging past Pythia-12B's 37.24. Adding a 1.7B domain memory to Qwen3 models from 0.6B to 14B gains over 9 points across three domains at every scale. Unlike RAG, the memory is parametric: no retrieval hop at inference.
Each link below shares sources, entities, or timing with this story.
A controlled study ran five Qwen models over eight cases against a DWSIM simulator, 120 slots per arm, with one instruction as the only difference: request a fresh simulation after a substantive modification. No hard gate. Re-verification happened in 94 of 120 guided slots aga...
A stage-wise study of self-refinement across 5 benchmarks with 6 sizes of Qwen3 and 4 sizes of Gemma 3 found larger generators and refiners generally improve the pipeline, and an undersized refiner can actively hurt, but results are highly insensitive to critic size. Including...
A 400-problem framework built by injecting AST-level corruptions into BigCodeBench reference solutions, so every repair task has a known minimal patch. Adding a preservation instruction lowered average excess Levenshtein distance from 0.195 to 0.131, cut added cognitive comple...
SEPO argues API-only prompt optimizers are inspectable only after the fact, since each iteration rewrites the prompt as one opaque string. Instead it edits stable typed units in a two-layer schema, links each edit to the examples it newly fixes or breaks, and carries that line...
Activation-Weighted Seeded Residual Coding encodes the residual between true and quantized weights using deterministic seed-generated bases, storing seed selectors, low-bit coefficients and scales instead of an explicit codebook, with activation statistics prioritizing the err...
arXiv 2608.03463 sorts dialogue by compressibility, temporal dynamics, and fidelity requirement, storing informative segments as compact profile memory, temporally structured event memory, or source-grounded record memory, then updating only the evolving event memories during...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.