{"id":"https://openalex.org/W3198234692","doi":"https://doi.org/10.1109/tit.2021.3139009","title":"Computational Polarization: An Information-Theoretic Method for Resilient Computing","display_name":"Computational Polarization: An Information-Theoretic Method for Resilient Computing","publication_year":2021,"publication_date":"2021-12-27","ids":{"openalex":"https://openalex.org/W3198234692","doi":"https://doi.org/10.1109/tit.2021.3139009","mag":"3198234692"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2021.3139009","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2021.3139009","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5001436196","display_name":"Mert Pilanc\u0131","orcid":"https://orcid.org/0000-0002-0870-9992"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mert Pilanci","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0870-9992","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001436196"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.3038,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59645782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"68","issue":"4","first_page":"2211","last_page":"2238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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.998199999332428,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5816588401794434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5682487487792969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5292021036148071},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5177135467529297},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.497254878282547},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.46652325987815857},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4306579828262329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3293952941894531}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5816588401794434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5682487487792969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5292021036148071},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5177135467529297},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.497254878282547},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.46652325987815857},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4306579828262329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3293952941894531},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2021.3139009","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2021.3139009","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G3678449901","display_name":null,"funder_award_id":"IIS-1838179","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4864293789","display_name":null,"funder_award_id":"ECCS-2037304","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5346705942","display_name":null,"funder_award_id":"DMS-2134248","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"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W33428999","https://openalex.org/W649943522","https://openalex.org/W1460189015","https://openalex.org/W1558438642","https://openalex.org/W1582706191","https://openalex.org/W1606480398","https://openalex.org/W1814707006","https://openalex.org/W1989008275","https://openalex.org/W2039206224","https://openalex.org/W2055534149","https://openalex.org/W2097415784","https://openalex.org/W2099111195","https://openalex.org/W2117278512","https://openalex.org/W2142901448","https://openalex.org/W2150498905","https://openalex.org/W2169017678","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2210387432","https://openalex.org/W2268702383","https://openalex.org/W2491833456","https://openalex.org/W2757498728","https://openalex.org/W2798525132","https://openalex.org/W2798985410","https://openalex.org/W2962850796","https://openalex.org/W2963060476","https://openalex.org/W2963459305","https://openalex.org/W2993613295","https://openalex.org/W3034552778","https://openalex.org/W3100515187","https://openalex.org/W3102122722","https://openalex.org/W3103183085","https://openalex.org/W3124716731","https://openalex.org/W4205855417","https://openalex.org/W4253691546","https://openalex.org/W4285068601","https://openalex.org/W4287759387","https://openalex.org/W6633304335","https://openalex.org/W6687322159","https://openalex.org/W6738835244","https://openalex.org/W6774309501","https://openalex.org/W6779030430","https://openalex.org/W6779799172"],"related_works":["https://openalex.org/W4321064619","https://openalex.org/W2009525028","https://openalex.org/W3203142394","https://openalex.org/W4302615923","https://openalex.org/W2053599029","https://openalex.org/W3011179836","https://openalex.org/W2962925412","https://openalex.org/W2023672523","https://openalex.org/W1974101135","https://openalex.org/W2351061015"],"abstract_inverted_index":{"We":[0,93,124],"introduce":[1],"an":[2,10,23,126],"error":[3],"resilient":[4],"distributed":[5,18],"computing":[6,152],"method":[7,21,78,138],"based":[8],"on":[9,130],"extension":[11],"of":[12,57,134],"the":[13,40,50,55,73,77,96,131,142,148,159],"channel":[14,41,61],"polarization":[15,144],"phenomenon":[16],"to":[17,54,72],"algorithms.":[19],"The":[20],"leverages":[22],"algorithmic":[24],"split":[25,42],"operation":[26,43,48],"that":[27,95,141],"transforms":[28],"two":[29],"identical":[30],"compute":[31,81],"nodes":[32,82],"into":[33],"slow":[34],"and":[35,116,139],"fast":[36],"workers,":[37],"which":[38,88,165],"parallels":[39],"in":[44,60,68,108,121],"Polar":[45],"Codes.":[46],"This":[47],"preserves":[49],"average":[51],"runtime,":[52],"analogous":[53],"conservation":[56],"Shannon":[58],"capacity":[59],"polarization.":[62,92],"By":[63],"leveraging":[64],"a":[65,69,100],"recursive":[66],"construction":[67],"similar":[70],"spirit":[71],"Fast":[74],"Fourier":[75],"Transform,":[76],"synthesizes":[79],"virtual":[80],"with":[83,112],"dispersed":[84],"return":[85],"time":[86,162],"distributions,":[87],"we":[89],"call":[90],"computational":[91,143],"show":[94,140],"runtime":[97,133,150],"distributions":[98,107],"form":[99],"functional":[101],"martingale":[102],"process,":[103],"identify":[104],"their":[105],"limiting":[106],"closed-form":[109],"expressions":[110],"together":[111],"non-asymptotic":[113],"convergence":[114,119],"rates,":[115],"prove":[117],"strong":[118],"results":[120],"Banach":[122],"spaces.":[123],"provide":[125],"information-theoretic":[127],"lower":[128],"bound":[129],"overall":[132],"any":[135],"coded":[136],"computation":[137],"approach":[145],"asymptotically":[146],"achieves":[147],"optimal":[149],"for":[151],"linear":[153,161],"functions.":[154],"An":[155],"important":[156],"advantage":[157],"is":[158,166],"near":[160],"decoding":[163],"procedure,":[164],"significantly":[167],"faster":[168],"than":[169],"Maximum":[170],"Distance":[171],"Separable":[172],"codes.":[173]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}