{"id":"https://openalex.org/W7128047465","doi":"https://doi.org/10.48550/arxiv.2602.05790","title":"Price of universality in vector quantization is at most 0.11 bit","display_name":"Price of universality in vector quantization is at most 0.11 bit","publication_year":2026,"publication_date":"2026-02-05","ids":{"openalex":"https://openalex.org/W7128047465","doi":"https://doi.org/10.48550/arxiv.2602.05790"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.05790","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125256649","display_name":"Alina Harbuzova","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harbuzova, Alina","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124001823","display_name":"Or Ordentlich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ordentlich, Or","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124023891","display_name":"Yury Polyanskiy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Polyanskiy, Yury","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5125256649"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.8112999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.8112999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.03240000084042549,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.031599998474121094,"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/codebook","display_name":"Codebook","score":0.9656999707221985},{"id":"https://openalex.org/keywords/linde\u2013buzo\u2013gray-algorithm","display_name":"Linde\u2013Buzo\u2013Gray algorithm","score":0.847000002861023},{"id":"https://openalex.org/keywords/vector-quantization","display_name":"Vector quantization","score":0.6620000004768372},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.5914000272750854},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5235999822616577},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.4846999943256378}],"concepts":[{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.9656999707221985},{"id":"https://openalex.org/C93372532","wikidata":"https://www.wikidata.org/wiki/Q6552455","display_name":"Linde\u2013Buzo\u2013Gray algorithm","level":3,"score":0.847000002861023},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.6620000004768372},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.5914000272750854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5730999708175659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5688999891281128},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5235999822616577},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3564000129699707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34540000557899475},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3059000074863434},{"id":"https://openalex.org/C62799726","wikidata":"https://www.wikidata.org/wiki/Q190056","display_name":"Hilbert space","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2872999906539917},{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.05790","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.05790","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.05790","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.05790","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Fast":[0],"computation":[1],"of":[2,11,25,34,49,57,64,71,80,85,108,113,147,163,173],"a":[3,9,20,27,61,97,145,164,170,174],"matrix":[4],"product":[5],"$W^\\top":[6],"X$":[7],"is":[8,23,88,101,156,169],"workhorse":[10],"modern":[12,149],"LLMs.":[13],"To":[14],"make":[15],"their":[16],"deployment":[17],"more":[18],"efficient,":[19],"popular":[21],"approach":[22],"that":[24,42,94,100,168],"using":[26],"low-precision":[28,142],"approximation":[29],"$\\widehat":[30],"W$":[31],"in":[32,110,166],"place":[33],"true":[35],"$W$":[36,50],"(\"weight-only":[37],"quantization'').":[38],"Information":[39],"theory":[40],"demonstrates":[41],"an":[43,120,137],"optimal":[44],"algorithm":[45],"for":[46,104,140],"reducing":[47],"precision":[48],"depends":[51],"on":[52,83],"the":[53,81,111,141,153],"(second":[54],"order)":[55],"statistics":[56,84,107],"$X$":[58,72],"and":[59],"requires":[60],"careful":[62],"alignment":[63],"vector":[65],"quantization":[66],"codebook":[67,82,99,123,134],"with":[68,124,177],"PCA":[69],"directions":[70],"(a":[73],"process":[74],"known":[75],"as":[76,117,119],"\"waterfilling":[77],"allocation'').":[78],"Dependence":[79],"$X$,":[86,109],"however,":[87],"highly":[89],"impractical.":[90],"This":[91],"paper":[92],"proves":[93],"there":[95],"exist":[96],"universal":[98,133],"simultaneously":[102,176],"near-optimal":[103],"all":[105,180],"possible":[106],"sense":[112],"being":[114],"at":[115],"least":[116],"good":[118],"$X$-adapted":[121],"waterfilling":[122],"rate":[125],"reduced":[126],"by":[127],"0.11":[128],"bit":[129],"per":[130],"dimension.":[131],"Such":[132],"would":[135],"be":[136],"ideal":[138],"candidate":[139],"storage":[143],"format,":[144],"topic":[146],"active":[148],"research,":[150],"but":[151],"alas":[152],"existence":[154,162],"proof":[155],"non-constructive.":[157],"Equivalently,":[158],"our":[159],"result":[160],"shows":[161],"net":[165],"$\\mathbb{R}^n$":[167],"nearly-optimal":[171],"covering":[172],"sphere":[175],"respect":[178],"to":[179],"Hilbert":[181],"norms.":[182]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}