{"id":"https://openalex.org/W7128607127","doi":"https://doi.org/10.1109/focs63196.2025.00132","title":"The Power of Recursive Embeddings for \u2113 <sub>p</sub> Metrics","display_name":"The Power of Recursive Embeddings for \u2113 <sub>p</sub> Metrics","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128607127","doi":"https://doi.org/10.1109/focs63196.2025.00132"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00132","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Robert Krauthgamer","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116144214","display_name":"Nir Petruschka","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nir Petruschka","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060871438","display_name":"Shay Sapir","orcid":"https://orcid.org/0000-0001-7531-685X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Sapir","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76362429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2546","last_page":"2554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3246999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3246999979019165,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.08250000327825546,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05260000005364418,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/embedding","display_name":"Embedding","score":0.7462999820709229},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.7231000065803528},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.669700026512146},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5364999771118164},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4503999948501587},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.44850000739097595},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4415000081062317}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7462999820709229},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.7231000065803528},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.669700026512146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6234999895095825},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4503999948501587},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4415000081062317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40310001373291016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38100001215934753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3481999933719635},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C145084290","wikidata":"https://www.wikidata.org/wiki/Q2713824","display_name":"Metric map","level":4,"score":0.27000001072883606},{"id":"https://openalex.org/C191226916","wikidata":"https://www.wikidata.org/wiki/Q5384710","display_name":"Equivalence of metrics","level":4,"score":0.26159998774528503},{"id":"https://openalex.org/C154497576","wikidata":"https://www.wikidata.org/wiki/Q7247777","display_name":"Product metric","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00132","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320323278","display_name":"Council for Higher Education","ror":"https://ror.org/036mqp197"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Metric":[0],"embedding":[1,48],"is":[2,73],"a":[3,15,52,69,83,103],"powerful":[4],"tool":[5],"used":[6],"extensively":[7],"in":[8,30,87],"mathematics":[9],"and":[10,46,66],"computer":[11],"science.":[12],"We":[13,86],"devise":[14],"new":[16,70],"method":[17,55,91],"of":[18],"using":[19,94],"metric":[20,57],"embeddings":[21,58],"recursively,":[22,92],"which":[23,97],"turns":[24],"out":[25],"to":[26],"be":[27],"particularly":[28],"effective":[29,76],"$\\ell_{p}$":[31,114],"spaces,":[32],"$p":[33],"\\lt":[34],"2$,":[35],"yielding":[36],"state-of-theart":[37],"results":[38],"for":[39,42,47],"Lipschitz":[40,109],"decomposition,":[41],"Nearest":[43,111],"Neighbor":[44,112],"Search,":[45,113],"into":[49],"$\\ell_{2}$.":[50],"In":[51],"nutshell,":[53],"our":[54],"composes":[56],"by":[59],"viewing":[60],"them":[61],"as":[62],"reductions":[63],"between":[64],"problems,":[65],"thereby":[67],"obtains":[68],"reduction":[71,80],"that":[72,81],"substantially":[74],"more":[75],"than":[77],"the":[78,100],"known":[79],"employs":[82],"single":[84,104],"embedding.":[85,105],"fact":[88],"apply":[89],"this":[90],"oftentimes":[93],"double":[95],"recursion,":[96],"further":[98],"amplifies":[99],"gap":[101],"from":[102],"Index":[106],"Terms-Metric":[107],"Embedding,":[108],"Decomposition,":[110],"norm":[115]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-02-12T00:00:00"}