{"id":"https://openalex.org/W4289655031","doi":"https://doi.org/10.1109/isit50566.2022.9834837","title":"Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander","display_name":"Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655031","doi":"https://doi.org/10.1109/isit50566.2022.9834837"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834837","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5006903412","display_name":"Aviv Adler","orcid":"https://orcid.org/0000-0003-3698-7639"},"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":"Aviv Adler","raw_affiliation_strings":["EECS (MIT),Cambridge,MA,USA","EECS (MIT), Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS (MIT),Cambridge,MA,USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"EECS (MIT), Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071582967","display_name":"Jennifer Tang","orcid":"https://orcid.org/0000-0002-8369-7901"},"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":"Jennifer Tang","raw_affiliation_strings":["EECS (MIT),Cambridge,MA,USA","EECS (MIT), Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS (MIT),Cambridge,MA,USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"EECS (MIT), Cambridge, MA, USA","institution_ids":[]}]},{"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":["EECS (MIT),Cambridge,MA,USA","EECS (MIT), Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS (MIT),Cambridge,MA,USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"EECS (MIT), Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08105615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"162","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9987000226974487,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.498659610748291},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41765788197517395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41717129945755005},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.41525495052337646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3907414376735687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34928473830223083}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.498659610748291},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41765788197517395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41717129945755005},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.41525495052337646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3907414376735687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34928473830223083},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit50566.2022.9834837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834837","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.polymtl.ca:80295","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/80295/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Communication de conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6600000262260437,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1576475658","https://openalex.org/W1686946872","https://openalex.org/W2001968606","https://openalex.org/W2004003571","https://openalex.org/W2018040777","https://openalex.org/W2068071220","https://openalex.org/W2085854859","https://openalex.org/W2089419199","https://openalex.org/W2103723258","https://openalex.org/W2127314673","https://openalex.org/W2132512523","https://openalex.org/W2138570191","https://openalex.org/W2142228262","https://openalex.org/W2171052652","https://openalex.org/W3198737060","https://openalex.org/W4288346545","https://openalex.org/W4313598801","https://openalex.org/W6637108112","https://openalex.org/W6675471587","https://openalex.org/W6680765659","https://openalex.org/W6763653508","https://openalex.org/W7018288791"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"A":[0,46],"number":[1],"of":[2,20,24,71,103,112,182,206],"engineering":[3],"and":[4,9,58,98,145,149,163,189],"scientific":[5],"problems":[6],"require":[7],"representing":[8],"manipulating":[10],"probability":[11],"distributions":[12],"over":[13],"large":[14],"alphabets,":[15,100],"which":[16],"we":[17,156],"may":[18],"think":[19],"as":[21,218,222],"long":[22],"vectors":[23],"reals":[25],"summing":[26],"to":[27,35,50,61,83,115,119,131],"1.":[28],"In":[29],"some":[30],"cases":[31],"it":[32],"is":[33,49,217],"required":[34],"represent":[36],"such":[37],"a":[38,68,107,159,179,186,193],"vector":[39],"with":[40],"only":[41],"b":[42,95,190],"bits":[43],"per":[44],"entry.":[45],"natural":[47],"choice":[48],"partition":[51],"the":[52,101,127,166,198,202,207,214,223],"interval":[53],"[0,1]":[54],"into":[55],"2buniform":[56],"bins":[57],"quantize":[59],"entries":[60],"each":[62],"bin":[63],"independently.":[64],"We":[65],"show":[66,164],"that":[67,165,213],"minor":[69],"modification":[70],"this":[72],"procedure":[73],"\u2013":[74,85],"applying":[75],"an":[76,87],"entrywise":[77],"non-linear":[78],"function":[79],"(compander)":[80],"f(x)":[81],"prior":[82],"quantization":[84,90],"yields":[86],"extremely":[88],"effective":[89],"method.":[91],"For":[92],"example,":[93],"for":[94,137,150,185,197,220,226],"=":[96],"8(16)":[97],"105-sized":[99],"quality":[102],"representation":[104],"improves":[105,126],"from":[106,129],"loss":[108,128,181,200],"(under":[109],"KL":[110],"divergence)":[111],"0.5(0.1)":[113],"bits/entry":[114],"10\u22124(10\u22129)":[116,132],"bits/entry.":[117,133],"Compared":[118],"floating":[120],"point":[121],"representations,":[122],"our":[123],"compander":[124,167],"method":[125],"10\u22121(10\u22126)":[130],"These":[134],"numbers":[135],"hold":[136],"both":[138],"real-world":[139],"data":[140],"(word":[141],"frequencies":[142],"in":[143],"books":[144],"DNA":[146],"k-mer":[147],"counts)":[148],"synthetic":[151],"randomly":[152],"generated":[153],"distributions.":[154],"Theoretically,":[155],"set":[157],"up":[158],"minimax":[160,195],"optimality":[161,205],"criterion":[162,196],"$f(x)":[168],"\\propto":[169],"\\operatorname{ArcSinh}":[170],"(\\sqrt":[171],"{(1/2)(K\\log":[172],"K)x}":[173],")$":[174],"achieves":[175],"near-optimal":[176],"performance,":[177],"attaining":[178],"KL-quantization":[180],"\u224d":[183],"2\u22122blog2K":[184],"K-letter":[187],"alphabet":[188],"\u2192\u221e.":[191],"Interestingly,":[192],"similar":[194],"quadratic":[199,227],"on":[201],"hypercube":[203],"shows":[204],"standard":[208],"uniform":[209,224],"quantizer.":[210],"This":[211],"suggests":[212],"ArcSinh":[215],"quantizer":[216,225],"fundamental":[219],"KL-distortion":[221],"distortion.":[228]},"counts_by_year":[],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}