{"id":"https://openalex.org/W7140309812","doi":"https://doi.org/10.48550/arxiv.2603.22514","title":"Communication-Efficient Approximate Gradient Coding","display_name":"Communication-Efficient Approximate Gradient Coding","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140309812","doi":"https://doi.org/10.48550/arxiv.2603.22514"},"language":"en","primary_location":{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/azJ4aZKv","is_oa":true,"landing_page_url":"https://dr.lib.iastate.edu/handle/20.500.12876/azJ4aZKv","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.48550/arXiv.2603.22514","raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.lib.iastate.edu/handle/20.500.12876/azJ4aZKv","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130584906","display_name":"Sifat Munim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Munim, Sifat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramamoorthy, Aditya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9574000239372253,"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.9574000239372253,"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.029200000688433647,"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.0019000000320374966,"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/coding","display_name":"Coding (social sciences)","score":0.5613999962806702},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5551000237464905},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5309000015258789},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4514999985694885},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.43549999594688416},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4287000000476837},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.3944000005722046},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3467999994754791},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.3357999920845032}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5752000212669373},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5613999962806702},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5551000237464905},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5309000015258789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5246999859809875},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.43549999594688416},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3384000062942505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.336899995803833},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3327000141143799},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32339999079704285},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C202286095","wikidata":"https://www.wikidata.org/wiki/Q579262","display_name":"Error function","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C2779582901","wikidata":"https://www.wikidata.org/wiki/Q21013010","display_name":"Distributed learning","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26499998569488525},{"id":"https://openalex.org/C57890076","wikidata":"https://www.wikidata.org/wiki/Q4680725","display_name":"Adaptive coding","level":4,"score":0.26109999418258667},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2556000053882599},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/azJ4aZKv","is_oa":true,"landing_page_url":"https://dr.lib.iastate.edu/handle/20.500.12876/azJ4aZKv","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.48550/arXiv.2603.22514","raw_type":"Preprint"},{"id":"doi:10.48550/arxiv.2603.22514","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22514","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:dr.lib.iastate.edu:20.500.12876/azJ4aZKv","is_oa":true,"landing_page_url":"https://dr.lib.iastate.edu/handle/20.500.12876/azJ4aZKv","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.48550/arXiv.2603.22514","raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5560575127601624}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large-scale":[0],"distributed":[1,24],"learning":[2,44,243],"aims":[3],"at":[4],"minimizing":[5],"a":[6,13,19,29,39,137,195,208,247],"loss":[7],"function":[8],"$L$":[9],"that":[10,41,68,111,157,186,222,241],"depends":[11],"on":[12,179,200],"training":[14],"dataset":[15],"with":[16,169],"respect":[17],"to":[18,47,59,90,98,123,239,246],"$d$-length":[20],"parameter":[21,30],"vector.":[22],"The":[23],"cluster":[25],"typically":[26],"consists":[27],"of":[28,56,82,93,116,126,146,183,204,211,226],"server":[31],"(PS)":[32],"and":[33,62,164,171],"multiple":[34],"workers.":[35,49],"Gradient":[36],"coding":[37,64,86,150],"is":[38],"technique":[40],"makes":[42],"the":[43,54,60,69,80,88,99,103,113,124,129,180,201,223,227,231,242,251],"process":[45],"resilient":[46],"straggling":[48],"It":[50],"introduces":[51],"redundancy":[52],"within":[53,119],"assignment":[55],"data":[57],"points":[58],"workers":[61,89],"uses":[63],"theoretic":[65],"ideas":[66],"so":[67],"PS":[70],"can":[71],"recover":[72],"$\\nabla":[73,117],"L$":[74,118],"exactly":[75],"or":[76],"approximately,":[77],"even":[78],"in":[79,136,189,235],"presence":[81],"stragglers.":[83],"Communication-efficient":[84],"gradient":[85,121,149,229],"allows":[87,237],"communicate":[91],"vectors":[92],"length":[94],"smaller":[95],"than":[96],"$d$":[97],"PS,":[100],"thus":[101],"reducing":[102],"communication":[104],"time.":[105],"While":[106],"there":[107],"have":[108],"been":[109,134],"schemes":[110,153,185],"address":[112],"exact":[114],"recovery":[115],"communication-efficient":[120,147],"coding,":[122],"best":[125],"our":[127,184,212,256],"knowledge":[128],"approximate":[130,148],"variant":[131],"has":[132],"not":[133],"considered":[135],"systematic":[138],"manner.":[139],"In":[140],"this":[141],"work":[142],"we":[143,193,220],"present":[144],"constructions":[145],"schemes.":[151],"Our":[152],"use":[154],"structured":[155],"matrices":[156],"arise":[158],"from":[159],"bipartite":[160],"graphs,":[161,167],"combinatorial":[162],"designs":[163],"strongly":[165],"regular":[166],"along":[168],"randomization":[170],"algebraic":[172],"constraints.":[173],"We":[174],"derive":[175,194],"analytical":[176],"upper":[177],"bounds":[178],"approximation":[181,202],"error":[182,203],"are":[187],"tight":[188],"certain":[190],"cases.":[191],"Moreover,":[192],"corresponding":[196],"worst-case":[197],"lower":[198],"bound":[199],"any":[205],"scheme.":[206],"For":[207],"large":[209],"class":[210],"methods,":[213],"under":[214],"reasonable":[215],"probabilistic":[216],"worker":[217],"failure":[218],"models,":[219],"show":[221],"expected":[224],"value":[225],"computed":[228],"equals":[230],"true":[232],"gradient.":[233],"This":[234],"turn":[236],"us":[238],"prove":[240],"algorithm":[244],"converges":[245],"stationary":[248],"point":[249],"over":[250],"iterations.":[252],"Numerical":[253],"experiments":[254],"corroborate":[255],"theoretical":[257],"findings.":[258]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-26T00:00:00"}