{"id":"https://openalex.org/W4415367191","doi":"https://doi.org/10.1109/isit63088.2025.11195640","title":"General Coded Computing in a Probabilistic Straggler Regime","display_name":"General Coded Computing in a Probabilistic Straggler Regime","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367191","doi":"https://doi.org/10.1109/isit63088.2025.11195640"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195640","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/A5093895512","display_name":"Parsa Moradi","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Parsa Moradi","raw_affiliation_strings":["University of Minnesota,Minneapolis,MN,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113662214","display_name":"Mohammad Ali Maddah-Ali","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Ali Maddah-Ali","raw_affiliation_strings":["University of Minnesota,Minneapolis,MN,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":4.9421,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.95937289,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9781000018119812,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9781000018119812,"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/server","display_name":"Server","score":0.6669999957084656},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.57669997215271},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.476500004529953},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4690000116825104},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44350001215934753},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4059999883174896},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.33820000290870667},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.3257000148296356}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7562000155448914},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6669999957084656},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.57669997215271},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3935999870300293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38749998807907104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32659998536109924},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.28870001435279846},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C183322885","wikidata":"https://www.wikidata.org/wiki/Q17007702","display_name":"Context model","level":3,"score":0.25920000672340393},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2587999999523163},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195640","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":[{"id":"https://openalex.org/G3538397398","display_name":"CIF: Small: Coding for Reliable Distributed Learning: Revamping the Design Principles","funder_award_id":"2348638","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1608480862","https://openalex.org/W1985866648","https://openalex.org/W2049897010","https://openalex.org/W2063096395","https://openalex.org/W2068351005","https://openalex.org/W2083469563","https://openalex.org/W2112796928","https://openalex.org/W2140170995","https://openalex.org/W2153645832","https://openalex.org/W2784935051","https://openalex.org/W2962208489","https://openalex.org/W2963117124","https://openalex.org/W3080407940","https://openalex.org/W3086858324","https://openalex.org/W3119375995","https://openalex.org/W3201321905","https://openalex.org/W4244201873","https://openalex.org/W4298876635","https://openalex.org/W4405846658","https://openalex.org/W4415367191"],"related_works":[],"abstract_inverted_index":{"Coded":[0,132,137],"computing":[1,12,17,48,52,128],"has":[2],"demonstrated":[3],"promising":[4],"results":[5,71,181,227],"in":[6,10,98,199,214],"addressing":[7],"straggler":[8,111,143],"resiliency":[9],"distributed":[11],"systems.":[13],"However,":[14,198],"most":[15],"coded":[16,47,103,127],"schemes":[18,38,49],"are":[19,39,228],"designed":[20],"for":[21,50,152],"exact":[22,55],"computation,":[23,61],"requiring":[24],"the":[25,67,78,99,120,141,148,187,193,203,210,218],"number":[26,188,195,205],"of":[27,69,77,101,115,123,161,189,196,206,212],"responding":[28],"servers":[29,213],"to":[30,41,73,88,157,221,223],"exceed":[31],"a":[32,94,110],"certain":[33],"recovery":[34],"threshold.":[35],"Additionally,":[36],"these":[37,65],"tailored":[40],"highly":[42],"structured":[43],"functions.":[44],"Recently,":[45],"new":[46,84],"general":[51,102,126],"functions,":[53],"where":[54,105],"computation":[56],"is":[57,176],"replaced":[58],"with":[59,112,192],"approximate":[60],"have":[62],"emerged.":[63],"In":[64],"schemes,":[66],"availability":[68],"additional":[70],"leads":[72],"more":[74],"accurate":[75],"estimations":[76],"computational":[79,234],"tasks.":[80],"This":[81,91,175],"flexibility":[82],"introduces":[83],"questions":[85],"that":[86,147],"need":[87],"be":[89],"addressed.":[90],"paper":[92],"considers":[93],"practically":[95],"important":[96],"scenario":[97],"context":[100],"computing,":[104],"each":[106],"server":[107],"may":[108],"become":[109],"probability$p$,":[113],"independently":[114],"others.":[116],"We":[117],"theoretically":[118],"analyze":[119],"approximation":[121,150,219],"error":[122,151,220],"two":[124],"existing":[125],"schemes:":[129],"Berrut":[130],"Approximate":[131],"Computing":[133,138],"(BACC)":[134],"and":[135,154],"Learning-Theoretic":[136],"(LeTCC).":[139],"Under":[140],"probabilistic":[142],"configuration,":[144],"we":[145],"demonstrate":[146],"average":[149,204],"BACC":[153],"LeTCC":[155],"converges":[156],"zero":[158],"at":[159,162],"rates":[160],"least$\\mathcal{O}\\left(\\log":[163],"_{1":[164,169],"/":[165,170],"p}^{4}(N)":[166],"\\cdot":[167,172],"N^{-2}\\right)$and$\\mathcal{O}\\left(\\log":[168],"p}^{3}(N)":[171],"N^{-3}\\right)$,":[173],"respectively.":[174],"perhaps":[177],"surprising,":[178],"as":[179],"earlier":[180],"do":[182],"not":[183],"indicate":[184],"convergence":[185],"when":[186],"stragglers":[190,207,216],"scales":[191],"total":[194],"servers$N$.":[197],"this":[200],"case,":[201],"despite":[202],"being$N":[208],"p$,":[209],"independence":[211],"becoming":[215],"allows":[217],"converge":[222],"zero.":[224],"These":[225],"theoretical":[226],"validated":[229],"through":[230],"experiments":[231],"on":[232],"various":[233],"tasks,":[235],"including":[236],"deep":[237],"neural":[238],"networks.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-21T00:00:00"}