{"id":"https://openalex.org/W2975129043","doi":"https://doi.org/10.1109/isit.2019.8849245","title":"Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation","display_name":"Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975129043","doi":"https://doi.org/10.1109/isit.2019.8849245","mag":"2975129043"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5033018704","display_name":"Qian Yu","orcid":"https://orcid.org/0000-0002-2034-5941"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qian Yu","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 90089, USA","Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 90089, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047191296","display_name":"A. Salman Avestimehr","orcid":"https://orcid.org/0000-0003-3102-0867"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Salman Avestimehr","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 90089, USA","Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 90089, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033018704"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":1.6802,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88469603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1102","last_page":"1106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","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/T10764","display_name":"Privacy-Preserving Technologies in Data","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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9997000098228455,"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/computation","display_name":"Computation","score":0.5975858569145203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5787758231163025},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.5580567717552185},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5351660251617432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47031843662261963},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46887660026550293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3167417049407959}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5975858569145203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5787758231163025},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.5580567717552185},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5351660251617432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47031843662261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46887660026550293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3167417049407959},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":12,"referenced_works":["https://openalex.org/W623540216","https://openalex.org/W1971991172","https://openalex.org/W2141420453","https://openalex.org/W2173213060","https://openalex.org/W2701059868","https://openalex.org/W2766831133","https://openalex.org/W2806273311","https://openalex.org/W2908477164","https://openalex.org/W2963256807","https://openalex.org/W2975129043","https://openalex.org/W6752557422","https://openalex.org/W6758469878"],"related_works":["https://openalex.org/W2753380948","https://openalex.org/W2330050861","https://openalex.org/W2332136239","https://openalex.org/W2952544681","https://openalex.org/W2376429153","https://openalex.org/W2050804392","https://openalex.org/W3035687845","https://openalex.org/W1997434166","https://openalex.org/W3215447918","https://openalex.org/W2766354467"],"abstract_inverted_index":{"We":[0,52],"consider":[1],"the":[2,19,22,28,40,64,99,103,109,121,127,137,145],"problem":[3],"of":[4,10,21,30,37,39,68,102,111,123,139],"distributedly":[5],"computing":[6,74,100],"a":[7,132,156],"general":[8],"class":[9],"functions,":[11],"referred":[12],"to":[13,105,144],"as":[14,35,82,108],"gradient-type":[15,60,158],"computation,":[16],"while":[17,62],"maintaining":[18],"privacy":[20],"input":[23],"dataset.":[24],"Gradient-type":[25],"computation":[26],"evaluates":[27],"sum":[29,110],"some":[31,115],"\"partial":[32],"gradients\",":[33],"defined":[34],"polynomials":[36],"subsets":[38],"input.":[41],"It":[42,97],"underlies":[43],"many":[44],"algorithms":[45],"in":[46,126],"machine":[47],"learning":[48],"and":[49,86,114],"data":[50],"analytics.":[51],"propose":[53],"Harmonic":[54,70,140],"Coding,":[55,141],"which":[56,118],"universally":[57],"computes":[58],"any":[59],"function,":[61],"requiring":[63],"minimum":[65],"possible":[66],"number":[67],"workers.":[69],"Coding":[71],"strictly":[72],"improves":[73],"schemes":[75,146],"developed":[76],"based":[77,154],"on":[78,155],"prior":[79],"works,":[80],"such":[81],"Shamir's":[83],"secret":[84],"sharing":[85],"Lagrange":[87],"Coded":[88],"Computing,":[89],"by":[90],"injecting":[91],"coded":[92],"redundancy":[93],"using":[94],"harmonic":[95],"progression.":[96],"enables":[98],"results":[101],"workers":[104],"be":[106,152],"interpreted":[107],"partial":[112],"gradients":[113],"redundant":[116],"results,":[117],"then":[119],"allows":[120],"cancellation":[122],"non-gradient":[124],"terms":[125],"decoding":[128],"process.":[129],"By":[130],"proving":[131],"matching":[133],"converse,":[134],"we":[135],"demonstrate":[136],"optimality":[138],"even":[142],"compared":[143],"that":[147],"are":[148],"non-universal":[149],"(i.e.,":[150],"can":[151],"designed":[153],"specific":[157],"function).":[159]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}