[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-lace-svd-shrinks-llms-without-losing-the-plot":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},3798,"lace-svd-shrinks-llms-without-losing-the-plot","LACE-SVD Shrinks LLMs Without Losing the Plot","A new compression framework allocates rank budgets by loss sensitivity and corrects propagating errors, outperforming prior SVD methods on standard benchmarks.","A research team has proposed a smarter way to compress large language models using a technique called singular value decomposition — and the results beat the current leading method by a notable margin.\n\nMost existing SVD-based compression tools treat each layer in isolation, squeezing it down without asking how that squeeze affects the model's overall output. LACE-SVD takes a different approach. It first estimates how sensitive each layer is to compression, then solves a budget-allocation problem to decide how much to shrink each one. After that initial pass, it applies a correction step designed to catch errors that would otherwise compound as they travel through the model's residual stream — the internal pathway that carries information from layer to layer.\n\nThat error-propagation problem is the real issue previous methods glossed over. When you compress a layer locally, the mistake doesn't stay local — it feeds into the next layer, and the next, until the model's outputs drift far from the original. LACE-SVD's correction step attacks that drift directly, which is why it matters beyond the benchmark number: it's addressing a structural flaw in how SVD compression has been done.\n\nAt a 60% compression ratio on LLaMA-7B, LACE-SVD scores a perplexity of 32.57 on the WikiText-2 benchmark, compared to 46.18 for Dobi-SVD — a lower perplexity score means the model is less confused by the test text, so the gap is meaningful. SVD-based compression is attractive precisely because it doesn't require specific hardware to work, unlike some quantization approaches. Whether these gains hold at smaller compression ratios, or on models larger than 7 billion parameters, is the question the paper leaves open.","[\"ai\",\"llms\",\"model-compression\",\"research\"]","2026-07-07T04:00:00.000Z","2026-07-07T08:44:29.042Z","2026-07-07T08:44:31.944Z","published",null,[],"ai",[24,26,27,28],"llms","model-compression","research",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2607.03057",0,{"sections":35},[36,40,45,50,55,60,65,70,75,79,84,88,93,98],{"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":18},"Dev Tools","dev-tools",59,{"name":80,"slug":81,"count":82,"latest_published_at":83},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":85,"slug":86,"count":82,"latest_published_at":87},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":89,"slug":90,"count":91,"latest_published_at":92},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":94,"slug":95,"count":96,"latest_published_at":97},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":99,"slug":100,"count":101,"latest_published_at":102},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]