{"id":"https://openalex.org/W4415367645","doi":"https://doi.org/10.1109/isit63088.2025.11195507","title":"Approximate Gradient Coding Using Convex Optimization","display_name":"Approximate Gradient Coding Using Convex Optimization","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367645","doi":"https://doi.org/10.1109/isit63088.2025.11195507"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5120072400","display_name":"Sifat Munim","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sifat Munim","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5120072400"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.6666,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89113209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9383000135421753,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9383000135421753,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9290000200271606,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5881999731063843},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5271999835968018},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4943999946117401},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4878000020980835},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47189998626708984},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4584999978542328},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.44429999589920044},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.40880000591278076}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5881999731063843},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5271999835968018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5181000232696533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49810001254081726},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4943999946117401},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4878000020980835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47929999232292175},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4584999978542328},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.40880000591278076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40139999985694885},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4000000059604645},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.39239999651908875},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.37459999322891235},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.31529998779296875},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.314300000667572},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.2761000096797943},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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":10,"referenced_works":["https://openalex.org/W2018047324","https://openalex.org/W2083842231","https://openalex.org/W2134711723","https://openalex.org/W2964323106","https://openalex.org/W2977030270","https://openalex.org/W3035832794","https://openalex.org/W4206196235","https://openalex.org/W4229706427","https://openalex.org/W4250589301","https://openalex.org/W4285230246"],"related_works":[],"abstract_inverted_index":{"In":[0,160],"distributed":[1,121],"large":[2],"scale":[3],"ML":[4],"training,":[5],"the":[6,13,25,42,50,56,93,101,113,131,137,145,156,191],"problem":[7],"is":[8,107,126],"typically":[9],"one":[10],"of":[11,41,49,83,89,115,133,158,207],"minimizing":[12],"empirical":[14],"risk,":[15],"a":[16,31,68,96,108],"loss":[17],"function":[18],"<tex":[19,32,85,90,186],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[20,33,86,91,187],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L$</tex>":[21,87],"that":[22,110],"depends":[23],"on":[24,55],"training":[26],"dataset":[27,44],"with":[28],"respect":[29],"to":[30,60,67,75,127,136,143,147,174],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>-length":[34],"parameter":[35,69,98],"vector.":[36],"Workers":[37],"are":[38,65,201],"assigned":[39,59],"portions":[40],"original":[43],"and":[45,100,139,180,209],"at":[46],"each":[47],"iteration":[48],"algorithm,":[51],"they":[52],"compute":[53,76],"gradients":[54,64],"data":[57,134],"points":[58,135],"them.":[61],"These":[62],"(partial)":[63],"sent":[66],"server":[70],"(PS)":[71],"which":[72],"aggregates":[73],"them":[74],"either":[77],"an":[78,149],"exact":[79,150],"or":[80,117,151],"approximate":[81,152,165],"version":[82],"\u2207":[84],"(gradient":[88],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L$</tex>)":[92],"PS":[94,146],"generates":[95],"new":[97],"vector":[99],"iterations":[102],"continue":[103],"thereafter.":[104],"Gradient":[105],"coding":[106,167],"technique":[109],"helps":[111],"mitigate":[112],"effect":[114],"slow":[116],"failed":[118],"workers":[119,138,208],"within":[120,130],"training.":[122],"The":[123],"basic":[124],"idea":[125],"introduce":[128],"redundancy":[129],"assignment":[132],"use":[140],"coding-theoretic":[141],"ideas":[142],"allow":[144],"recover":[148],"gradient":[153,166],"even":[154],"in":[155],"presence":[157],"failures.":[159],"this":[161],"work,":[162],"we":[163],"present":[164],"schemes":[168,200],"by":[169,190],"applying":[170],"convex":[171],"optimization":[172],"methods":[173],"structured":[175],"matrices":[176],"such":[177],"as":[178],"circulants":[179],"transition":[181],"matrices.":[182],"For":[183],"low":[184],"complexity":[185],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(O(n))$</tex>":[188],"decoding":[189],"PS,":[192],"our":[193,199],"techniques":[194],"perform":[195],"significantly":[196],"better.":[197],"Furthermore,":[198],"applicable":[202],"for":[203],"any":[204],"given":[205],"number":[206],"computation":[210],"load.":[211]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}