[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-memory-bank-for-ai-that-remembers-old-tasks":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},2761,"a-memory-bank-for-ai-that-remembers-old-tasks","A Memory Bank for AI That Remembers Old Tasks","Researchers argue that continual learning gains come from storing and retrieving compressed model weights, not from any clever scheduling policy.","A new training method stores past knowledge in a compressed memory bank so a neural network can pick up old skills without relearning them from scratch.\n\nThe technique, called Neural Subspace Reallocation (NSR), treats the lightweight adapter modules commonly used to fine-tune large models - known as LoRA adapters - as retrievable memory units rather than throwaway task-specific patches. When a model starts a new task, NSR compresses previous adapters using a standard matrix decomposition method, parks them in a structure called a TaskKnowledgeBank, and retrieves the most relevant ones to warm-start training. A distillation step prevents the model from forgetting what came before. The team reports that on standard continual-learning benchmarks, NSR cuts the time to recover a recurring task by 10x and produces about 9x less backward interference than approaches that ignore history entirely.\n\nThe more interesting finding is what the paper isolates as the actual driver of those gains. The researchers ran a controlled experiment holding the memory bank constant while swapping in different policies for deciding which adapters to activate - including a reinforcement-learning controller. A simple similarity-based retrieval rule matched or beat the learned policy. That matters because the field has spent considerable effort designing smart scheduling algorithms; this result suggests the memory structure itself is doing the real work.\n\nThe compressed bank costs roughly 0.29 MB per task, keeping the total footprint manageable even as task counts grow - a practical constraint that most continual-learning papers gloss over. Whether this holds outside controlled benchmarks, where task boundaries are rarely clean, is the question that lab results can never quite answer.","[\"ai\",\"machine-learning\",\"continual-learning\",\"research\"]","2026-06-30T04:00:00.000Z","2026-06-30T12:15:23.133Z","2026-06-30T12:15:26.089Z","published",null,[],"ai",[24,26,27,28],"machine-learning","continual-learning","research",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2606.30067",0,{"sections":35},[36,40,45,50,55,60,65,70,75,80,85,89,94,99],{"name":37,"slug":24,"count":38,"latest_published_at":39},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":41,"slug":42,"count":43,"latest_published_at":44},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":46,"slug":47,"count":48,"latest_published_at":49},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Dev Tools","dev-tools",59,"2026-07-07T04:00:00.000Z",{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":86,"slug":87,"count":83,"latest_published_at":88},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":90,"slug":91,"count":92,"latest_published_at":93},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":95,"slug":96,"count":97,"latest_published_at":98},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":100,"slug":101,"count":102,"latest_published_at":103},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]