{"id":"https://openalex.org/W4289655150","doi":"https://doi.org/10.1109/isit50566.2022.9834389","title":"Successive Approximation for Coded Matrix Multiplication","display_name":"Successive Approximation for Coded Matrix Multiplication","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655150","doi":"https://doi.org/10.1109/isit50566.2022.9834389"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834389","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5110852113","display_name":"Shahrzad Kiani","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Shahrzad Kiani","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada","Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029182703","display_name":"Stark C. Draper","orcid":"https://orcid.org/0000-0001-8100-5599"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stark C. Draper","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada","Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110852113"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06763131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"838","last_page":"843"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.9961000084877014,"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.776928186416626},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7273480296134949},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.6796450614929199},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.65106201171875},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5231493711471558},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.5139643549919128},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4242212176322937},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4234654903411865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4177662134170532},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3622894287109375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17265519499778748}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.776928186416626},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7273480296134949},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.6796450614929199},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.65106201171875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5231493711471558},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.5139643549919128},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4242212176322937},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4234654903411865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4177662134170532},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3622894287109375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17265519499778748},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834389","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W2268702383","https://openalex.org/W2588576771","https://openalex.org/W2784935051","https://openalex.org/W2798525132","https://openalex.org/W2806273311","https://openalex.org/W2899664803","https://openalex.org/W2937994169","https://openalex.org/W2962850796","https://openalex.org/W2963117124","https://openalex.org/W2963726510","https://openalex.org/W2964229375","https://openalex.org/W2995947286","https://openalex.org/W3098226281","https://openalex.org/W3100515187","https://openalex.org/W3119375995","https://openalex.org/W3137779858","https://openalex.org/W3161689956","https://openalex.org/W3196704321","https://openalex.org/W3198421519","https://openalex.org/W4233913520","https://openalex.org/W4285507276","https://openalex.org/W6738835244","https://openalex.org/W6752557422","https://openalex.org/W6771809131","https://openalex.org/W6785231947"],"related_works":["https://openalex.org/W1599154403","https://openalex.org/W3099313426","https://openalex.org/W4287593139","https://openalex.org/W752783541","https://openalex.org/W1506547947","https://openalex.org/W1582436825","https://openalex.org/W2995605830","https://openalex.org/W4206811032","https://openalex.org/W2086123442","https://openalex.org/W1925544630"],"abstract_inverted_index":{"Coded":[0],"computing":[1,13,23,33,46],"was":[2],"recently":[3],"introduced":[4],"to":[5,24,48],"mitigate":[6],"the":[7,44,70],"effect":[8],"of":[9,19,61],"stragglers":[10],"on":[11],"distributed":[12,32,45],"systems.":[14],"This":[15],"paper":[16],"combines":[17],"ideas":[18],"approximate":[20],"and":[21,41,80],"coded":[22,31],"further":[25],"accelerate":[26],"computation.":[27,72],"We":[28,73],"propose":[29],"approximated":[30],"(ACDC)":[34],"that":[35,51],"realizes":[36],"a":[37,58],"tradeoff":[38],"between":[39],"accuracy":[40,54],"speed,":[42],"allowing":[43],"system":[47],"produce":[49],"approximations":[50],"increase":[52],"in":[53],"over":[55,85],"time.":[56],"If":[57],"sufficient":[59],"number":[60],"compute":[62],"nodes":[63],"finish":[64],"their":[65],"tasks,":[66],"ACDC":[67],"exactly":[68],"recovers":[69],"desired":[71],"theoretically":[74],"provide":[75],"design":[76],"guidelines":[77],"for":[78],"ACDC,":[79],"numerically":[81],"show":[82],"its":[83],"benefits":[84],"previous":[86],"methods.":[87]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}