WikiTrace links agent lessons to trajectories to cut memory errors
Agents can descend from insights to trajectory summaries and raw traces before acting when lessons conflict or lack detail.
35 stories, newest first · one card per story
Agents can descend from insights to trajectory summaries and raw traces before acting when lessons conflict or lack detail.
The post argues for a community-agreed memory format for AI agents modeled after OpenTelemetry's success in observability.

Anthropic outlines agent memory components including memory notes, dreaming during idle time, and learning loops using Claude models on benchmarks.
In 150 sessions no run passed; agents surfaced only 54-64% of untold details, and experts blamed them for 88.33% of failures.
Matched-bit tests beat SimHash on neighbor quality, but HNSW is smaller and faster at ordinary scale.
On MiniGrid Memory, a five-token traversal head reached 0.95 mean return after 0.59M steps, ahead of absolute addressing.
MemSteer-Opt lifts ATM-Bench Question Score by 13.4 points over Base-BM25 without changing model weights.
Nested social posts make victim agents treat an attacker's preferences as the user's, steering tools and leaking data.
On LoCoMo and MemGallery, authors report macro-F1 gains of 2.23–3.14 points and fewer context tokens than compared memory systems.
The authors split memory's net value into gains over raw-history retrieval and losses they call memory tax.
On Trojan Hippo, the authors report zero attack success when self-verification and lightweight verifiers confirm memory.
On five frontier models, planted payloads showed no measurable decay over five rounds once planting succeeded.
The best of eight memory methods scored 33.61% macro accuracy on Qwen3-235B-A22B and GLM-5.3-Flash across four domains.
On 22 benchmarks, average scores rise 9.7–12.6 points over matched no-tool baselines across eight backbones.
Anti-Persistence rebuilds task guidance on demand and discards it, with the lowest average LLM-call cost tested.
MemCompile compiles query-conditioned evidence for long-term agent memory, reaching 80.52% judge accuracy on LoCoMo.
On MPBench and LoCoMo, attack success was at least 77% below the strongest utility-preserving defense.
Against a full-context DeepSeek-V4-Flash baseline, authors report higher pass rates and about 40% fewer tokens.
RunningTab uses an environment-side task tab so LLM agents finish workspace work more reliably.
A benchmark finds LLMs can store records in telegraph-style cablese, cutting tokens by up to 49 percent without hurting later answers.
DAEDALUS bootstraps reusable agent memory from self-generated practice, lifting success by up to 15.9 points.
MemPilot uses an RL policy to curate multimodal agent memory on demand, trading off accuracy, cost, and latency.
PrisMem evolves agent memory by capability and beats baselines on long-history benchmarks.
A reinforcement-learned policy chooses retrieval or query-specific curation under competing performance, cost, and latency goals.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views