[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-bounds-show-neural-nets-pack-features-more-efficiently":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},6328,"new-bounds-show-neural-nets-pack-features-more-efficiently","New Bounds Show Neural Nets Pack Features More Efficiently","A new proof recasts feature superposition as a compressed sensing problem, showing neural nets need far fewer dimensions than previously assumed.","A new proof tightens the math on how many concepts a neural network can cram into fewer dimensions than it has neurons.\n\nThe paper reframes a problem called linear accessibility, essentially whether you can cleanly read out which concepts a network is representing when it uses overlapping (\"superposed\") internal codes, as a version of compressed sensing, the same math used to reconstruct signals from partial data. Assuming noise that behaves predictably (subgaussian noise, a bell-curve-like pattern) and a fixed set of active features, the authors derive bounds showing the dimensions a network needs grow linearly with the number of active features and the logarithm of total features, not with the square of that number as earlier worst-case estimates implied. They check the bounds against approximations across a range of settings to confirm they hold up beyond pure theory.\n\nThat is a meaningfully looser constraint. Sparse autoencoders and other interpretability tools assume a model's superposed features can be teased apart linearly, and a linear rather than quadratic dimension requirement means models may have more room than pessimists assumed to pack in distinguishable concepts without them blurring together.\n\nIt is still a bound derived from tidy statistical assumptions, not evidence that any specific model's messy real-world internals actually cooperate this neatly.","[\"interpretability\",\"sparse-autoencoders\",\"neural-networks\",\"ai-research\"]","2026-09-11T04:00:00.000Z","2026-09-11T06:43:06.167Z","2026-09-11T06:43:18.081Z","published",null,[],"ai",[26,27,28,29],"interpretability","sparse-autoencoders","neural-networks","ai-research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.09556",0,{"sections":36},[37,40,44,48,53,58,63,66,71,75,80,85,90,95],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",3521,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",637,{"name":45,"slug":46,"count":47,"latest_published_at":18},"Policy","policy",338,{"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":57},"Hardware","hardware",153,"2026-09-09T15:12:32.000Z",{"name":59,"slug":60,"count":61,"latest_published_at":62},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":64,"slug":65,"count":61,"latest_published_at":18},"Science","science",{"name":67,"slug":68,"count":69,"latest_published_at":70},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":72,"slug":73,"count":74,"latest_published_at":18},"Dev Tools","dev-tools",70,{"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"]