[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-framework-retrieves-the-right-memory-for-ai-bug-fixes":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},6888,"new-framework-retrieves-the-right-memory-for-ai-bug-fixes","New Framework Retrieves the Right Memory for AI Bug Fixes","A new framework routes AI code-repair memories by repo, quality, and stage, showing more data doesn't mean better bug fixes.","AI systems that fix code by reusing memories of past repairs turn out to have a curation problem, not a storage problem.\n\nResearchers analyzing repository-level program repair found that memory-augmented systems accumulate experience unevenly: some repositories are data-rich, others barely covered. Piling on more memories does not reliably improve repair success, and the experiences that do exist often skew toward one repair phase, like reproducing a bug, while patch generation and refinement go under-served. To fix this, the team built a framework that falls back to cross-repository or repair-type memories when local data is thin, ranks memories by relevance and redundancy rather than volume, and routes retrieval separately for each repair stage: reproduction, localization, patching, refinement, and validation. Tested on SWE-Bench-Lite and SWE-Bench-Verified, it improved results on under-covered repositories and cut down on noisy retrieval.\n\nThis matters because most memory-augmented AI pitches, in coding and elsewhere, assume bigger context and more logged experience automatically means better output. This work argues the opposite: relevance and redundancy control matter more than raw volume, and mismatched retrieval actively hurt performance on some repositories.\n\nIt is a small, unglamorous fix, but it points at a real limit on the add-more-memory approach that a lot of agentic-coding tools are betting on.","[\"ai\",\"program-repair\",\"llm-memory\",\"swe-bench\"]","2026-09-18T04:00:00.000Z","2026-09-18T21:14:01.904Z","2026-09-18T21:14:13.809Z","published",null,[],"ai",[24,26,27,28],"program-repair","llm-memory","swe-bench",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.20130",0,{"sections":35},[36,39,43,48,53,57,61,66,70,75,80,85,90,95],{"name":37,"slug":24,"count":38,"latest_published_at":18},"AI",4066,{"name":40,"slug":41,"count":42,"latest_published_at":18},"Security","security",657,{"name":44,"slug":45,"count":46,"latest_published_at":47},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":49,"slug":50,"count":51,"latest_published_at":52},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":54,"slug":55,"count":56,"latest_published_at":18},"Hardware","hardware",155,{"name":58,"slug":59,"count":60,"latest_published_at":18},"Science","science",123,{"name":62,"slug":63,"count":64,"latest_published_at":65},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":67,"slug":68,"count":69,"latest_published_at":18},"Dev Tools","dev-tools",78,{"name":71,"slug":72,"count":73,"latest_published_at":74},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":86,"slug":87,"count":88,"latest_published_at":89},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]