{"id":"https://openalex.org/W7168277549","doi":"https://doi.org/10.48550/arxiv.2607.09909","title":"Learning Partition Trees for Nearest Neighbor Search","display_name":"Learning Partition Trees for Nearest Neighbor Search","publication_year":2026,"publication_date":"2026-07-10","ids":{"openalex":"https://openalex.org/W7168277549","doi":"https://doi.org/10.48550/arxiv.2607.09909"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09909","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.2607.09909","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140582958","display_name":"Sanjeev Khanna","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khanna, Sanjeev","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140625233","display_name":"Ashwin Padaki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Padaki, Ashwin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140619699","display_name":"Erik Waingarten","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Waingarten, Erik","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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.6226000189781189,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.6226000189781189,"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/T11106","display_name":"Data Management and Algorithms","score":0.05939999967813492,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.04690000042319298,"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/fraction","display_name":"Fraction (chemistry)","score":0.5307999849319458},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.45730000734329224},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.44029998779296875},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.43529999256134033},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4275999963283539},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4027999937534332},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3903000056743622},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.37700000405311584},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.3765999972820282},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.35690000653266907}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7318999767303467},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5307999849319458},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4165000021457672},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4027999937534332},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38769999146461487},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.3564000129699707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3553999960422516},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.35429999232292175},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C2778401447","wikidata":"https://www.wikidata.org/wiki/Q7140637","display_name":"Partition function (quantum field theory)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30410000681877136},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2973000109195709},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.2935999929904938},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2847999930381775},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.26249998807907104},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.2612999975681305},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.2590000033378601},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09909","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.2607.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09909","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":{"We":[0,46,128],"study":[1],"nearest":[2],"neighbor":[3],"search":[4],"from":[5,42],"the":[6,30,49,68,93,100,123,135,154],"perspective":[7],"of":[8,18,51,95,125,161,171],"data-driven":[9],"algorithm":[10,77,164],"design:":[11],"given":[12,108],"a":[13,25,35,80,88,109,118,166],"dataset":[14,69],"$P":[15],"\\subset":[16],"\\mathbb{R}^d$":[17,114],"size":[19],"$n$":[20],"and":[21,70,115],"sample":[22],"access":[23],"to":[24,33],"query":[26,71,84],"distribution":[27,110],"over":[28,111],"$\\mathbb{R}^d$,":[29],"goal":[31],"is":[32,99,139],"learn":[34],"data":[36],"structure":[37],"optimized":[38],"for":[39],"queries":[40],"drawn":[41],"that":[43,78,87,121,130,174],"specific":[44],"distribution.":[45],"focus":[47],"on":[48,67],"class":[50],"balanced":[52,101,119,137,167],"halfspace":[53,102,120,138,156],"trees,":[54],"which":[55],"naturally":[56],"abstracts":[57],"space-partitioning":[58],"frameworks":[59],"like":[60],"locality-sensitive":[61],"hashing.":[62],"Assuming":[63],"Gaussian-like":[64],"marginal":[65],"conditions":[66],"distribution,":[72],"we":[73,106,146],"give":[74],"an":[75,148,158,178],"efficient":[76,149],"learns":[79],"tree":[81,90],"achieving":[82],"$o(nd)$":[83],"time,":[85],"provided":[86],"perfect":[89],"exists.":[91],"At":[92],"core":[94],"our":[96,163],"algorithmic":[97],"approach":[98],"cut":[103,126],"problem,":[104],"where":[105],"are":[107],"$\\mathbb{R}^d":[112],"\\times":[113],"must":[116],"find":[117],"minimizes":[122],"fraction":[124,160],"pairs.":[127],"prove":[129],"without":[131],"distributional":[132],"assumptions,":[133],"finding":[134],"optimal":[136,155],"NP-hard.":[140],"To":[141],"circumvent":[142],"this":[143],"computational":[144],"barrier,":[145],"design":[147],"improper":[150],"learning":[151],"algorithm:":[152],"if":[153],"cuts":[157,175],"$\u03b1$":[159],"pairs,":[162],"outputs":[165],"polynomial":[168],"threshold":[169],"function":[170],"degree":[172],"$\\tilde{O}(1/\\varepsilon^2)$":[173],"at":[176],"most":[177],"$O(\\sqrt{\u03b1+\\varepsilon})$":[179],"fraction.":[180]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-15T00:00:00"}