Andrew Ng’s graph-based agent design claims a 90% efficiency gain
Roger_M_Taylor · x · 2026-07-22
A thread claims Andrew Ng built an agentic knowledge graph that improved agent efficiency by 90% by replacing ad-hoc tool search with graph-based retrieval.
Core idea
- Embed every tool and search by meaning, not just keywords.
- Because semantic similarity is not the same as correctness, represent tools as a graph.
- Retrieve the full path needed for a task, not just one tool.
- Turn the process into data so the sequence becomes explicit and reusable.
The post frames this as a practical, one-hour course on graph engineering for multi-step agents.
More from coding & agent
- AI agents raise a new payment question: cards, bank transfers, or stablecoins? — sweetheartcheek · 2026-07-22
- Codex with img2threejs beat Blender MCP in a quick 3D workflow test — Dimillian · 2026-07-22
- Claude Code task planning plus subagents cuts token costs, user says — toptickcrypto · 2026-07-22
- Image MCP Server brings OpenAI and Replicate image generation into agent workflows — modelcontextprotocol · 2026-07-22
- agentdata-mcp exposes crypto prices, yields, and arbitrage tools to AI agents — modelcontextprotocol · 2026-07-22
- Kingsoft Office’s Lingxi Pro turns 100,000 words of notes into a knowledge base and PPT — 量子位 · 2026-07-22