{"id":"https://openalex.org/W2977013187","doi":"https://doi.org/10.1109/isit.2019.8849857","title":"Data Encoding Methods for Byzantine-Resilient Distributed Optimization","display_name":"Data Encoding Methods for Byzantine-Resilient Distributed Optimization","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2977013187","doi":"https://doi.org/10.1109/isit.2019.8849857","mag":"2977013187"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5023777978","display_name":"Deepesh Data","orcid":"https://orcid.org/0000-0003-3544-8414"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Deepesh Data","raw_affiliation_strings":["University of California, Los Angeles, CA, 90095, USA","University of California, Los Angeles, CA 90095, USA\u2605"],"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA, 90095, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California, Los Angeles, CA 90095, USA\u2605","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035185924","display_name":"Linqi Song","orcid":"https://orcid.org/0000-0003-2756-4984"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Linqi Song","raw_affiliation_strings":["City University of Hong Kong, Hong Kong SAR","City University of Hong Kong , Hong Kong, SAR"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong, Hong Kong SAR","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"City University of Hong Kong , Hong Kong, SAR","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083980887","display_name":"Suhas Diggavi","orcid":"https://orcid.org/0000-0001-7313-9861"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suhas Diggavi","raw_affiliation_strings":["University of California, Los Angeles, CA, 90095, USA","University of California, Los Angeles, CA 90095, USA\u2605"],"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA, 90095, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California, Los Angeles, CA 90095, USA\u2605","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023777978"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":1.876,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89564398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2719","last_page":"2723"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9997000098228455,"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/T11716","display_name":"Random Matrices and Applications","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.771874189376831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7574642896652222},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6684817671775818},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6153416037559509},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5942217707633972},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5874488353729248},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5185444951057434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45764440298080444},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4292317032814026},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3940317630767822},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.1453290581703186},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10394659638404846}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.771874189376831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7574642896652222},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6684817671775818},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6153416037559509},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5942217707633972},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5874488353729248},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5185444951057434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45764440298080444},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4292317032814026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3940317630767822},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.1453290581703186},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10394659638404846},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849857","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5699999928474426,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1982063824","https://openalex.org/W2129131372","https://openalex.org/W2129569662","https://openalex.org/W2166706236","https://openalex.org/W2173213060","https://openalex.org/W2268702383","https://openalex.org/W2556205507","https://openalex.org/W2614254310","https://openalex.org/W2729686365","https://openalex.org/W2741736887","https://openalex.org/W2751733006","https://openalex.org/W2752689052","https://openalex.org/W2788816110","https://openalex.org/W2789911054","https://openalex.org/W2807801669","https://openalex.org/W2935717345","https://openalex.org/W2962873681","https://openalex.org/W2963165390","https://openalex.org/W2963706835","https://openalex.org/W2964261056","https://openalex.org/W2964279249","https://openalex.org/W2964323106","https://openalex.org/W3111898548","https://openalex.org/W3137092842","https://openalex.org/W4252654521","https://openalex.org/W4288287403","https://openalex.org/W4301515685","https://openalex.org/W6684249991","https://openalex.org/W6730190955","https://openalex.org/W6741764668","https://openalex.org/W6742061381","https://openalex.org/W6743655711","https://openalex.org/W6743821447","https://openalex.org/W6748786018","https://openalex.org/W6748805329","https://openalex.org/W6754358263","https://openalex.org/W6765275638"],"related_works":["https://openalex.org/W2355022049","https://openalex.org/W2060429446","https://openalex.org/W2741782512","https://openalex.org/W3011302839","https://openalex.org/W2392958391","https://openalex.org/W3155227409","https://openalex.org/W2952348651","https://openalex.org/W2386709048","https://openalex.org/W2898682874","https://openalex.org/W2781863720"],"abstract_inverted_index":{"We":[0,82,108,120],"consider":[1],"distributed":[2,11,156],"gradient":[3,39,44,60],"computation,":[4],"where":[5],"both":[6],"data":[7,71,118,174],"and":[8,23,73,130,135,148],"computation":[9],"are":[10],"among":[12],"m":[13],"worker":[14,91],"machines,":[15],"t":[16,87,162],"of":[17,42,127],"which":[18,43,93,114],"can":[19,54,83],"be":[20],"Byzantine":[21,52],"adversaries,":[22,160],"a":[24,48,67,110,122,144],"designated":[25],"(master)":[26],"node":[27],"computes":[28],"the":[29,79,106,125,131,155,172,180],"model/parameter":[30],"vector":[31],"for":[32,161],"generalized":[33],"linear":[34],"models,":[35],"iteratively,":[36],"using":[37],"proximal":[38],"descent":[40,45],"(PGD),":[41],"(GD)":[46],"is":[47,94],"special":[49],"case.":[50],"The":[51],"adversaries":[53,128],"(collaboratively)":[55],"deviate":[56],"arbitrarily":[57],"from":[58],"their":[59],"computation.":[61],"To":[62],"solve":[63],"this,":[64],"we":[65],"propose":[66],"method":[68,98],"based":[69],"on":[70,105],"encoding":[72,112,167],"(real)":[74],"error":[75],"correction":[76],"to":[77,86],"combat":[78],"adversarial":[80],"behavior.":[81],"tolerate":[84],"up":[85],"\u2264":[88,163],"[m-1/2]":[89],"corrupt":[90],"nodes,":[92],"information-theoretically":[95],"optimal.":[96],"Our":[97,166],"does":[99,178],"not":[100],"assume":[101],"any":[102],"probability":[103],"distribution":[104],"data.":[107],"develop":[109],"sparse":[111],"scheme":[113,142],"enables":[115],"computationally":[116],"efficient":[117],"encoding.":[119],"demonstrate":[121],"trade-off":[123],"between":[124],"number":[126],"tolerated":[129],"resource":[132],"requirement":[133],"(storage":[134,147],"computational":[136,149],"complexity).":[137],"As":[138],"an":[139],"example,":[140],"our":[141],"incurs":[143],"constant":[145],"overhead":[146],"complexity)":[150],"over":[151],"that":[152],"required":[153],"by":[154],"PGD":[157],"algorithm,":[158],"without":[159],"m/3":[164],".":[165],"works":[168],"as":[169,176],"efficiently":[170],"in":[171,179],"streaming":[173],"etting":[175],"it":[177]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}