{"id":"https://openalex.org/W3035832794","doi":"https://doi.org/10.1109/jsait.2021.3100110","title":"Approximate Gradient Coding With Optimal Decoding","display_name":"Approximate Gradient Coding With Optimal Decoding","publication_year":2021,"publication_date":"2021-07-26","ids":{"openalex":"https://openalex.org/W3035832794","doi":"https://doi.org/10.1109/jsait.2021.3100110","mag":"3035832794"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2021.3100110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3100110","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2006.09638","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Margalit Glasgow","orcid":"https://orcid.org/0000-0001-6605-2127"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Margalit Glasgow","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mary Wootters","orcid":"https://orcid.org/0000-0002-2345-2531"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mary Wootters","raw_affiliation_strings":["Department of Computer Science and the Department of Electrical Engineering, Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and the Department of Electrical Engineering, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.2596,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83051606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":"3","first_page":"855","last_page":"866"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9593999981880188,"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.9593999981880188,"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.022700000554323196,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.003599999938160181,"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/gradient-descent","display_name":"Gradient descent","score":0.7224000096321106},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.714900016784668},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.48249998688697815},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.448199987411499},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.43880000710487366},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.41339999437332153},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.3862000107765198},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.3483000099658966}],"concepts":[{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.7224000096321106},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.714900016784668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6337000131607056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5067999958992004},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.48249998688697815},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39570000767707825},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3862000107765198},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.34040001034736633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.334199994802475},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.32910001277923584},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.2928999960422516},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2766999900341034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26170000433921814},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2612000107765198},{"id":"https://openalex.org/C2986577269","wikidata":"https://www.wikidata.org/wiki/Q11306265","display_name":"Random noise","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/jsait.2021.3100110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3100110","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2006.09638","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.09638","pdf_url":"https://arxiv.org/pdf/2006.09638","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2006.09638","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.09638","pdf_url":"https://arxiv.org/pdf/2006.09638","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1518216598","display_name":null,"funder_award_id":"CCF-1814629","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2499887605","display_name":null,"funder_award_id":"DGE-1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5155150688","display_name":null,"funder_award_id":"CCF-1844628","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035832794.pdf","grobid_xml":"https://content.openalex.org/works/W3035832794.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969496346","https://openalex.org/W1982063824","https://openalex.org/W1992626439","https://openalex.org/W2018047324","https://openalex.org/W2913243214","https://openalex.org/W2963706835","https://openalex.org/W2964352239","https://openalex.org/W2975971390","https://openalex.org/W2977030270","https://openalex.org/W3020825378","https://openalex.org/W3023838981","https://openalex.org/W6639193275","https://openalex.org/W6679154944","https://openalex.org/W6684012599","https://openalex.org/W6741764668","https://openalex.org/W6742061381","https://openalex.org/W6748342376","https://openalex.org/W6748626757","https://openalex.org/W6754358263","https://openalex.org/W6754736212"],"related_works":[],"abstract_inverted_index":{"Gradient":[0],"codes":[1,22,48,68,94,182],"use":[2,197],"data":[3,25],"replication":[4,26,106],"to":[5,31,98,163,174],"mitigate":[6],"the":[7,24,33,42,57,75,99,105,111,123,171,175],"effect":[8],"of":[9,44],"straggling":[10],"machines":[11],"in":[12,53,104,122,130],"distributed":[13],"machine":[14],"learning.":[15],"<italic":[16,54],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[17,55],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Approximate":[18],"gradient":[19,35,47,67,100,135,159],"codes</i>":[20],"consider":[21],"where":[23],"factor":[27],"is":[28,39,113],"too":[29],"low":[30],"recover":[32],"full":[34],"exactly.":[36],"Our":[37],"work":[38,51],"motivated":[40],"by":[41],"challenge":[43],"designing":[45],"approximate":[46,66],"that":[49,101,158,167,180,194],"simultaneously":[50],"well":[52],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">both</i>":[56],"adversarial":[58,82,109,154,172],"and":[59,81,189],"random":[60,80,91,124,141,187],"straggler":[61],"models.":[62],"We":[63,73,126,177],"introduce":[64],"novel":[65],"based":[69],"on":[70],"expander":[71],"graphs.":[72],"analyze":[74],"decoding":[76,86,199],"error":[77,97,112,173,185],"both":[78,131],"for":[79,133],"stragglers,":[83,92,110,142,155],"when":[84],"optimal":[85,198],"coefficients":[87],"are":[88],"used.":[89],"With":[90,108,140,153],"our":[93,143,181],"achieve":[95,183],"an":[96],"decays":[102],"exponentially":[103],"factor.":[107],"smaller":[114],"than":[115,192],"any":[116],"existing":[117],"code":[118],"with":[119,170,186],"similar":[120],"performance":[121],"setting.":[125],"prove":[127],"convergence":[128,144],"bounds":[129],"settings":[132],"coded":[134],"descent":[136,160],"under":[137],"standard":[138],"assumptions.":[139],"rate":[145],"improves":[146],"upon":[147],"rates":[148],"obtained":[149],"via":[150],"black-box":[151],"approaches.":[152],"we":[156],"show":[157],"converges":[161],"down":[162],"a":[164],"noise":[165],"floor":[166],"scales":[168],"linearly":[169],"gradient.":[176],"demonstrate":[178],"empirically":[179],"near-optimal":[184],"stragglers":[188],"converge":[190],"faster":[191],"algorithms":[193],"do":[195],"not":[196],"coefficients.":[200]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2020-06-25T00:00:00"}