{"id":"https://openalex.org/W2975971390","doi":"https://doi.org/10.1109/isit.2019.8849514","title":"Robust Gradient Descent via Moment Encoding and LDPC Codes","display_name":"Robust Gradient Descent via Moment Encoding and LDPC Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975971390","doi":"https://doi.org/10.1109/isit.2019.8849514","mag":"2975971390"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849514","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/A5083450236","display_name":"Raj Kumar Maity","orcid":"https://orcid.org/0000-0002-4759-696X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Raj Kumar Maity","raw_affiliation_strings":["CICS, University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"CICS, University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024124061","display_name":"Ankit Singh Rawa","orcid":null},"institutions":[{"id":"https://openalex.org/I4210112840","display_name":"Cambridge Electronics (United States)","ror":"https://ror.org/01cxdpf04","country_code":"US","type":"company","lineage":["https://openalex.org/I4210112840"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankit Singh Rawa","raw_affiliation_strings":["Research Laboratory of Electronics, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Research Laboratory of Electronics, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210112840"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051046818","display_name":"Arya Mazumdar","orcid":"https://orcid.org/0000-0003-4605-7996"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arya Mazumdar","raw_affiliation_strings":["CICS, University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"CICS, University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083450236"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":6.072,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.97006955,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2734","last_page":"2738"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9987000226974487,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8029680848121643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7768832445144653},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6121065616607666},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5581851601600647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5393919348716736},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5060858130455017},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5046283006668091},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5043245553970337},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4938815236091614},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4716053605079651},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46401557326316833},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4562276005744934},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4453069269657135},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.4277888536453247},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4120444357395172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40044456720352173},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06413725018501282}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8029680848121643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7768832445144653},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6121065616607666},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5581851601600647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5393919348716736},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5060858130455017},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5046283006668091},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5043245553970337},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4938815236091614},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4716053605079651},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46401557326316833},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4562276005744934},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4453069269657135},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.4277888536453247},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4120444357395172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40044456720352173},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06413725018501282},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849514","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W607505555","https://openalex.org/W1497601926","https://openalex.org/W1536930200","https://openalex.org/W1903497807","https://openalex.org/W1982063824","https://openalex.org/W1992208280","https://openalex.org/W2163107063","https://openalex.org/W2169732368","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2268702383","https://openalex.org/W2343350230","https://openalex.org/W2556205507","https://openalex.org/W2567951755","https://openalex.org/W2620705481","https://openalex.org/W2741736887","https://openalex.org/W2745045892","https://openalex.org/W2751733006","https://openalex.org/W2757498728","https://openalex.org/W2803520071","https://openalex.org/W2962850796","https://openalex.org/W2962873681","https://openalex.org/W2963361660","https://openalex.org/W2964095159","https://openalex.org/W3100515187","https://openalex.org/W4236362309","https://openalex.org/W4236536374","https://openalex.org/W4301515685","https://openalex.org/W6639528875","https://openalex.org/W6687322159","https://openalex.org/W6730190955","https://openalex.org/W6738442949","https://openalex.org/W6738835244","https://openalex.org/W6742061381","https://openalex.org/W6743655711","https://openalex.org/W6749257597","https://openalex.org/W6751482607"],"related_works":["https://openalex.org/W2389073067","https://openalex.org/W2107205667","https://openalex.org/W2510287032","https://openalex.org/W2368213141","https://openalex.org/W2761811700","https://openalex.org/W2585195498","https://openalex.org/W2118926208","https://openalex.org/W2000315166","https://openalex.org/W2042522304","https://openalex.org/W4309158935"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,17,24,27,36,45,49,52,59,62,84,96,101,111,115,122,128,132],"problem":[4],"of":[5,19,26,51,61,86,98],"implementing":[6],"large-scale":[7],"gradient":[8,124],"descent":[9,125],"algorithms":[10,74],"in":[11,16,100,135],"a":[12,65,104,136],"distributed":[13,138],"computing":[14,139],"setting":[15],"presence":[18],"straggling":[20],"processors.":[21],"To":[22],"mitigate":[23],"effect":[25],"stragglers,":[28,108],"it":[29,120],"has":[30],"been":[31],"previously":[32],"proposed":[33,116,129],"to":[34,57,92],"encode":[35,58],"data":[37,63],"with":[38,64,95],"an":[39],"erasure-correcting":[40],"code":[41],"and":[42,83],"decode":[43],"at":[44,48],"master":[46],"server":[47],"end":[50],"computation.":[53],"We,":[54],"instead,":[55],"propose":[56],"second-moment":[60],"low":[66,80],"density":[67],"parity-check":[68],"(LDPC)":[69],"code.":[70],"The":[71],"iterative":[72],"decoding":[73,87],"for":[75,107,114],"LDPC":[76],"codes":[77],"have":[78],"very":[79],"computational":[81],"overhead":[82],"number":[85,97],"iterations":[88],"can":[89],"be":[90],"made":[91],"automatically":[93],"adjust":[94],"stragglers":[99],"system.":[102],"For":[103],"random":[105],"model":[106],"we":[109],"obtain":[110],"convergence":[112],"guarantees":[113],"solution":[117,130],"by":[118],"viewing":[119],"as":[121],"stochastic":[123],"method.":[126],"Furthermore,":[127],"outperforms":[131],"existing":[133],"schemes":[134],"real":[137],"setup.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}