{"id":"https://openalex.org/W4411319926","doi":"https://doi.org/10.1145/3717823.3718180","title":"Almost Optimal PAC Learning for \ud835\udc58-Means","display_name":"Almost Optimal PAC Learning for \ud835\udc58-Means","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319926","doi":"https://doi.org/10.1145/3717823.3718180"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718180","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/a4388b95-9d62-41b3-8d73-fc81dce128f6","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Grenoble, France"],"affiliations":[{"raw_affiliation_string":"Google Research, Grenoble, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022550622","display_name":"Silvio Lattanzi","orcid":"https://orcid.org/0000-0002-3502-7559"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Lattanzi","raw_affiliation_strings":["Google, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Google, Barcelona, Spain","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098622084","display_name":"Chris Schwiegelshohn","orcid":"https://orcid.org/0009-0008-9114-0661"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Chris Schwiegelshohn","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07293509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2019","last_page":"2030"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.631658673286438}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.631658673286438}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718180","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/a4388b95-9d62-41b3-8d73-fc81dce128f6","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/a4388b95-9d62-41b3-8d73-fc81dce128f6","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cohen-Addad, V, Lattanzi, S & Schwiegelshohn, C 2025, Almost Optimal PAC Learning for k-Means. in M Koucky & N Bansal (eds), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 2019-2030, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/2025. https://doi.org/10.1145/3717823.3718180","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/a4388b95-9d62-41b3-8d73-fc81dce128f6","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/a4388b95-9d62-41b3-8d73-fc81dce128f6","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cohen-Addad, V, Lattanzi, S & Schwiegelshohn, C 2025, Almost Optimal PAC Learning for k-Means. in M Koucky & N Bansal (eds), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 2019-2030, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/2025. https://doi.org/10.1145/3717823.3718180","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W2017753243","https://openalex.org/W2019363670","https://openalex.org/W2060640288","https://openalex.org/W2066679806","https://openalex.org/W2084544490","https://openalex.org/W2091283109","https://openalex.org/W2129192653","https://openalex.org/W2137216203","https://openalex.org/W2142766915","https://openalex.org/W2145915448","https://openalex.org/W2156117587","https://openalex.org/W2161065057","https://openalex.org/W2579923771","https://openalex.org/W2604272474","https://openalex.org/W2809400127","https://openalex.org/W2962691590","https://openalex.org/W2962777529","https://openalex.org/W2963693826","https://openalex.org/W2971668650","https://openalex.org/W3116773026","https://openalex.org/W3204688258","https://openalex.org/W4386653094","https://openalex.org/W4390098527","https://openalex.org/W4404848044","https://openalex.org/W4404848792","https://openalex.org/W6856729638"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Given":[0],"a":[1,12,15,52,70,138],"set":[2,16,53],"of":[3,10,14,17,26,54,80,87,89,106,141,144],"points,":[4],"the":[5,24,31,77,90,100,107,126,142],"k-means":[6],"clustering":[7,79],"problem":[8],"consists":[9],"finding":[11],"partition":[13],"points":[18,32],"into":[19],"k":[20,135],"clusters":[21],"such":[22],"that":[23],"sum":[25],"squared":[27],"Euclidean":[28],"distances":[29],"between":[30],"and":[33,114,130],"their":[34],"assigned":[35],"centers":[36],"is":[37,93],"minimized.":[38],"In":[39],"this":[40,47],"paper,":[41],"we":[42],"consider":[43],"learning":[44,119],"bounds":[45,120],"for":[46],"problem.":[48],"That":[49],"is,":[50],"given":[51],"n":[55,129],"samples":[56],"P":[57,74],"drawn":[58],"independently":[59],"from":[60],"some":[61],"unknown":[62],"but":[63],"fixed":[64],"distribution":[65],"D,":[66],"how":[67],"quickly":[68],"does":[69],"solution":[71],"computed":[72],"on":[73,125,134],"converge":[75],"to":[76,95,111],"optimal":[78,123,132],"D?":[81],"The":[82],"currently":[83],"fastest":[84],"provable":[85],"rate":[86,140],"convergence":[88,139],"order":[91,108,143],"\u2192k/nmin(k,logklog<sup>2</sup>(n/k))":[92],"due":[94,110],"[Appert,":[96],"Catoni,":[97],"2021]":[98],"with":[99,121],"best":[101],"known":[102],"lower":[103],"bound":[104],"being":[105],"\u03bbk/n":[109],"[Bartlett,":[112],"Linder,":[113],"Lugosi,":[115],"1998].":[116],"We":[117],"give":[118],"both":[122],"dependency":[124,133],"sample":[127],"size":[128],"nearly":[131],"by":[136],"proving":[137],"\u2192klogk/n.":[145]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-06-16T00:00:00"}