{"id":"https://openalex.org/W7162289326","doi":"https://doi.org/10.48550/arxiv.2605.23556","title":"Is Dimensionality a Barrier for Retrieval Models?","display_name":"Is Dimensionality a Barrier for Retrieval Models?","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162289326","doi":"https://doi.org/10.48550/arxiv.2605.23556"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.23556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.23556","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082445993","display_name":"Kiril Bangachev","orcid":"https://orcid.org/0000-0001-7131-956X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bangachev, Kiril","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060812074","display_name":"Guy Bresler","orcid":"https://orcid.org/0009-0007-6716-8827"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bresler, Guy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136955195","display_name":"Jonathan Kogan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kogan, Jonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Polyanskiy, Yury","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":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/T10286","display_name":"Information Retrieval and Search Behavior","score":0.5590999722480774,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10286","display_name":"Information Retrieval and Search Behavior","score":0.5590999722480774,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10890000313520432,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0333000011742115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6565999984741211},{"id":"https://openalex.org/keywords/margin","display_name":"Margin (machine learning)","score":0.6514999866485596},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4699000120162964},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.45570001006126404},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.4503999948501587},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.436599999666214},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4097999930381775},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4081000089645386},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.400299996137619}],"concepts":[{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6565999984741211},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.6514999866485596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5110999941825867},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4699000120162964},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.45570001006126404},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.4503999948501587},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.400299996137619},{"id":"https://openalex.org/C2776230367","wikidata":"https://www.wikidata.org/wiki/Q7314222","display_name":"Representation theorem","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38199999928474426},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.37470000982284546},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3427000045776367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33309999108314514},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32359999418258667},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3199000060558319},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2985999882221222},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2985999882221222},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.2881999909877777},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C91682802","wikidata":"https://www.wikidata.org/wiki/Q620538","display_name":"Multidimensional scaling","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.23556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"doi:10.48550/arxiv.2605.23556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Why":[0],"does":[1],"the":[2,35,76,92,103,148,156,194,212,226,247,263],"low":[3],"dimensionality":[4],"of":[5,23,62,69,91,175,228,262],"representations,":[6],"typically":[7],"$d\\approx":[8],"1000$,":[9],"not":[10],"prevent":[11],"modern":[12],"embedding-based":[13,49],"retrieval":[14,37,50],"models":[15],"from":[16],"scaling":[17],"to":[18,67,136],"billions,":[19],"or":[20],"even":[21],"trillions,":[22],"data":[24],"points?":[25],"To":[26],"answer":[27],"this":[28,221],"question,":[29],"we":[30,186,244],"study":[31],"maximal-margin":[32],"embeddings":[33,90,256],"in":[34,41,48,75,164,183,220],"following":[36,104],"model,":[38],"classically":[39],"studied":[40],"communication":[42],"complexity":[43],"[PS86]":[44],"and":[45,94,115,138,209,249,257],"more":[46],"recently":[47],"[WBNL26].":[51,229],"Let":[52],"$A\\in":[53,190],"\\{0,1\\}^{N\\times":[54],"n}$":[55,192],"be":[56,161],"a":[57,126,153,173,179,259],"matrix":[58,195],"indicating":[59],"whether":[60],"each":[61,68],"$N$":[63],"queries":[64,93],"is":[65,125,193,207],"relevant":[66],"$n$":[70],"documents.":[71],"We":[72,230],"are":[73],"interested":[74],"largest":[77],"margin":[78,124,151,215,255],"$m>0,$":[79],"denoted":[80],"by":[81],"$\\mathsf{m}^{\\mathsf{rd}}(d,":[82],"A),$":[83,159],"for":[84,129,211,235,252],"which":[85,171],"there":[86],"exist":[87],"unit":[88],"norm":[89],"documents":[95],"$\\{U_j\\}_{j":[96],"=":[97,100,113,167,204,218,240],"1}^N,":[98],"\\{V_i\\}_{i":[99],"1}^n$":[101],"with":[102,178],"property.":[105],"$\\langle":[106,116],"U_j,":[107,117],"V_i\\rangle":[108,118],"\\ge":[109],"m$":[110],"whenever":[111],"$A_{ji}":[112],"1$":[114],"\\le":[119],"-m$":[120],"otherwise.":[121],"A":[122],"large":[123,236,254],"key":[127],"proxy":[128],"representation":[130],"quality:":[131],"it":[132],"controls":[133],"both":[134],"robustness":[135],"perturbations":[137],"compositional":[139],"generalization":[140],"across":[141],"queries.":[142],"Our":[143],"main":[144],"theorem":[145,174],"establishes":[146],"that":[147,188],"best":[149],"possible":[150,198,214],"without":[152],"restriction":[154],"on":[155],"dimension,":[157],"$\\mathsf{m}^{\\mathsf{rd}}(+\\infty,":[158,216],"can":[160],"nearly":[162],"achieved":[163],"dimension":[165,202],"$d":[166,203,239],"O(\\mathsf{m}^{\\mathsf{rd}}(+\\infty,":[168],"A)^{-2}\\log":[169],"n)$":[170],"improves":[172],"[BDES02].":[176],"Together":[177],"matching":[180],"lower":[181],"bound":[182],"Theorem":[184],"1.5,":[185],"conclude":[187],"when":[189,238],"\\{0,1\\}^{\\binom{n}{k}\\times":[191],"containing":[196],"all":[197],"$k$-sparse":[199],"rows":[200],"once,":[201],"O(k\\log":[205],"(n/k))$":[206],"necessary":[208],"sufficient":[210],"maximal":[213],"A)":[217],"\u0398(k^{-1/2})$":[219],"setting.":[222],"This":[223],"fully":[224],"resolves":[225],"setup":[227],"also":[231],"give":[232],"several":[233],"constructions":[234],"margins":[237],"o(k\\log":[241],"(n/k)).$":[242],"Finally,":[243],"empirically":[245],"test":[246],"InfoNCE":[248],"sigmoid":[250,264],"losses":[251],"producing":[253],"demonstrate":[258],"clear":[260],"advantage":[261],"loss.":[265]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-26T00:00:00"}