{"id":"https://openalex.org/W3203232079","doi":"https://doi.org/10.1109/isit45174.2021.9517990","title":"Approximate Gradient Coding with Optimal Decoding","display_name":"Approximate Gradient Coding with Optimal Decoding","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3203232079","doi":"https://doi.org/10.1109/isit45174.2021.9517990","mag":"3203232079"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5039121551","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":["Stanford University,Department of Computer Science","Department of Computer Science, Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University,Department of Computer Science","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022963784","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":["Stanford University,Department of Computer Science and Electrical Engineering","Department of Computer Science and Electrical Engineering, Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University,Department of Computer Science and Electrical Engineering","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039121551"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.14,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5648697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2280","last_page":"2285"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/decoding-methods","display_name":"Decoding methods","score":0.7541358470916748},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6675294041633606},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.6563578248023987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.597531259059906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5706664323806763},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5441147089004517},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.49682286381721497},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4495854377746582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3489304184913635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2904950976371765},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1655735969543457},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14163094758987427},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.08669644594192505}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7541358470916748},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6675294041633606},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.6563578248023987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.597531259059906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5706664323806763},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5441147089004517},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.49682286381721497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4495854377746582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3489304184913635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2904950976371765},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1655735969543457},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14163094758987427},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.08669644594192505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9517990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1861377444","https://openalex.org/W1982063824","https://openalex.org/W1992626439","https://openalex.org/W2127941149","https://openalex.org/W2162287622","https://openalex.org/W2741736887","https://openalex.org/W2769892987","https://openalex.org/W2787128677","https://openalex.org/W2789903762","https://openalex.org/W2804051407","https://openalex.org/W2914855042","https://openalex.org/W2963706835","https://openalex.org/W2964160151","https://openalex.org/W2964261056","https://openalex.org/W2964275427","https://openalex.org/W2964323106","https://openalex.org/W2964352239","https://openalex.org/W2977030270","https://openalex.org/W2996468493","https://openalex.org/W3006610112","https://openalex.org/W3020825378","https://openalex.org/W3023838981","https://openalex.org/W3111898548","https://openalex.org/W4293449910","https://openalex.org/W4293461068","https://openalex.org/W6639193275","https://openalex.org/W6679154944","https://openalex.org/W6742061381","https://openalex.org/W6746024075","https://openalex.org/W6748342376","https://openalex.org/W6748626757","https://openalex.org/W6751781619","https://openalex.org/W6754358263","https://openalex.org/W6759084776"],"related_works":["https://openalex.org/W2895097035","https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4242191701","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W3020853991","https://openalex.org/W4362706668","https://openalex.org/W4231621013","https://openalex.org/W3171021120"],"abstract_inverted_index":{"In":[0,140,184,195],"distributed":[1],"optimization":[2],"problems,":[3],"a":[4,148,208],"technique":[5],"called":[6],"gradient":[7,29,49,61,82,132,176,202],"coding,":[8,30],"which":[9,31,89,239],"involves":[10],"replicating":[11],"data":[12,41,97],"points,":[13],"has":[14,26],"been":[15],"used":[16],"to":[17,45,130,207,218],"mitigate":[18],"the":[19,36,40,47,56,70,101,106,122,131,137,141,144,161,170,185,196,215,219,231,243],"effect":[20],"of":[21,39,58,96,150],"straggling":[22],"machines.":[23],"Recent":[24],"work":[25,52,66],"studied":[27],"approximate":[28,60,81],"concerns":[32],"coding":[33,62],"schemes":[34,63,126,226],"where":[35],"replication":[37,138],"factor":[38,149],"is":[42,53,146],"too":[43],"low":[44],"recover":[46],"full":[48],"exactly.":[50],"Our":[51],"motivated":[54],"by":[55],"challenge":[57],"creating":[59],"that":[64,76,120,133,201,211,224],"simultaneously":[65],"well":[67],"in":[68,88,105,121,136,160,169,230],"both":[69,104,168],"adversarial":[71,109,142,173,197,216],"and":[72,108,172,234],"stochastic":[73],"models.":[74],"To":[75],"end,":[77],"we":[78,199],"introduce":[79],"novel":[80],"codes":[83],"based":[84],"on":[85],"expander":[86],"graphs,":[87],"each":[90],"machine":[91],"receives":[92],"exactly":[93],"two":[94,151],"blocks":[95],"points.":[98],"We":[99,118,164,221],"analyze":[100],"decoding":[102,114,245],"error":[103,129,145,217,229],"random":[107,123,162,171,186,232],"straggler":[110],"setting,":[111,124,143,187,198],"when":[112],"optimal":[113,244],"coefficients":[115],"are":[116],"used.":[117],"show":[119,165,200],"our":[125,182,188,225],"achieve":[127,227],"an":[128],"decays":[134],"exponentially":[135],"factor.":[139],"nearly":[147],"smaller":[152],"than":[153,237],"any":[154],"existing":[155],"code":[156],"with":[157,214],"similar":[158],"performance":[159],"setting.":[163],"convergence":[166,189],"bounds":[167],"setting":[174,233],"for":[175],"descent":[177,203],"under":[178],"standard":[179],"assumptions":[180],"using":[181],"codes.":[183],"rate":[190],"improves":[191],"upon":[192],"block-box":[193],"bounds.":[194],"can":[204],"converge":[205,235],"down":[206],"noise":[209],"floor":[210],"scales":[212],"linearly":[213],"gradient.":[220],"demonstrate":[222],"empirically":[223],"near-optimal":[228],"faster":[236],"algorithms":[238],"do":[240],"not":[241],"use":[242],"coefficients.":[246]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}