[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-memory-framework-lets-ai-agents-track-decisions-over-time":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},9774,"new-memory-framework-lets-ai-agents-track-decisions-over-time","New Memory Framework Lets AI Agents Track Decisions Over Time","A new research framework stores whole documents instead of summarizing them, so AI agents can answer questions based on what was true at the time asked.","Researchers have built an AI memory system that refuses to forget anything, and that's the point.\n\nThe framework, called Mem++, targets a specific problem in organizational AI agents: tracking decisions that get revised across months of documents. Most memory systems compress each new document into facts or graph edges the moment it's written, which locks in what questions can later be answered. Mem++ instead stores every document whole, tagged with its date and author, and skips calling a generative model at write time. When a question arrives, it pulls only the documents dated up to that point and blends keyword and semantic search to decide which ones answer it.\n\nThat shift from write-time summarizing to read-time selection sounds minor, but it solves a real failure mode: an agent that answers with an outdated decision because the system already threw away the context needed to know it was outdated. On the OrgMemBench benchmark, Mem++ beat the best baseline memory system by 8.0 to 13.1 points across two different answering models, and edged out plain retrieval-augmented generation by 2.6 points when paired with gpt-4.1-mini.\n\nThe results aren't a clean sweep: Mem++ placed second on LongMemEval-S, trailing its own entity-graph variant, a reminder that hoarding documents and sorting them out at query time doesn't win every argument.","[\"ai-agents\",\"llm-memory\",\"rag\",\"ai-research\"]","2026-10-02T04:00:00.000Z","2026-10-03T09:57:35.290Z","2026-10-03T09:57:40.927Z","published",null,[],"ai",[26,27,28,29],"ai-agents","llm-memory","rag","ai-research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2610.02002",0,{"sections":36},[37,40,44,48,53,57,61,66,71,76,81,86,91,96],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",6041,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",848,{"name":45,"slug":46,"count":47,"latest_published_at":18},"Policy","policy",439,{"name":49,"slug":50,"count":51,"latest_published_at":52},"Deals","deals",317,"2026-10-01T22:00:00.000Z",{"name":54,"slug":55,"count":56,"latest_published_at":18},"Hardware","hardware",199,{"name":58,"slug":59,"count":60,"latest_published_at":18},"Science","science",176,{"name":62,"slug":63,"count":64,"latest_published_at":65},"Consumer Tech","consumer-tech",155,"2026-10-01T19:54:10.000Z",{"name":67,"slug":68,"count":69,"latest_published_at":70},"Dev Tools","dev-tools",96,"2026-10-01T16:57:03.000Z",{"name":72,"slug":73,"count":74,"latest_published_at":75},"Software","software",93,"2026-09-30T21:41:11.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":80},"Startups","startups",90,"2026-10-01T21:55:22.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"Gaming","gaming",53,"2026-10-02T02:50:39.000Z",{"name":87,"slug":88,"count":89,"latest_published_at":90},"General","general",50,"2026-09-30T21:37:54.000Z",{"name":92,"slug":93,"count":94,"latest_published_at":95},"Reviews","reviews",31,"2026-09-28T14:31:34.000Z",{"name":97,"slug":98,"count":99,"latest_published_at":100},"How-To","how-to",7,"2026-10-01T09:00:00.000Z"]