[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-study-closes-gap-on-error-bounds-for-networked-learning":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},5378,"study-closes-gap-on-error-bounds-for-networked-learning","Study Closes Gap on Error Bounds for Networked Learning","A new proof shows networked learners can't escape a 1\u002Fsqrt(D) error floor no matter how they're chained, closing a gap left by prior work.","A new theoretical paper nails down exactly how much accuracy you lose when predictions get passed hand-to-hand across a network of learners, instead of pooled all at once.\n\nThe setup, first studied by Kearns et al. (2026), puts learners on the nodes of a directed graph, each one training a linear predictor using its own local data plus whatever predictors its \"parent\" nodes already learned. That earlier work showed error falls at a rate no worse than O(1\u002Fsqrt(D)) as you move along a chain of length D, but only proved a weaker floor of Omega(1\u002FD), leaving the true rate an open question. This paper closes that gap, constructing worst-case problem instances that force error all the way up to Omega(1\u002Fsqrt(D)) - matching the upper bound and settling the question. The analysis also stretches beyond squared error to a broad class of convex loss functions, including logistic loss, which resolves a parallel open gap from Bateni et al. (2026).\n\nThis matters because networked, information-passing systems are how a lot of real machine learning now works: federated setups, multi-agent pipelines, sensor networks relaying inference downstream. The result says the accuracy penalty from that structure isn't a quirk of sloppy engineering - it's a hard mathematical floor, and it doesn't get better with cleverer algorithms.\n\nIt's also a reminder that this is a proof about limits, not a fix. Nobody walks away with a faster network or a smarter aggregation trick - just a tighter, less optimistic ceiling on what one was ever going to get.","[\"machine learning theory\",\"distributed learning\",\"arxiv\",\"research\"]","2026-08-18T04:00:00.000Z","2026-08-18T17:40:14.095Z","2026-08-18T17:40:25.989Z","published",null,[],"ai",[26,27,28,29],"machine learning theory","distributed learning","arxiv","research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2608.15472",0,{"sections":36},[37,41,45,50,55,60,65,70,75,79,84,89,94,99],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",3293,"2026-08-20T04:00:00.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":40},"Security","security",435,{"name":46,"slug":47,"count":48,"latest_published_at":49},"Policy","policy",210,"2026-08-19T09:32:27.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",140,"2026-08-19T18:25:42.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",95,"2026-08-18T16:05:00.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Science","science",90,"2026-08-19T18:41:02.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Software","software",73,"2026-08-18T07:51:50.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":18},"Dev Tools","dev-tools",69,{"name":80,"slug":81,"count":82,"latest_published_at":83},"Startups","startups",47,"2026-08-19T19:13:46.000Z",{"name":85,"slug":86,"count":87,"latest_published_at":88},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":90,"slug":91,"count":92,"latest_published_at":93},"General","general",33,"2026-08-18T22:18:13.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"]