{"id":"https://openalex.org/W2935717345","doi":"https://doi.org/10.1109/isit.2018.8437887","title":"Gradient Coding Using the Stochastic Block Model","display_name":"Gradient Coding Using the Stochastic Block Model","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2935717345","doi":"https://doi.org/10.1109/isit.2018.8437887","mag":"2935717345"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5034877995","display_name":"Zachary Charles","orcid":"https://orcid.org/0000-0001-8997-874X"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zachary Charles","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, 53706","Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, 53706","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018630988","display_name":"Dimitris Papailiopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitris Papailiopoulos","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, 53706","Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, 53706","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034877995"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":2.2804,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91170888,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1998","last_page":"2002"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9952999949455261,"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/computer-science","display_name":"Computer science","score":0.7772870063781738},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.7102598547935486},{"id":"https://openalex.org/keywords/stochastic-block-model","display_name":"Stochastic block model","score":0.6639866828918457},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5566316246986389},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4807467460632324},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.48002567887306213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4553031325340271},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4376101493835449},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43035611510276794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40846502780914307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22772449254989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14696228504180908},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.11495974659919739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7772870063781738},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.7102598547935486},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.6639866828918457},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5566316246986389},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4807467460632324},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.48002567887306213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4553031325340271},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4376101493835449},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43035611510276794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40846502780914307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22772449254989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14696228504180908},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.11495974659919739},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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":24,"referenced_works":["https://openalex.org/W1590460147","https://openalex.org/W1903497807","https://openalex.org/W1974967023","https://openalex.org/W2137198385","https://openalex.org/W2168231600","https://openalex.org/W2219655028","https://openalex.org/W2343350230","https://openalex.org/W2556205507","https://openalex.org/W2559839022","https://openalex.org/W2567951755","https://openalex.org/W2752512710","https://openalex.org/W2769892987","https://openalex.org/W2804051407","https://openalex.org/W2963290814","https://openalex.org/W3111898548","https://openalex.org/W4236536374","https://openalex.org/W4293449910","https://openalex.org/W4293461068","https://openalex.org/W4301515685","https://openalex.org/W4302423127","https://openalex.org/W6639528875","https://openalex.org/W6684859321","https://openalex.org/W6730190955","https://openalex.org/W6744307745"],"related_works":["https://openalex.org/W2895097035","https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W3020853991","https://openalex.org/W4362706668","https://openalex.org/W4231621013","https://openalex.org/W3171021120","https://openalex.org/W3008318776"],"abstract_inverted_index":{"Gradient":[0,59],"descent":[1],"and":[2,24,118],"its":[3],"many":[4],"variants,":[5],"including":[6],"mini-batch":[7],"stochastic":[8,98,108,139],"gradient":[9,29,78,103],"descent,":[10],"form":[11],"the":[12,22,67,97,107,135],"algorithmic":[13,72],"foundation":[14],"of":[15,26,69],"modern":[16,27],"large-scale":[17],"machine":[18],"learning.":[19],"Due":[20],"to":[21,84,89],"size":[23],"scale":[25],"data,":[28],"computations":[30],"are":[31,54,115],"often":[32],"distributed":[33,40],"across":[34],"multiple":[35,136],"compute":[36],"nodes.":[37],"Unfortunately,":[38],"such":[39],"implementations":[41],"can":[42,80],"face":[43],"significant":[44],"delays":[45],"caused":[46],"by":[47],"straggler":[48,124],"nodes,":[49],"i.":[50],"e.,":[51],"nodes":[52],"that":[53,113,119],"much":[55],"slower":[56],"than":[57],"average.":[58],"coding":[60],"is":[61],"a":[62,102,131],"new":[63],"technique":[64],"for":[65],"mitigating":[66],"effect":[68],"stragglers":[70],"via":[71],"redundancy.":[73],"While":[74],"effective,":[75],"previously":[76],"proposed":[77],"codes":[79],"be":[81],"computationally":[82],"expensive":[83],"construct,":[85],"inaccurate,":[86],"or":[87],"susceptible":[88],"adversarial":[90,123],"stragglers.":[91],"In":[92],"this":[93],"work,":[94],"we":[95],"present":[96],"block":[99,109,138],"code":[100,104],"(SBC),":[101],"based":[105],"on":[106],"model.":[110,141],"We":[111],"show":[112],"SBCs":[114],"efficient,":[116],"accurate,":[117],"under":[120],"certain":[121],"settings,":[122],"selection":[125],"becomes":[126],"as":[127,129],"hard":[128],"detecting":[130],"community":[132],"structure":[133],"in":[134],"community,":[137],"graph":[140]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}