{"id":"https://openalex.org/W4415821423","doi":"https://doi.org/10.1109/tit.2025.3628160","title":"Adversarially Robust Clustering With Optimality Guarantees","display_name":"Adversarially Robust Clustering With Optimality Guarantees","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4415821423","doi":"https://doi.org/10.1109/tit.2025.3628160"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2025.3628160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3628160","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048817569","display_name":"Soham Jana","orcid":"https://orcid.org/0000-0001-7547-9333"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soham Jana","raw_affiliation_strings":["Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106556665","display_name":"Kun Yang","orcid":"https://orcid.org/0009-0009-5172-9129"},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kun Yang","raw_affiliation_strings":["O&#x2019;Donnell Data Science and Research Computing Institute, Southern Methodist University, Dallas, TX, USA","Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"O&#x2019;Donnell Data Science and Research Computing Institute, Southern Methodist University, Dallas, TX, USA","institution_ids":["https://openalex.org/I178169726"]},{"raw_affiliation_string":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053530986","display_name":"Sanjeev R. Kulkarni","orcid":"https://orcid.org/0000-0002-5308-5250"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Kulkarni","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA","Department of Electrical and Computer Engineering and Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048817569"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17068654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"1","first_page":"478","last_page":"500"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.18960000574588776,"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/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.18960000574588776,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.133200004696846,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.09000000357627869,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7505000233650208},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7139999866485596},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.6114000082015991},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.60589998960495},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4372999966144562},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41690000891685486},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.3431999981403351},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.3343000113964081}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7505000233650208},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7139999866485596},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.6114000082015991},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.60589998960495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.593500018119812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4871000051498413},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4171999990940094},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.3343000113964081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.329800009727478},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3019999861717224},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C67226441","wikidata":"https://www.wikidata.org/wiki/Q1665389","display_name":"Robust statistics","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.2842999994754791},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.27959999442100525},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2025.3628160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3628160","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W1493454437","https://openalex.org/W1558625102","https://openalex.org/W1664520935","https://openalex.org/W1980018091","https://openalex.org/W1985622505","https://openalex.org/W1986007546","https://openalex.org/W1995837069","https://openalex.org/W2000744043","https://openalex.org/W2010849103","https://openalex.org/W2011430131","https://openalex.org/W2014002306","https://openalex.org/W2022852240","https://openalex.org/W2026302946","https://openalex.org/W2030209765","https://openalex.org/W2048144561","https://openalex.org/W2050647304","https://openalex.org/W2052044664","https://openalex.org/W2052691201","https://openalex.org/W2053479770","https://openalex.org/W2054050358","https://openalex.org/W2060759455","https://openalex.org/W2069051541","https://openalex.org/W2077742157","https://openalex.org/W2088087163","https://openalex.org/W2093071433","https://openalex.org/W2103096501","https://openalex.org/W2110105238","https://openalex.org/W2115077250","https://openalex.org/W2115979708","https://openalex.org/W2116442055","https://openalex.org/W2120688485","https://openalex.org/W2134158406","https://openalex.org/W2146670837","https://openalex.org/W2150593711","https://openalex.org/W2164919086","https://openalex.org/W2171124048","https://openalex.org/W2410099853","https://openalex.org/W2605029335","https://openalex.org/W2745001864","https://openalex.org/W2783582361","https://openalex.org/W2942689850","https://openalex.org/W2962777529","https://openalex.org/W2963616494","https://openalex.org/W2964266311","https://openalex.org/W2996588988","https://openalex.org/W3126729338","https://openalex.org/W3129046222","https://openalex.org/W3160856740","https://openalex.org/W3204359140","https://openalex.org/W3204688258","https://openalex.org/W3205182098","https://openalex.org/W3211977733","https://openalex.org/W4210881201","https://openalex.org/W4211030719","https://openalex.org/W4245577611","https://openalex.org/W4249736682","https://openalex.org/W4256434055","https://openalex.org/W4293483898","https://openalex.org/W4294688231","https://openalex.org/W4320890550","https://openalex.org/W4360879297","https://openalex.org/W4411983378","https://openalex.org/W4412034722","https://openalex.org/W4415795857"],"related_works":[],"abstract_inverted_index":{"We":[0,49],"consider":[1],"the":[2,17,23,45,57,62,78,93,108,123],"problem":[3],"of":[4,95,107,126],"clustering":[5,33],"data":[6],"points":[7],"coming":[8],"from":[9],"sub-Gaussian":[10],"mixtures.":[11],"Existing":[12],"methods":[13,34],"that":[14,60,106],"provably":[15],"achieve":[16],"optimal":[18,46,63,79],"mislabeling":[19,64],"error,":[20],"such":[21],"as":[22],"Lloyd":[24,109],"algorithm,":[25],"are":[26,40,103,119],"usually":[27],"vulnerable":[28],"to":[29,37,43,72,105,121],"outliers.":[30],"In":[31,92],"contrast,":[32],"seemingly":[35],"robust":[36,53],"adversarial":[38,70],"perturbations":[39],"not":[41],"known":[42],"satisfy":[44],"statistical":[47],"guarantees.":[48],"propose":[50],"a":[51,86],"simple":[52],"algorithm":[54,76],"based":[55],"on":[56,113],"coordinatewise":[58],"median":[59],"obtains":[61],"rate":[65,81],"even":[66],"when":[67,85],"we":[68],"allow":[69],"outliers":[71],"be":[73],"present.":[74],"Our":[75],"achieves":[77],"error":[80],"in":[82,97],"constant":[83],"iterations":[84],"weak":[87],"initialization":[88],"condition":[89],"is":[90],"satisfied.":[91],"absence":[94],"outliers,":[96],"fixed":[98],"dimensions,":[99],"our":[100,127],"theoretical":[101,124],"guarantees":[102,125],"similar":[104],"algorithm.":[110],"Extensive":[111],"experiments":[112],"various":[114],"simulated":[115],"and":[116],"public":[117],"datasets":[118],"conducted":[120],"support":[122],"method.":[128]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-11-03T00:00:00"}
