{"id":"https://openalex.org/W3198850677","doi":"https://doi.org/10.1109/isit45174.2021.9518059","title":"Coded sparse matrix computation schemes that leverage partial stragglers","display_name":"Coded sparse matrix computation schemes that leverage partial stragglers","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3198850677","doi":"https://doi.org/10.1109/isit45174.2021.9518059","mag":"3198850677"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518059","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/A5029951257","display_name":"Anindya Bijoy Das","orcid":"https://orcid.org/0000-0002-3615-7400"},"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":"Anindya Bijoy Das","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA,50011","Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA,50011","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","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,USA,50011","Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA,50011","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029951257"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":2.0683,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87465417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1570","last_page":"1575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"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.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7480626702308655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6924612522125244},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.6395986676216125},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6383255124092102},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6132539510726929},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6009529232978821},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5578095316886902},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5221489071846008},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5099371671676636},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45490890741348267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35896027088165283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19450300931930542},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.07053947448730469},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.058338016271591187}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7480626702308655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6924612522125244},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.6395986676216125},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6383255124092102},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6132539510726929},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6009529232978821},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5578095316886902},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5221489071846008},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5099371671676636},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45490890741348267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35896027088165283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19450300931930542},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.07053947448730469},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.058338016271591187},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9518059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518059","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":[{"score":0.47999998927116394,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G2920235459","display_name":null,"funder_award_id":"CCF-1718470,CCF-1910840","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1979946760","https://openalex.org/W2268702383","https://openalex.org/W2556205507","https://openalex.org/W2741736887","https://openalex.org/W2784935051","https://openalex.org/W2787606899","https://openalex.org/W2798525132","https://openalex.org/W2891780733","https://openalex.org/W2901745114","https://openalex.org/W2962208489","https://openalex.org/W2962850796","https://openalex.org/W2963117124","https://openalex.org/W2963347140","https://openalex.org/W2963461717","https://openalex.org/W2964229375","https://openalex.org/W2976645076","https://openalex.org/W2993649261","https://openalex.org/W3098226281","https://openalex.org/W3100515187","https://openalex.org/W3108697863","https://openalex.org/W3111337301","https://openalex.org/W3125070457","https://openalex.org/W3179083954","https://openalex.org/W3197921686","https://openalex.org/W3198850677","https://openalex.org/W4289543135","https://openalex.org/W6738835244","https://openalex.org/W6742061381","https://openalex.org/W6747961934","https://openalex.org/W6763615600","https://openalex.org/W6786857628"],"related_works":["https://openalex.org/W3203142394","https://openalex.org/W2161474341","https://openalex.org/W4302615923","https://openalex.org/W1974101135","https://openalex.org/W2351061015","https://openalex.org/W2001342884","https://openalex.org/W128997104","https://openalex.org/W2595503355","https://openalex.org/W1928489786","https://openalex.org/W2163027735"],"abstract_inverted_index":{"Coded":[0],"matrix":[1],"computation":[2,70,99,123],"utilizes":[3],"concepts":[4],"from":[5],"erasure":[6],"coding":[7,109],"to":[8,66,96,127],"mitigate":[9],"the":[10,18,56,79,106,115,121,137],"effect":[11],"of":[12,53,55,108],"slow":[13,74],"worker":[14,69,122],"nodes":[15,75],"(stragglers)":[16],"in":[17,33,113,132,136],"distributed":[19],"setting.":[20],"While":[21],"this":[22,38,64,88],"is":[23,111],"useful,":[24],"there":[25],"are":[26],"issues":[27],"with":[28],"applying,":[29],"e.g.,":[30],"MDS":[31,46],"codes":[32,47],"a":[34],"straightforward":[35],"manner":[36],"for":[37],"problem.":[39],"Several":[40],"practical":[41],"scenarios":[42],"involve":[43],"sparse":[44],"matrices.":[45],"typically":[48],"require":[49],"dense":[50],"linear":[51],"combinations":[52],"submatrices":[54],"original":[57],"matrices":[58],"which":[59],"destroy":[60],"their":[61],"inherent":[62],"sparsity;":[63],"leads":[65],"significantly":[67,119],"higher":[68],"times.":[71],"Moreover,":[72],"treating":[73],"as":[76,125],"erasures":[77],"ignores":[78],"potentially":[80],"useful":[81],"partial":[82,98],"computations":[83],"performed":[84],"by":[85,100],"them.":[86],"In":[87],"work":[89],"we":[90],"present":[91],"schemes":[92],"that":[93,110],"allow":[94],"us":[95],"leverage":[97],"stragglers":[101],"while":[102],"imposing":[103],"constraints":[104],"on":[105],"level":[107],"required":[112],"generating":[114],"encoded":[116],"submatrices.":[117],"This":[118],"reduces":[120],"time":[124],"compared":[126],"previous":[128],"approaches":[129],"and":[130],"results":[131],"improved":[133],"numerical":[134,141],"stability":[135],"decoding":[138],"process.":[139],"Exhaustive":[140],"experiments":[142],"support":[143],"our":[144],"findings.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}