{"id":"https://openalex.org/W7128804807","doi":"https://doi.org/10.48550/arxiv.2602.11246","title":"How Many Features Can a Language Model Store Under the Linear Representation Hypothesis?","display_name":"How Many Features Can a Language Model Store Under the Linear Representation Hypothesis?","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128804807","doi":"https://doi.org/10.48550/arxiv.2602.11246"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.11246","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":"article","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/A5125978109","display_name":"Nikhil Garg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Garg, Nikhil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125920418","display_name":"Jon Kleinberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kleinberg, Jon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125978550","display_name":"Kenny Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peng, Kenny","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18927168,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.2410999983549118,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.2410999983549118,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.11779999732971191,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.10480000078678131,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6858999729156494},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6554999947547913},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5691999793052673},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.4950999915599823},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.48249998688697815},{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.45170000195503235},{"id":"https://openalex.org/keywords/linear-model","display_name":"Linear model","score":0.38989999890327454}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6858999729156494},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6554999947547913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6043000221252441},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5691999793052673},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.4950999915599823},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4083999991416931},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3711000084877014},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3513999879360199},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33070001006126404},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2833999991416931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28110000491142273},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2596000134944916}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.11246","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.11246","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11246","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":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.11246","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,22,46,128,235],"introduce":[1],"a":[2,148,162],"mathematical":[3],"framework":[4],"for":[5,70,124,189,218],"the":[6,24,95,102,106,184,190,228,246],"linear":[7,29,39,99,111,125,154,159,167],"representation":[8,30,168],"hypothesis":[9,25,165],"(LRH),":[10],"which":[11],"asserts":[12],"that":[13,69,130,174],"intermediate":[14],"layers":[15],"of":[16,98,105,181,205,230,248],"language":[17],"models":[18],"store":[19,177],"features":[20,182],"linearly.":[21],"separate":[23],"into":[26,110],"two":[27],"claims:":[28],"(features":[31,41],"are":[32],"linearly":[33,44,56,59],"embedded":[34],"in":[35,65,232],"neuron":[36],"activations)":[37],"and":[38,58,85,121,153,242,251,262],"accessibility":[40,160],"can":[42,176],"be":[43],"decoded).":[45],"then":[47],"ask:":[48],"How":[49],"many":[50],"neurons":[51,175],"$d$":[52],"suffice":[53],"to":[54,255],"both":[55],"represent":[57],"access":[60],"$m$":[61],"features?":[62],"Classical":[63],"results":[64,240,254],"compressed":[66,108,112,126,155],"sensing":[67],"imply":[68],"$k$-sparse":[71],"inputs,":[72],"$d":[73,131,139],"=":[74,132,140],"O(k\\log":[75],"(m/k))$":[76,135],"suffices":[77],"if":[78],"we":[79],"allow":[80,256],"non-linear":[81],"decoding":[82,100],"algorithms":[83],"(Candes":[84],"Tao,":[86],"2006;":[87,91],"Candes":[88],"et":[89,194],"al.,":[90,195],"Donoho,":[92],"2006).":[93],"However,":[94],"additional":[96],"requirement":[97],"takes":[101],"problem":[103],"out":[104],"classical":[107,152],"sensing,":[109],"sensing.":[113,127],"Our":[114],"main":[115],"theoretical":[116,187],"result":[117],"establishes":[118,147],"nearly-matching":[119],"upper":[120,171,198],"lower":[122,145,212],"bounds":[123,217],"prove":[129],"\u03a9_\u03b5(\\frac{k^2}{\\log":[133],"k}\\log":[134],"is":[136,161],"required":[137],"while":[138],"O_\u03b5(k^2\\log":[141],"m)$":[142],"suffices.":[143],"The":[144,170,197,211],"bound":[146,172,199,213],"quantitative":[149],"gap":[150],"between":[151],"setting,":[156],"illustrating":[157],"how":[158,238],"meaningfully":[163],"stronger":[164],"than":[166],"alone.":[169],"confirms":[173],"an":[178,259],"exponential":[179],"number":[180,229],"under":[183],"LRH,":[185],"giving":[186],"evidence":[188],"\"superposition":[191],"hypothesis\"":[192],"(Elhage":[193],"2022).":[196],"proof":[200,214],"uses":[201,215],"standard":[202],"random":[203],"constructions":[204],"matrices":[206,220],"with":[207,224,258],"approximately":[208],"orthogonal":[209],"columns.":[210],"rank":[216],"near-identity":[219],"(Alon,":[221],"2003)":[222],"together":[223],"Tur\u00e1n's":[225],"theorem":[226],"(bounding":[227],"edges":[231],"clique-free":[233],"graphs).":[234],"also":[236],"show":[237],"our":[239,253],"do":[241,243],"not":[244],"constrain":[245],"geometry":[247],"feature":[249],"representations":[250],"extend":[252],"decoders":[257],"activation":[260],"function":[261],"bias.":[263]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-14T00:00:00"}