{"id":"https://openalex.org/W3197511597","doi":"https://doi.org/10.1109/isit45174.2021.9517849","title":"On Gradient Coding with Partial Recovery","display_name":"On Gradient Coding with Partial Recovery","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3197511597","doi":"https://doi.org/10.1109/isit45174.2021.9517849","mag":"3197511597"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517849","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/A5024027451","display_name":"Sahasrajit Sarmasarkar","orcid":"https://orcid.org/0000-0002-6652-4881"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sahasrajit Sarmasarkar","raw_affiliation_strings":["IIT,Department of Electrical Engineering,Bombay,India","Department of Electrical Engineering, IIT, Bombay, India"],"affiliations":[{"raw_affiliation_string":"IIT,Department of Electrical Engineering,Bombay,India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Department of Electrical Engineering, IIT, Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110717612","display_name":"V. Lalitha","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]},{"id":"https://openalex.org/I4210121626","display_name":"Signal Processing (United States)","ror":"https://ror.org/021gzyw51","country_code":"US","type":"company","lineage":["https://openalex.org/I4210121626"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"V. Lalitha","raw_affiliation_strings":["IIIT,Signal Processing &#x0026; Communications Research Center,Hyderabad,India","Signal Processing &#x0026"],"affiliations":[{"raw_affiliation_string":"IIIT,Signal Processing &#x0026; Communications Research Center,Hyderabad,India","institution_ids":["https://openalex.org/I65181880"]},{"raw_affiliation_string":"Signal Processing &#x0026","institution_ids":["https://openalex.org/I4210121626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084509524","display_name":"Nikhil Karamchandani","orcid":"https://orcid.org/0000-0002-7233-0717"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nikhil Karamchandani","raw_affiliation_strings":["IIT,Department of Electrical Engineering,Bombay,India","Department of Electrical Engineering, IIT, Bombay, India"],"affiliations":[{"raw_affiliation_string":"IIT,Department of Electrical Engineering,Bombay,India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Department of Electrical Engineering, IIT, Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024027451"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":1.2237,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83403565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2274","last_page":"2279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"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.9995999932289124,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9821000099182129,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7516846656799316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.637772262096405},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6029849648475647},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6014063358306885},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.571189284324646},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5704465508460999},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4896683990955353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4083392024040222},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3942606449127197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33082348108291626},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1757417619228363}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7516846656799316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.637772262096405},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6029849648475647},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6014063358306885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.571189284324646},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5704465508460999},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4896683990955353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4083392024040222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3942606449127197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33082348108291626},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1757417619228363},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9517849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517849","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":[{"id":"https://metadata.un.org/sdg/8","score":0.6200000047683716,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W114517082","https://openalex.org/W2268702383","https://openalex.org/W2336650964","https://openalex.org/W2556205507","https://openalex.org/W2741736887","https://openalex.org/W2757498728","https://openalex.org/W2769892987","https://openalex.org/W2787128677","https://openalex.org/W2806273311","https://openalex.org/W2901745114","https://openalex.org/W2914855042","https://openalex.org/W2962208489","https://openalex.org/W2962850796","https://openalex.org/W2963256807","https://openalex.org/W2963361660","https://openalex.org/W2963706835","https://openalex.org/W2964095159","https://openalex.org/W2964160151","https://openalex.org/W2964323106","https://openalex.org/W2975971390","https://openalex.org/W2976713597","https://openalex.org/W2977030270","https://openalex.org/W2982443440","https://openalex.org/W2996468493","https://openalex.org/W3015418122","https://openalex.org/W3016249977","https://openalex.org/W3023838981","https://openalex.org/W3039623208","https://openalex.org/W3040094851","https://openalex.org/W3100515187","https://openalex.org/W3103761313","https://openalex.org/W3129895389","https://openalex.org/W3197511597","https://openalex.org/W3212424730","https://openalex.org/W4206267449","https://openalex.org/W4293449910","https://openalex.org/W6604653223","https://openalex.org/W6738835244","https://openalex.org/W6742061381","https://openalex.org/W6748342376","https://openalex.org/W6749257597","https://openalex.org/W6752557422","https://openalex.org/W6759084776","https://openalex.org/W6780501017","https://openalex.org/W6780533011","https://openalex.org/W6790820668"],"related_works":["https://openalex.org/W2212571888","https://openalex.org/W3162204513","https://openalex.org/W2139379087","https://openalex.org/W2020805386","https://openalex.org/W2371138613","https://openalex.org/W2285288187","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2411336269"],"abstract_inverted_index":{"We":[0,115,164],"consider":[1],"a":[2,12,25,119,133,149,172,189,197],"generalization":[3],"of":[4,33,56,67,75,83,89,95,126,144,151,161,174,210,220],"the":[5,34,37,44,49,54,57,61,65,73,76,81,90,101,123,142,159,207],"recently":[6],"proposed":[7],"gradient":[8,112],"coding":[9,113],"framework":[10,46],"where":[11],"large":[13],"dataset":[14],"is":[15,98,223],"divided":[16],"across":[17],"<tex>$n$</tex>":[18,179,214],"workers":[19,162],"and":[20,104,130,148,180],"each":[21,194],"worker":[22,108,195],"transmits":[23,196],"to":[24,41,52,79,99,168,178],"master":[26,50,77],"node":[27,51,78],"one":[28],"or":[29],"more":[30],"linear":[31,199],"combinations":[32],"gradients":[35,58],"over":[36,59],"data":[38,62,152,175,215],"subsets":[39,63],"assigned":[40],"it.":[42],"Unlike":[43],"conventional":[45],"which":[47,135,154,170,187],"requires":[48],"recover":[53],"sum":[55,82],"all":[60],"in":[64,158],"presence":[66],"<tex>$s$</tex>":[68],"straggler":[69],"workers,":[70],"we":[71,201],"relax":[72],"goal":[74,94],"computing":[80],"at":[84,141],"least":[85],"some":[86],"&#x03B1;":[87],"fraction":[88],"gradients.":[91],"The":[92],"broad":[93],"our":[96],"work":[97],"study":[100],"optimal":[102],"computation":[103,124,208],"communication":[105,146,191],"load":[106,125,147,209],"per":[107],"for":[109],"this":[110,137,221],"approximate":[111],"framework.":[114],"begin":[116],"by":[117],"deriving":[118],"lower":[120,138,190,204],"bound":[121],"on":[122,184,206],"any":[127,211],"feasible":[128],"scheme":[129,212],"also":[131,202],"propose":[132,181],"strategy":[134],"achieves":[136],"bound,":[139],"albeit":[140],"cost":[143],"high":[145],"number":[150,160,173],"partitions":[153,176],"can":[155],"be":[156],"polynomial":[157],"n.":[163],"then":[165],"restrict":[166],"attention":[167],"schemes":[169,182],"utilize":[171],"equal":[177],"based":[183],"cyclic":[185],"assignment":[186],"have":[188],"load.":[192],"When":[193],"single":[198],"combination,":[200],"prove":[203],"bounds":[205],"using":[213],"partitions.":[216],"A":[217],"full":[218],"version":[219],"paper":[222],"accessible":[224],"at:":[225],"https://arxiv.org/abs/2102.10163":[226]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}