[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-proof-shows-major-clustering-methods-are-all-np-hard":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},6699,"new-proof-shows-major-clustering-methods-are-all-np-hard","New Proof Shows Major Clustering Methods Are All NP-Hard","A new proof shows k-means, DBSCAN, spectral clustering, and other major methods all share the same NP-hard core, explaining their notorious instability.","Clustering algorithms don't just occasionally get stuck in bad answers - they're mathematically guaranteed to, no matter which one you pick.\n\nA new paper defines what it calls the Universal Clustering Problem, framing clustering as maximizing a polynomial-time-computable partition utility over a finite metric space. The authors prove this general problem is NP-hard, using two independent reductions: one from graph coloring, another from exact cover by 3-sets. They then map ten widely used clustering paradigms - including k-means, Gaussian mixture models, DBSCAN, spectral clustering, and affinity propagation - onto this framework, and show each one inherits the same intractability. That gives a single mathematical root for problems practitioners have long treated as separate quirks of each algorithm.\n\nThis matters because clustering is treated as a solved, off-the-shelf tool in everything from customer segmentation to genomics, yet its outputs are famously sensitive to initialization, hyperparameters, and how data gets represented. The paper argues that instability isn't a tuning problem to be engineered away - it's baked into the underlying optimization, which is why local optima in algorithms like k-means and greedy merge-order traps in hierarchical clustering keep showing up regardless of implementation.\n\nThe paper's own suggested fix - shifting toward stability-aware objectives and interaction-driven formulations with explicit guarantees - sounds sensible, but it's also the kind of framing that shows up whenever a field discovers its core problem is intractable and can't offer a shortcut, only a different way to live with the wall.","[\"clustering\",\"machine learning\",\"computational complexity\",\"unsupervised learning\"]","2026-09-17T04:00:00.000Z","2026-09-18T06:42:05.439Z","2026-09-18T06:42:17.347Z","published",null,[],"ai",[26,27,28,29],"clustering","machine learning","computational complexity","unsupervised learning",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2603.00210",0,{"sections":36},[37,41,45,50,55,59,63,68,73,77,82,87,92,97],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",3853,"2026-09-17T08:27:09.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":18},"Security","security",648,{"name":46,"slug":47,"count":48,"latest_published_at":49},"Policy","policy",338,"2026-09-11T04:00:00.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":18},"Hardware","hardware",154,{"name":60,"slug":61,"count":62,"latest_published_at":18},"Science","science",114,{"name":64,"slug":65,"count":66,"latest_published_at":67},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":69,"slug":70,"count":71,"latest_published_at":72},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":74,"slug":75,"count":76,"latest_published_at":18},"Dev Tools","dev-tools",73,{"name":78,"slug":79,"count":80,"latest_published_at":81},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":83,"slug":84,"count":85,"latest_published_at":86},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":88,"slug":89,"count":90,"latest_published_at":91},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":93,"slug":94,"count":95,"latest_published_at":96},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":98,"slug":99,"count":100,"latest_published_at":101},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]