{"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":"conference-paper","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":false,"raw_author_name":"Sifat Munim","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011"],"raw_orcid":null,"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"],"raw_orcid":null,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.9814,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87564074,"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,146],"distributed":[1,107],"large":[2],"scale":[3],"ML":[4],"training,":[5],"the":[6,13,21,35,43,49,79,87,99,117,123,131,142,173],"problem":[7],"is":[8,93,112],"typically":[9],"one":[10],"of":[11,34,42,76,101,119,144,189],"minimizing":[12],"empirical":[14],"risk,":[15],"a":[16,61,82,94],"loss":[17],"function$L$that":[18],"depends":[19],"on":[20,48],"training":[22],"dataset":[23,37],"with":[24],"respect":[25],"to":[26,53,60,68,113,122,129,133,160],"a$d$-length":[27],"parameter":[28,62,84],"vector.":[29],"Workers":[30],"are":[31,58,183],"assigned":[32,52],"portions":[33],"original":[36],"and":[38,86,125,166,191],"at":[39],"each":[40],"iteration":[41],"algorithm,":[44],"they":[45],"compute":[46,69],"gradients":[47,57],"data":[50,120],"points":[51,121],"them.":[54],"These":[55],"(partial)":[56],"sent":[59],"server":[63],"(PS)":[64],"which":[65],"aggregates":[66],"them":[67],"either":[70],"an":[71,135],"exact":[72,136],"or":[73,103,137],"approximate":[74,138,151],"version":[75],"\u2207$L$(gradient":[77],"of$L$)":[78],"PS":[80,132],"generates":[81],"new":[83],"vector":[85],"iterations":[88],"continue":[89],"thereafter.":[90],"Gradient":[91],"coding":[92,153],"technique":[95],"that":[96],"helps":[97],"mitigate":[98],"effect":[100],"slow":[102],"failed":[104],"workers":[105,124,190],"within":[106,116],"training.":[108],"The":[109],"basic":[110],"idea":[111],"introduce":[114],"redundancy":[115],"assignment":[118],"use":[126],"coding-theoretic":[127],"ideas":[128],"allow":[130],"recover":[134],"gradient":[139,152],"even":[140],"in":[141],"presence":[143],"failures.":[145],"this":[147],"work,":[148],"we":[149],"present":[150],"schemes":[154,182],"by":[155,172],"applying":[156],"convex":[157],"optimization":[158],"methods":[159],"structured":[161],"matrices":[162],"such":[163],"as":[164],"circulants":[165],"transition":[167],"matrices.":[168],"For":[169],"low":[170],"complexity$(O(n))$decoding":[171],"PS,":[174],"our":[175,181],"techniques":[176],"perform":[177],"significantly":[178],"better.":[179],"Furthermore,":[180],"applicable":[184],"for":[185],"any":[186],"given":[187],"number":[188],"computation":[192],"load.":[193]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-21T00:00:00"}