{"id":"https://openalex.org/W7168347824","doi":"https://doi.org/10.48550/arxiv.2607.12421","title":"Adaptive Sampling for Minimum-Norm $k$-Clustering","display_name":"Adaptive Sampling for Minimum-Norm $k$-Clustering","publication_year":2026,"publication_date":"2026-07-14","ids":{"openalex":"https://openalex.org/W7168347824","doi":"https://doi.org/10.48550/arxiv.2607.12421"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.12421","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.12421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.12421","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140878729","display_name":"Haripriya Pulyassary","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pulyassary, Haripriya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140922859","display_name":"Chaitanya Swamy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Swamy, Chaitanya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9189000129699707,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9189000129699707,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.02290000021457672,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.014299999922513962,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5311999917030334},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.46970000863075256},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4424999952316284},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4348999857902527},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4228000044822693},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4025000035762787},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.37439998984336853},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.365200012922287}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5200999975204468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.46970000863075256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4607999920845032},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4390000104904175},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4228000044822693},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2892000079154968},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C100279318","wikidata":"https://www.wikidata.org/wiki/Q467440","display_name":"Sample space","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.26179999113082886}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.12421","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.12421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.12421","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.12421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,47],"$k$-clustering":[1,54,86,137],"problems,":[2],"we":[3,50,57,107,186],"are":[4,58],"given":[5,59],"a":[6,14,80,179],"metric":[7],"space":[8],"$(\\mathcal{C},":[9],"d)$,":[10],"and":[11,37,66,92,97],"must":[12],"choose":[13,109],"set":[15],"$S$":[16,40],"of":[17,103,112,164,174,182],"$k$":[18,70],"centers":[19,71],"to":[20,68,74,116,121],"open.":[21],"Each":[22],"client":[23],"$j":[24],"\\in":[25],"\\mathcal{C}$":[26],"incurs":[27],"an":[28,60,192],"assignment":[29],"cost,":[30],"which":[31,177],"is":[32,79,101,140],"the":[33,52,89,110,113,125,149,162,171],"distance":[34],"between":[35],"$j$":[36],"center":[38,115],"in":[39],"that":[41,102,188],"it":[42],"has":[43,131],"been":[44],"assigned":[45],"to.":[46],"this":[48,130],"work,":[49],"study":[51],"\\emph{minimum-norm":[53],"problem},":[55],"where":[56],"arbitrary":[61],"monotone":[62,183],"symmetric":[63,184],"norm":[64],"$f$,":[65],"wish":[67],"open":[69,117],"so":[72],"as":[73],"minimize":[75],"$f$(assignment-cost":[76],"vector).":[77],"This":[78],"powerful":[81],"generalization,":[82],"encompassing":[83],"many":[84],"classical":[85],"problems":[87,165],"including":[88],"$k$-median,":[90],"$k$-means,":[91],"$k$-center":[93],"problems.":[94],"A":[95],"simple":[96],"efficient":[98],"algorithmic":[99],"idea":[100],"\\emph{adaptive":[104],"sampling},":[105],"wherein":[106],"randomly":[108],"location":[111],"next":[114],"with":[118],"probability":[119],"proportional":[120],"its":[122],"``cost\"":[123],"under":[124],"currently":[126],"chosen":[127],"set.":[128],"While":[129],"yielded":[132],"fast":[133],"algorithms":[134],"for":[135,142,156],"some":[136],"problem,":[138],"little":[139],"known":[141],"settings":[143],"\\emph{without}":[144],"``min-sum\"":[145],"objectives.":[146],"We":[147],"devise":[148],"first":[150],"adaptive-sampling-based":[151],"bicriteria":[152],"constant-factor":[153],"approximation":[154],"algorithm":[155],"general":[157],"minimum-norm":[158],"$k$-clustering,":[159],"vastly":[160],"expanding":[161],"scope":[163],"handled":[166],"by":[167],"adaptive":[168,189],"sampling.":[169],"For":[170],"special":[172],"case":[173],"$\\text{Top}_\\ell$":[175],"norms,":[176,185],"form":[178],"building":[180],"block":[181],"show":[187],"sampling":[190],"yields":[191],"$O(\\log":[193],"k)$-approximation":[194],"algorithm.":[195]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-16T00:00:00"}