{"id":"https://openalex.org/W7219448161","doi":null,"title":"How Much Information Fits in a Vector?","display_name":"How Much Information Fits in a Vector?","publication_year":2026,"publication_date":"2026-08-01","ids":{"openalex":"https://openalex.org/W7219448161"},"language":"en","primary_location":{"id":"pmh:oai:orbilu.uni.lu:10993/69083","doi":null,"is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/69083","pdf_url":"https://orbilu.uni.lu/bitstream/10993/69083/1/main.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"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":"Transactions on Machine Learning Research (2026-08)","raw_type":"http://purl.org/coar/resource_type/c_6501"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/bitstream/10993/69083/1/main.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114369098","display_name":"Christopher Neil Gadzinski","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"GADZINSKI, Christopher","raw_affiliation_strings":["University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011045254","display_name":"Decebal Constantin Mocanu","orcid":"https://orcid.org/0000-0002-5636-7683","observed_orcids":["https://orcid.org/0000-0002-5636-7683"]},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Mocanu, Decebal Constantin","raw_affiliation_strings":["Department of Computer Science University of Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11269","display_name":"Algorithms and Data Compression","score":0.10199999809265137,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.10199999809265137,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13898","display_name":"Diverse Interdisciplinary Research Studies","score":0.0340999998152256,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.026799999177455902,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/neural-network-interpretability","display_name":"neural network interpretability","score":0.8460000157356262},{"id":"https://openalex.org/keywords/sparse-autoencoders","display_name":"sparse autoencoders","score":0.9430000185966492},{"id":"https://openalex.org/keywords/shannon-limit","display_name":"Shannon limit","score":0.6970000267028809},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"compressed sensing","score":0.9010000228881836}],"concepts":[{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.9016000032424927},{"id":"https://openalex.org/C27753989","wikidata":"https://www.wikidata.org/wiki/Q284885","display_name":"Superposition principle","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5360000133514404},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4894999861717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48010000586509705},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.46320000290870667},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.43149998784065247},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41819998621940613},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.391400009393692},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3684999942779541},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.31380000710487366},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C101721835","wikidata":"https://www.wikidata.org/wiki/Q813908","display_name":"Conditional entropy","level":3,"score":0.29339998960494995},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2903999984264374},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C77637269","wikidata":"https://www.wikidata.org/wiki/Q7002051","display_name":"Neural coding","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C51167844","wikidata":"https://www.wikidata.org/wiki/Q4422623","display_name":"Latent variable","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26660001277923584}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:orbilu.uni.lu:10993/69083","doi":null,"is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/69083","pdf_url":"https://orbilu.uni.lu/bitstream/10993/69083/1/main.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"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":"Transactions on Machine Learning Research (2026-08)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/69083","doi":null,"is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/69083","pdf_url":"https://orbilu.uni.lu/bitstream/10993/69083/1/main.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"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":"Transactions on Machine Learning Research (2026-08)","raw_type":"http://purl.org/coar/resource_type/c_6501"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7219448161.pdf","grobid_xml":"https://content.openalex.org/works/W7219448161.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1853900790","https://openalex.org/W1855670903","https://openalex.org/W2020390700","https://openalex.org/W2065321782","https://openalex.org/W2082029531","https://openalex.org/W2088658556","https://openalex.org/W2100556411","https://openalex.org/W2105459687","https://openalex.org/W2115706991","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2138548210","https://openalex.org/W2140610559","https://openalex.org/W2151693816","https://openalex.org/W2160955696","https://openalex.org/W2253993278","https://openalex.org/W2900442071","https://openalex.org/W3010694149","https://openalex.org/W3170470779","https://openalex.org/W4250955649","https://openalex.org/W4283266241","https://openalex.org/W4377694467","https://openalex.org/W4386839891","https://openalex.org/W4399455238","https://openalex.org/W4406949968","https://openalex.org/W4409357153"],"related_works":["https://openalex.org/W7110590918","https://openalex.org/W7110481586","https://openalex.org/W7110556075","https://openalex.org/W2261605007","https://openalex.org/W7110547525","https://openalex.org/W7069786981","https://openalex.org/W7110466278","https://openalex.org/W7110576534","https://openalex.org/W7110567748","https://openalex.org/W7110620780"],"abstract_inverted_index":{"Recent":[0],"work":[1,40,200],"in":[2,48,118,204],"neural":[3],"network":[4],"interpretability":[5,205],"has":[6],"suggested":[7],"that":[8,55,144,183],"hidden":[9],"activations":[10],"of":[11,21,25,32,45,60,71,114,127,148],"some":[12],"deep":[13],"models":[14],"can":[15,82],"be":[16],"viewed":[17],"as":[18,36],"linear":[19],"projections":[20],"much":[22],"higher-dimensional":[23],"vectors":[24],"sparse":[26,80],"latent":[27,116],"\"features.\"In":[28],"general,":[29],"this":[30,199],"kind":[31],"representation":[33],"is":[34,63,91,111,156],"known":[35],"a":[37,49,85,92,138,181],"superposition":[38,46,87],"code.This":[39],"presents":[41],"an":[42,163],"information-theoretic":[43],"account":[44],"codes":[47],"setting":[50],"applicable":[51],"to":[52,67],"interpretability.We":[53],"show":[54,142],"when":[56,89,100,159],"the":[57,68,97,112,115,128,145,168,189],"number":[58,69],"k":[59],"active":[61],"features":[62],"very":[64],"small":[65],"compared":[66],"N":[70,104],"total":[72],"features,":[73],"simple":[74],"inference":[75],"methods":[76],"currently":[77],"used":[78],"by":[79],"autoencoders":[81],"reliably":[83],"decode":[84],"d-dimensional":[86],"code":[88],"d":[90],"constant":[93],"factor":[94],"greater":[95],"than":[96],"Shannon":[98],"limit.Specifically,":[99],"ln":[101,103],"k/":[102],"\u2264":[105],"\u03b7":[106,160],"<":[107],"1":[108],"and":[109,123,211],"H":[110],"entropy":[113],"vector":[117],"bits,":[119],"we":[120,141],"prove":[121],"necessary":[122],"sufficient":[124],"asymptotic":[125],"conditions":[126],"form":[129],"d/H":[130,149,174,194],">":[131,175,195],"C(\u03b7)":[132],"for":[133,137],"certain":[134],"constants":[135],"C(\u03b7).However,":[136],"fixed":[139],"\u03b7,":[140],"empirically":[143],"critical":[146],"value":[147],"depends":[150],"significantly":[151],"on":[152,167],"what":[153],"decoding":[154],"method":[155,182],"used.For":[157],"example,":[158],"=":[161],"0.3,":[162],"estimation":[164],"procedure":[165],"based":[166],"popular":[169],"top-k":[170],"activation":[171],"function":[172],"requires":[173,184],"4":[176],"dimensions":[177],"per":[178],"bit,":[179],"while":[180],"only":[185],"around":[186],"3":[187],"times":[188],"computational":[190],"expense":[191],"succeeds":[192],"with":[193,206],"2.":[196],"We":[197],"hope":[198],"helps":[201],"connect":[202],"research":[203],"perspectives":[207],"from":[208],"compressive":[209],"sensing":[210],"information":[212],"theory.":[213]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-10-04T00:00:00"}
