[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-better-bounds-for-a-classic-optimization-problem":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},4350,"better-bounds-for-a-classic-optimization-problem","Better Bounds for a Classic Optimization Problem","Researchers have new data-dependent upper bounds that let engineers check how close their submodular maximization solutions actually are to optimal.","A team of researchers says it has found a practical way to tell whether an optimization algorithm is doing a good job — not just in theory, but on real data.\n\nSubmodular maximization is a class of optimization problems that shows up constantly in machine learning and data mining — think selecting the most informative training samples or choosing which sensors to deploy. The problem is NP-hard, meaning exact solutions are computationally out of reach at scale, so practitioners rely on approximation algorithms. The catch: standard analysis only gives worst-case guarantees, which are often so pessimistic they tell you almost nothing about actual performance on a specific dataset. The new paper introduces data-dependent upper bounds for the variant of the problem that includes a knapsack constraint, meaning a budget on how much you can spend on selected items.\n\nThe practical upshot is a certification tool: run your algorithm, then run their bound, and you get a number that tells you how far your solution could possibly be from optimal on that specific instance — not just in the worst case imaginable. That matters because worst-case bounds have a habit of being so loose that practitioners essentially ignore them, making it hard to know when to stop searching for a better solution.\n\nAlgorithm designers have wanted tighter instance-specific guarantees for decades; the fact that this one holds theoretically and also demonstrates advantages on real-world datasets is the more credible part of the claim. Whether it scales cleanly to the dataset sizes common in production ML pipelines is the question this paper leaves open.","[\"machine learning\",\"optimization\",\"algorithms\",\"research\"]","2026-07-08T04:00:00.000Z","2026-07-08T06:51:52.823Z","2026-07-08T06:51:55.780Z","published",null,[],"ai",[26,27,28,29],"machine learning","optimization","algorithms","research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2607.05759",0,{"sections":36},[37,41,46,51,56,61,66,71,76,81,86,90,95,100],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":45},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":47,"slug":48,"count":49,"latest_published_at":50},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":52,"slug":53,"count":54,"latest_published_at":55},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":57,"slug":58,"count":59,"latest_published_at":60},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":62,"slug":63,"count":64,"latest_published_at":65},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":67,"slug":68,"count":69,"latest_published_at":70},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":72,"slug":73,"count":74,"latest_published_at":75},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":80},"Dev Tools","dev-tools",59,"2026-07-07T04:00:00.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":87,"slug":88,"count":84,"latest_published_at":89},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":101,"slug":102,"count":103,"latest_published_at":104},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]