[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-why-ai-agents-cannot-get-by-on-short-term-memory":10,"sections":34},{"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":29,"feedback":33,"feedback_at":22,"cost_usd":33,"total_tokens":33},1635,"why-ai-agents-cannot-get-by-on-short-term-memory","Why AI Agents Cannot Get By on Short-Term Memory","A new formal proof shows that agents handling multiple environments must store domain-specific history — or they will inevitably make wrong calls.","Researchers have a theorem that explains why truly general AI agents cannot wing it with only what they can see right now.\n\nA paper posted to arXiv argues, through formal proof, that any agent operating across multiple environments will hit a fundamental wall if it relies solely on current observations. The core finding: when two domains look similar at some observation point but require different optimal actions, a capable agent must maintain distinct memory states for each domain at that point. The paper calls this a \"separation theorem\" — uniform near-optimality across environments is simply impossible without domain-relevant memory. It goes further: if an agent stores enough information to estimate goal-related values, that same memory is sufficient to approximately reconstruct the local dynamics of how its environment transitions.\n\nThis matters because it reframes memory not as a nice-to-have engineering feature but as a theoretical necessity. The implications cut across the current wave of long-context models and agent frameworks: raw context windows are not the same as structured, domain-tagged memory, and conflating the two may explain why multi-task agents still stumble when environments superficially resemble each other.\n\nThe AI field has spent years debating how much context a model needs; this paper suggests the more pressing question is what *kind* of information gets preserved and indexed — not just how many tokens fit in a window.","[\"ai\",\"research\",\"agents\",\"memory\"]","2026-06-18T04:00:00.000Z","2026-06-19T08:44:25.017Z","2026-06-19T14:20:57.514Z","published",null,[],"ai",[24,26,27,28],"research","agents","memory",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2606.18746",0,{"sections":35},[36,40,44,49,54,59,64,68,72,76,81,86,91,96],{"name":37,"slug":24,"count":38,"latest_published_at":39},"AI",490,"2026-06-19T04:00:00.000Z",{"name":41,"slug":42,"count":43,"latest_published_at":39},"Security","security",132,{"name":45,"slug":46,"count":47,"latest_published_at":48},"Policy","policy",88,"2026-06-16T09:26:09.000Z",{"name":50,"slug":51,"count":52,"latest_published_at":53},"Consumer Tech","consumer-tech",78,"2026-06-16T17:58:24.000Z",{"name":55,"slug":56,"count":57,"latest_published_at":58},"Hardware","hardware",62,"2026-06-18T15:24:16.000Z",{"name":60,"slug":61,"count":62,"latest_published_at":63},"Deals","deals",58,"2026-06-19T14:43:50.000Z",{"name":65,"slug":66,"count":62,"latest_published_at":67},"Software","software","2026-06-16T20:00:00.000Z",{"name":69,"slug":70,"count":71,"latest_published_at":39},"Dev Tools","dev-tools",50,{"name":73,"slug":74,"count":75,"latest_published_at":18},"Science","science",38,{"name":77,"slug":78,"count":79,"latest_published_at":80},"Gaming","gaming",31,"2026-06-16T15:25:13.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"General","general",26,"2026-06-13T18:35:15.000Z",{"name":87,"slug":88,"count":89,"latest_published_at":90},"Startups","startups",23,"2026-06-16T15:00:00.000Z",{"name":92,"slug":93,"count":94,"latest_published_at":95},"Reviews","reviews",19,"2026-06-14T08:00:00.000Z",{"name":97,"slug":98,"count":99,"latest_published_at":100},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]