{"id":"https://openalex.org/W7151356913","doi":"https://doi.org/10.48550/arxiv.2604.03831","title":"SVD Provably Denoises Nearest Neighbor Data","display_name":"SVD Provably Denoises Nearest Neighbor Data","publication_year":2026,"publication_date":"2026-04-04","ids":{"openalex":"https://openalex.org/W7151356913","doi":"https://doi.org/10.48550/arxiv.2604.03831"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.03831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03831","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.2604.03831","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111706327","display_name":"Ravindran Kannan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kannan, Ravindran","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133113740","display_name":"Kijun Shin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shin, Kijun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133111276","display_name":"David Woodruff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Woodruff, David","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/T11830","display_name":"Point processes and geometric inequalities","score":0.1396999955177307,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T11830","display_name":"Point processes and geometric inequalities","score":0.1396999955177307,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.08969999849796295,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.08619999885559082,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.7883999943733215},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.7788000106811523},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7700999975204468},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.7160999774932861},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6563000082969666},{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.6037999987602234},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5631999969482422},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5302000045776367},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.527400016784668}],"concepts":[{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.7883999943733215},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.7788000106811523},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7700999975204468},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.7160999774932861},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6563000082969666},{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6014000177383423},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5631999969482422},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5302000045776367},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.527400016784668},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5192000269889832},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5142999887466431},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.46560001373291016},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4327000081539154},{"id":"https://openalex.org/C109282560","wikidata":"https://www.wikidata.org/wiki/Q4166054","display_name":"Singular value","level":3,"score":0.42910000681877136},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4244000017642975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41130000352859497},{"id":"https://openalex.org/C2781170535","wikidata":"https://www.wikidata.org/wiki/Q30587856","display_name":"Noisy data","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.38359999656677246},{"id":"https://openalex.org/C4199805","wikidata":"https://www.wikidata.org/wiki/Q2725903","display_name":"Gaussian noise","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31859999895095825},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26989999413490295}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.03831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03831","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.2604.03831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03831","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.40037596225738525}],"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,93,251],"study":[1],"the":[2,58,69,72,78,86,90,105,110,115,122,126,134,146,157,167,171,175,183,187,198,211,232],"Nearest":[3],"Neighbor":[4],"Search":[5],"(NNS)":[6],"problem":[7],"in":[8,15,31,89,125,137,166,174,182,203,231],"a":[9,16,28,64,140],"high-dimensional":[10],"setting":[11],"where":[12,205],"data":[13,106,128,136,177,213],"lies":[14],"low-dimensional":[17],"subspace":[18,39],"and":[19,75,107,144,170,189,248],"is":[20,61,83,129],"corrupted":[21],"by":[22,47],"Gaussian":[23,50,246],"noise.":[24],"Specifically,":[25],"we":[26],"consider":[27],"semi-random":[29],"model":[30],"which":[32],"$n$":[33],"points":[34],"from":[35,68,133,180],"an":[36,228],"unknown":[37],"$k$-dimensional":[38],"of":[40,114,148],"$\\mathbb{R}^d$":[41],"($k":[42],"\\ll":[43],"d$)":[44],"are":[45],"perturbed":[46],"zero-mean":[48],"$d$-dimensional":[49],"noise":[51,158],"with":[52,245],"variance":[53],"$\u03c3^2$":[54],"per":[55],"coordinate.":[56],"Assuming":[57],"second-nearest":[59],"neighbor":[60,88,113,124,173,201,208],"at":[62,226],"least":[63,227],"factor":[65],"$(1+\\varepsilon)$":[66],"farther":[67],"query":[70],"than":[71],"nearest":[73,87,112,123,172,200,207],"neighbor,":[74],"given":[76],"only":[77],"noisy":[79,135,176,212],"data,":[80,169],"our":[81,218,260],"goal":[82],"to":[84,216,224],"recover":[85],"uncorrupted":[91,116,127,184],"data.":[92,117,185],"prove":[94],"three":[95],"results.":[96],"First,":[97],"for":[98,119,151,154,241],"$\u03c3\\in":[99],"O(1/k^{1/4})$,":[100],"simply":[101],"performing":[102],"SVD":[103,195],"denoises":[104],"provably":[108],"recovers":[109],"correct":[111,199],"Second,":[118],"$\u03c3\\gg":[120,155],"1/k^{1/4}$,":[121],"not":[130,221],"even":[131,202],"identifiable":[132],"general,":[138],"giving":[139],"matching":[141],"lower":[142],"bound":[143],"showing":[145],"necessity":[147],"this":[149],"threshold":[150],"NNS.":[152],"Third,":[153],"1/\\sqrt{k}$,":[156],"magnitude":[159],"$\u03c3\\sqrt":[160],"d$":[161],"significantly":[162],"exceeds":[163],"inter-point":[164],"distances":[165],"unperturbed":[168],"generally":[178],"differs":[179],"that":[181,194],"Thus,":[186],"first":[188],"third":[190],"results":[191,255],"together":[192,244],"imply":[193],"can":[196],"identify":[197],"regimes":[204],"naive":[206],"search":[209],"on":[210,256],"fails.":[214],"Compared":[215],"\\citep{abdullah2014spectral},":[217],"result":[219],"does":[220],"require":[222],"$\u03c3$":[223],"be":[225],"inverse":[229],"polynomial":[230],"ambient":[233],"dimension":[234],"$d$.":[235],"Our":[236],"analysis":[237],"uses":[238],"perturbation":[239],"bounds":[240],"singular":[242],"spaces":[243],"concentration":[247],"spherical":[249],"symmetry.":[250],"also":[252],"provide":[253],"empirical":[254],"real":[257],"datasets":[258],"supporting":[259],"theory.":[261]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-08T00:00:00"}