{"id":"https://openalex.org/W7148613605","doi":"https://doi.org/10.48550/arxiv.2604.00954","title":"Round-efficient Fully-scalable MPC algorithms for k-Means","display_name":"Round-efficient Fully-scalable MPC algorithms for k-Means","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148613605","doi":"https://doi.org/10.48550/arxiv.2604.00954"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.00954","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00954","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.00954","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132830301","display_name":"Shaofeng H. -C. Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Shaofeng H. -C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055378538","display_name":"Yaonan Jin","orcid":"https://orcid.org/0000-0001-6256-7625"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin, Yaonan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087578619","display_name":"Jianing Lou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lou, Jianing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132758808","display_name":"Weicheng Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Weicheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6880999803543091,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6880999803543091,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.24770000576972961,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.01810000091791153,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/computation","display_name":"Computation","score":0.5501000285148621},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5076000094413757},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.47510001063346863},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.42500001192092896},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.41589999198913574},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4088999927043915},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.3862999975681305},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.3822000026702881}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6690000295639038},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5501000285148621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5091999769210815},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5076000094413757},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.47510001063346863},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.42500001192092896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41620001196861267},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.41589999198913574},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3856000006198883},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2696000039577484}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.00954","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00954","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.00954","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00954","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"Euclidean":[2],"$k$-Means":[3,32],"under":[4,135,161],"the":[5,13,91,109,125,158,184,199],"Massively":[6],"Parallel":[7],"Computation":[8],"(MPC)":[9],"model,":[10],"focusing":[11],"on":[12],"\\emph{fully-scalable}":[14],"setting.":[15],"Our":[16,65,100],"main":[17,101],"result":[18],"is":[19,104,124,142,164],"a":[20,45,77,105,168,173,195,206],"fully-scalable":[21,29],"$O((\\log":[22],"n/\\log\\log":[23,71],"n)^2)$-approximation":[24],"in":[25,35,154,187,201],"$O(1)$":[26,188,202],"rounds.":[27],"Previously,":[28],"algorithms":[30],"for":[31,73,118,144,150,209],"either":[33],"run":[34],"super-constant":[36],"$O(\\log\\log":[37],"n":[38],"\\cdot":[39],"\\log\\log\\log":[40],"n)$":[41,88],"rounds,":[42,189],"albeit":[43],"with":[44],"better":[46],"$O(1)$-approximation":[47,182,197],"[Cohen-Addad":[48],"et":[49,62,82],"al.,":[50,63,83],"SODA'26],":[51,84],"or":[52],"suffer":[53],"from":[54],"bicriteria":[55],"guarantees":[56],"[Bhaskara":[57],"and":[58,85,113,148],"Wijewardena,":[59],"ICML'18;":[60],"Czumaj":[61],"ICALP'24].":[64],"algorithm":[66,111,152],"also":[67,179],"gives":[68],"an":[69,181],"$O(\\log":[70,79],"n)$-approximation":[72,80],"$k$-Median,":[74],"which":[75,190],"improves":[76],"recent":[78],"[Goranci":[81],"this":[86],"$o(\\log":[87],"ratio":[89],"breaks":[90],"fundamental":[92],"barrier":[93],"of":[94,108,175],"tree":[95],"embedding":[96],"methods":[97],"used":[98],"therein.":[99],"technical":[102,170],"contribution":[103],"new":[106,122],"variant":[107],"MP":[110],"[Mettu":[112],"Plaxton,":[114],"SICOMP'03]":[115],"that":[116,193],"works":[117],"general":[119],"metrics,":[120],"whose":[121],"guarantee":[123],"Lagrangian":[126],"Multiplier":[127],"Preserving":[128],"(LMP)":[129],"property,":[130],"which,":[131],"importantly,":[132],"holds":[133],"even":[134],"arbitrary":[136],"distance":[137,140,162],"distortions.":[138],"Allowing":[139],"distortion":[141,163],"crucial":[143],"efficient":[145,151],"MPC":[146],"implementations":[147],"useful":[149],"design":[153],"general,":[155],"whereas":[156],"preserving":[157],"LMP":[159],"property":[160],"known":[165],"to":[166,183],"be":[167,205],"significant":[169],"challenge.":[171],"As":[172],"byproduct":[174],"our":[176],"techniques,":[177],"we":[178],"obtain":[180],"optimal":[185],"\\emph{value}":[186],"conceptually":[191],"suggests":[192],"achieving":[194],"true":[196],"(for":[198],"solution)":[200],"rounds":[203],"may":[204],"sensible":[207],"goal":[208],"future":[210],"study.":[211]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-03T00:00:00"}