Andrew Ng memo argues agent memory needs graphs, not bigger context windows
solyarisoftware · x · 2026-07-27
Andrew Ng’s new 15-page memo lays out a 4-step shift from loops to graphs for agent memory.
- The core argument: bigger context windows do not solve memory; they only delay forgetting until the next session.
- Instead of RAG over static documents, agents need a temporal knowledge graph that merges chat history and structured business data into one queryable layer.
- The key design choice is bi-temporal data: each fact keeps both the time it happened and the time the system learned it, so nothing is overwritten.
- Contradictions are invalidated, not deleted, which preserves answers like “who owned this in April” months later.
- The post also points to the paper’s benchmark results, including a claim that the system beats MemGPT on Deep Memory Retrieval.
The attached paper image shows the title “Zep: A Temporal Knowledge Graph Architecture for Agent Memory”, reinforcing that this is a concrete memory-stack proposal, not a high-level concept post.
Related event: Andrew Ng Advocates Graph-Based Memory for AI Agents(2 posts)→
More from coding & agent
- Dev turns DJI Mavic into local AI security drone built with Opus 5.5 — alexcovo_eth · 2026-10-27
- Microsoft Research: ForkPilot cuts long-horizon agent compute by up to 59% — EliasEskin · 2026-10-27
- Cursor launches Agent SDK: agents as code with Markdown prompts and TypeScript tools — soleio · 2026-10-27
- Vibecheck, the 'usable formal methods' hackathon, sells out two floors in SF — spikedoanz · 2026-10-27
- How do you verify AI agent outputs beyond unit tests and LLM-as-judge? — Practical_Green5775 · 2026-10-27
- AI agents may soon become the only way to run code, not just write it — IgorCarron · 2026-10-27