{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","arxiv_id":"2404.11731","date":"2024-04-17","proceeding":null,"authors":["Thomas Vecchiato","Claudio Lucchese","Franco Maria Nardini","Sebastian Bruch"],"abstract":"A critical piece of the modern information retrieval puzzle is approximate nearest neighbor search. Its objective is to return a set of $k$ data points that are closest to a query point, with its accuracy measured by the proportion of exact nearest neighbors captured in the returned set. One popular approach to this question is clustering: The indexing algorithm partitions data points into non-overlapping subsets and represents each partition by a point such as its centroid. The query processing algorithm first identifies the nearest clusters -- a process known as routing -- then performs a nearest neighbor search over those clusters only. In this work, we make a simple observation: The routing function solves a ranking problem. Its quality can therefore be assessed with a ranking metric, making the function amenable to learning-to-rank. Interestingly, ground-truth is often freely available: Given a query distribution in a top-$k$ configuration, the ground-truth is the set of clusters that contain the exact top-$k$ vectors. We develop this insight and apply it to Maximum Inner Product Search (MIPS). As we demonstrate empirically on various datasets, learning a simple linear function consistently improves the accuracy of clustering-based MIPS.","url_abs":"https://arxiv.org/abs/2404.11731v1","url_pdf":"https://arxiv.org/pdf/2404.11731v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-learning-to-rank-formulation-of-clustering","repo_url":"https://github.com/tomvek/mips-learnt-ivf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2404.11731","atlas_url":"https://app.syntology.ai/?focus=2404.11731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11731"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.11731"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.11731"},"call":"get_harvested_code_for_paper(arxiv_id=\"2404.11731\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2404.11731"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2404.11731\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2404.11731"},"call":"get_concepts_for_paper(arxiv_id=\"2404.11731\")"}],"by_repo":[{"repo":"tomvek/mips-learnt-ivf","kind":"official","samples":8,"ran":7,"instrument":2,"unverified":1}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2404.11731.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2404.11731.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tomvek/mips-learnt-ivf","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":2,"ran":5,"unverified":1},"n_samples":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":8,"ran":7,"n_ran_checked":5,"n_instrument":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":8,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"3a658b1197321617","code_sha256_prefix":"3a658b1197321617","entry":"create_vector_distribution","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/auxiliary.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/auxiliary.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"k:int/0/int, pos:ndarray/1/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"3a658b1197321617"}},{"code_sha256":"8e082f767d2fbd4c","code_sha256_prefix":"8e082f767d2fbd4c","entry":"k_means","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/kmeans.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/kmeans.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"doc_vectors:ndarray/2/float, n_clusters:int/0/int, flag_spherical:bool/0/bool","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8e082f767d2fbd4c"},"code_page":"/code/k-means","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"8e082f767d2fbd4c"}},{"code_sha256":"4a7a012c505f393d","code_sha256_prefix":"4a7a012c505f393d","entry":"nn_linear","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/linearlearner.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/linearlearner.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"k:int/0/int, input_shape:tuple/1/int, n_units:int/0/int","fixture_out_type":"Sequential","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"4a7a012c505f393d"}},{"code_sha256":"061be01a088d1472","code_sha256_prefix":"061be01a088d1472","entry":"query_true_label","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/auxiliary.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/auxiliary.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"n_cluster:int/0/int, label_clustering:Tensor/1/int, neighbors:ndarray/1/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"061be01a088d1472"}},{"code_sha256":"8c1aec9837419db4","code_sha256_prefix":"8c1aec9837419db4","entry":"random_clustering","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/k_random.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/k_random.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"doc_vectors:ndarray/2/float, n_clusters:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8c1aec9837419db4"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"8c1aec9837419db4"}},{"code_sha256":"d9d454019bbdaa74","code_sha256_prefix":"d9d454019bbdaa74","entry":"run_nn","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/linearlearner.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/linearlearner.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"n_clusters:int/0/int, input_shape:tuple/1/int, x_train:ndarray/2/float, y_train:ndarray/2/float, x_val:ndarray/2/float, y_val:ndarray/2/float, n_epochs:int/0/int, n_units:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"d9d454019bbdaa74"}},{"code_sha256":"99fe0366898cbc62","code_sha256_prefix":"99fe0366898cbc62","entry":"scores_queries_centroids","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/auxiliary.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/auxiliary.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"centroids:ndarray/2/float, x_test:ndarray/2/float, gpu_flag:bool/0/bool","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"99fe0366898cbc62"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"99fe0366898cbc62"}},{"code_sha256":"61439a6de309834c","code_sha256_prefix":"61439a6de309834c","entry":"run_linear_learner","repo":"tomvek/mips-learnt-ivf","repo_kind":"official","path":"clustering/linearlearner.py","file_url":"https://github.com/tomvek/mips-learnt-ivf/blob/HEAD/clustering/linearlearner.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomvek/mips-learnt-ivf when it was checked","mcp_get_code":{"code_sha256":"61439a6de309834c"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"069aa3cf409004e9f15bdbd61b70cb53e3b61bffcc7d523f672ce8d5576468a0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}