{"id":"https://openalex.org/W4415367973","doi":"https://doi.org/10.1109/isit63088.2025.11195544","title":"Optimal Quantization for Matrix Multiplication","display_name":"Optimal Quantization for Matrix Multiplication","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367973","doi":"https://doi.org/10.1109/isit63088.2025.11195544"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5004351362","display_name":"Or Ordentlich","orcid":"https://orcid.org/0000-0002-5791-7923"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Or Ordentlich","raw_affiliation_strings":["Hebrew University of Jerusalem,Computer Science and Engineering,Jerusalem,Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem,Computer Science and Engineering,Jerusalem,Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["MIT,Dept. EECS,Cambridge,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT,Dept. EECS,Cambridge,MA,USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7724,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.92107794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9491000175476074,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9491000175476074,"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/T12702","display_name":"Brain Tumor Detection and Classification","score":0.9458000063896179,"subfield":{"id":"https://openalex.org/subfields/2808","display_name":"Neurology"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11210","display_name":"Mathematical Analysis and Transform Methods","score":0.9235000014305115,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.5958999991416931},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.554099977016449},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5482000112533569},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5257999897003174},{"id":"https://openalex.org/keywords/vector-quantization","display_name":"Vector quantization","score":0.4830000102519989},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.4603999853134155},{"id":"https://openalex.org/keywords/discrete-cosine-transform","display_name":"Discrete cosine transform","score":0.44179999828338623},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.42309999465942383},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7371000051498413},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.5958999991416931},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.554099977016449},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5267000198364258},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5257999897003174},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.4830000102519989},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.4603999853134155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4546000063419342},{"id":"https://openalex.org/C2221639","wikidata":"https://www.wikidata.org/wiki/Q2877","display_name":"Discrete cosine transform","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38179999589920044},{"id":"https://openalex.org/C195906000","wikidata":"https://www.wikidata.org/wiki/Q1191722","display_name":"Matrix exponential","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C94835093","wikidata":"https://www.wikidata.org/wiki/Q3113333","display_name":"Data compression ratio","level":5,"score":0.2824000120162964},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.28110000491142273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2743000090122223},{"id":"https://openalex.org/C69044650","wikidata":"https://www.wikidata.org/wiki/Q2739329","display_name":"Square matrix","level":4,"score":0.2554999887943268},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G183549983","display_name":null,"funder_award_id":"1641/21","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G2986150951","display_name":"Collaborative Research: CIF: Small: Low-Complexity Algorithms for Unsourced Multiple Access and Compressed Sensing in Large Dimensions","funder_award_id":"2131115","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/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1512015702","https://openalex.org/W1984810686","https://openalex.org/W1985952257","https://openalex.org/W2012833704","https://openalex.org/W2035476608","https://openalex.org/W2036845965","https://openalex.org/W2042465463","https://openalex.org/W2109053700","https://openalex.org/W2124317079","https://openalex.org/W2162006472","https://openalex.org/W2201600774","https://openalex.org/W2564985867","https://openalex.org/W2784935051","https://openalex.org/W2963122961","https://openalex.org/W3108353645","https://openalex.org/W3202306058","https://openalex.org/W4237963784","https://openalex.org/W4244670803","https://openalex.org/W4302010773","https://openalex.org/W4390098349","https://openalex.org/W4390575692","https://openalex.org/W4401692979","https://openalex.org/W4406168614","https://openalex.org/W4415367973","https://openalex.org/W4415368924"],"related_works":[],"abstract_inverted_index":{"Recent":[0],"work":[1],"in":[2,220],"machine":[3],"learning":[4],"community":[5],"proposed":[6],"multiple":[7],"methods":[8],"for":[9,21,129,155,197],"performing":[10],"lossy":[11],"compression":[12,56],"(quantization)":[13],"of":[14,27,38,53,76,86,121,127,132,152,159,162,200,215],"large":[15,28],"matrices.":[16],"This":[17],"quantization":[18,47],"is":[19,32,58,82,218],"important":[20],"accelerating":[22],"matrix":[23,70,104,198],"multiplication":[24,199],"(main":[25],"component":[26],"language":[29],"models),":[30],"which":[31,204],"often":[33],"bottlenecked":[34],"by":[35,99],"the":[36,51,65,100,117,130,182,194],"speed":[37],"loading":[39],"these":[40,54],"matrices":[41,66,178],"from":[42],"memory.":[43],"Unlike":[44],"classical":[45],"vector":[46],"and":[48,185],"rate-distortion":[49,195],"theory,":[50],"goal":[52],"new":[55],"algorithms":[57],"to":[59,62,84,102],"be":[60],"able":[61],"approximate":[63],"not":[64],"themselves,":[67],"but":[68],"their":[69],"product.":[71],"Specifically,":[72],"given":[73],"a":[74,112,125,141],"pair":[75,158],"real":[77],"matrices$A,":[78,133],"B$an":[79],"encoder":[80],"(compressor)":[81],"applied":[83],"each":[85],"them":[87],"independently":[88],"producing":[89],"descriptions":[90],"with$R$bits":[91],"per":[92],"entry.":[93],"These":[94],"representations":[95],"subsequently":[96],"are":[97],"used":[98],"decoder":[101],"estimate":[103],"product$A^{\\top}":[105],"B$.":[106],"In":[107,190],"this":[108,122,216],"work,":[109],"we":[110,139,192],"provide":[111],"non-asymptotic":[113],"lower":[114,183],"bound":[115,184],"on":[116,145],"mean":[118],"squared":[119],"error":[120,154],"approximation":[123,153],"(as":[124],"function":[126,196],"rate$R$)":[128],"case":[131],"B$with":[134,171],"iid":[135,176,201],"Gaussian":[136,177,202],"entries.":[137],"Algorithmically,":[138],"construct":[140],"universal":[142],"quantizer":[143,180],"based":[144],"nested":[146],"lattices":[147],"with":[148],"an":[149,206],"explicit":[150],"guarantee":[151],"any":[156],"(non-random)":[157],"matrices$A$,$B$in":[160],"terms":[161],"only":[163],"Frobenius":[164],"norms$\\vert\\bar{A}\\vert_{F},\\vert\\bar{B}\\vert_{F}$and$\\left\\vert\\bar{A}^{\\top}":[165],"\\bar{B}\\right\\vert_{F}$,":[166],"where$\\bar{A},":[167],"\\bar{B}$are":[168],"versions":[169],"of$A,":[170],"zerocentered":[172],"columns,":[173],"respectively.":[174],"For":[175],"our":[179],"achieves":[181],"is,":[186],"thus,":[187],"asymptotically":[188],"optimal.":[189],"particular,":[191],"derive":[193],"matrices,":[203],"exhibits":[205],"interesting":[207],"phase-transition":[208],"at$R":[209],"\\approx":[210],"0.906$bit/entry.":[211],"An":[212],"extended":[213],"version":[214],"paper":[217],"available":[219],"[1].":[221]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-21T00:00:00"}