{"id":"https://openalex.org/W4388675146","doi":"https://doi.org/10.1109/allerton58177.2023.10313505","title":"Coefficient Complexity in Low-Access Quantized Linear Computations","display_name":"Coefficient Complexity in Low-Access Quantized Linear Computations","publication_year":2023,"publication_date":"2023-09-26","ids":{"openalex":"https://openalex.org/W4388675146","doi":"https://doi.org/10.1109/allerton58177.2023.10313505"},"language":"en","primary_location":{"id":"doi:10.1109/allerton58177.2023.10313505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton58177.2023.10313505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering–Systems,Tel Aviv,Israel","Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering–Systems,Tel Aviv,Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048888817","display_name":"Netanel Raviv","orcid":"https://orcid.org/0000-0002-1686-1994"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Netanel Raviv","raw_affiliation_strings":["Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA","Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering–Systems,Tel Aviv,Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering–Systems,Tel Aviv,Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091221122"],"corresponding_institution_ids":["https://openalex.org/I16391192","https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":0.6043,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72683457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6800374984741211},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6512736082077026},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4975924789905548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47268038988113403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47212252020835876},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4610999524593353},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4428035616874695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4351121187210083},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.4112325608730316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3907450735569},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37801703810691833}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6800374984741211},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6512736082077026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4975924789905548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47268038988113403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47212252020835876},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4610999524593353},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4428035616874695},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4351121187210083},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.4112325608730316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3907450735569},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37801703810691833},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton58177.2023.10313505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton58177.2023.10313505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W599939251","https://openalex.org/W1606480398","https://openalex.org/W2113659224","https://openalex.org/W2171921705","https://openalex.org/W2560674852","https://openalex.org/W2953234766","https://openalex.org/W2962850796","https://openalex.org/W3021481267","https://openalex.org/W4289655165","https://openalex.org/W4297672357","https://openalex.org/W4386057529","https://openalex.org/W6738835244","https://openalex.org/W6742061381","https://openalex.org/W6745591726","https://openalex.org/W6752557422","https://openalex.org/W6776349180","https://openalex.org/W6796828830"],"related_works":["https://openalex.org/W2494338568","https://openalex.org/W1495042958","https://openalex.org/W2122678784","https://openalex.org/W2282510344","https://openalex.org/W139987158","https://openalex.org/W961142965","https://openalex.org/W18819324","https://openalex.org/W2113623403","https://openalex.org/W4377371889","https://openalex.org/W119245487"],"abstract_inverted_index":{"Quantizing":[0],"linear":[1,94],"computations":[2],"over":[3],"the":[4,27,34,72,84,105,127,132,151,155,169,178,187,191],"reals":[5],"is":[6,75],"a":[7,62,138],"common":[8,198],"practice":[9],"in":[10,16,200],"many":[11],"distributed":[12],"systems,":[13],"with":[14,55,96,121],"applications":[15],"efficient,":[17],"private,":[18],"or":[19],"robust":[20],"machine":[21],"learning":[22],"algorithms.":[23],"Recent":[24],"work":[25],"studied":[26],"access":[28,51,107,133],"parameter":[29,129,134],"of":[30,37,100,124,157,160],"such":[31],"computations,":[32],"i.e.,":[33],"maximum":[35],"number":[36,123],"data":[38],"entries":[39],"required":[40],"to":[41,77,91,117,137,149],"accommodate":[42],"any":[43,93,122],"given":[44],"computation.":[45],"It":[46],"was":[47,69],"shown":[48],"that":[49,83],"lower":[50],"can":[52,88],"be":[53,89],"achieved":[54],"higher":[56],"redundancy":[57],"and":[58,61,164,171,182],"vice":[59],"versa,":[60],"corresponding":[63],"scheme":[64,74],"based":[65],"on":[66],"covering":[67],"codes":[68],"given.":[70],"Surprisingly,":[71],"resulting":[73],"universal":[76,115],"all":[78,118],"possible":[79,119,180,189],"two-valued":[80],"quantizations,":[81],"meaning":[82],"same":[85,106],"storage":[86,128],"protocol":[87,116],"used":[90],"retrieve":[92],"combination":[95],"two":[97],"distinct":[98],"coefficients\u2014regardless":[99],"what":[101],"those":[102],"coefficients":[103],"are\u2014with":[104],"parameter.":[108],"In":[109],"this":[110,114],"paper":[111],"we":[112,142],"extend":[113],"quantizations":[120],"values;":[125],"while":[126],"remains":[130],"identical,":[131],"increases":[135],"according":[136],"new":[139],"additive-combinatorics":[140],"property":[141],"call":[143],"coefficient":[144,152,166],"complexity.":[145,173],"We":[146],"then":[147],"turn":[148],"study":[150],"complexity\u2014we":[153],"characterize":[154],"complexity":[156],"small":[158],"sets":[159,167],"coefficients,":[161],"provide":[162],"bounds,":[163],"identify":[165],"having":[168],"highest":[170,188],"lowest":[172,179],"Interestingly,":[174],"arithmetic":[175],"progressions":[176,185],"have":[177,186],"complexity,":[181,190],"some":[183],"geometric":[184],"former":[192],"being":[193],"particularly":[194],"attractive":[195],"for":[196],"its":[197],"use":[199],"uniform":[201],"quantization.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}