{"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":"/task/learning-to-rank/papers/ran/1","list_of":"/task/learning-to-rank","task":"Learning-To-Rank","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,43],"of":43,"counts":{"archive_papers_tagged":753,"with_a_code_link":213,"where_syntology_ran_a_sample":43,"not_listed_spam_title":0,"listed":753,"listed_where_code_ran":43,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":36,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":36,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/learning-to-rank/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/visualquality-r1-reasoning-induced-image","slug":"visualquality-r1-reasoning-induced-image","title":"VisualQuality-R1: Reasoning-Induced Image Quality Assessment via Reinforcement Learning to Rank","date":"2025-05-20","arxiv_id":"2505.14460","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/visualquality-r1-reasoning-induced-image#ran","syntology_url":"https://syntology.ai/paper/2505.14460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14460"}},"official":{"repos":["tianhewu/visualquality-r1"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/2505-10940","slug":"2505-10940","title":"Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation","date":"2025-05-16","arxiv_id":"2505.10940","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2505-10940#ran","syntology_url":"https://syntology.ai/paper/2505.10940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10940"}},"official":null}},{"url":"/paper/offline-model-based-optimization-by-learning","slug":"offline-model-based-optimization-by-learning","title":"Offline Model-Based Optimization by Learning to Rank","date":"2024-10-15","arxiv_id":"2410.11502","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":1,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":9,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/offline-model-based-optimization-by-learning#ran","syntology_url":"https://syntology.ai/paper/2410.11502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11502"}},"official":{"repos":["ggchen1997/bdi","lamda-bbo/offline-ram"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["community","found_in_text","official"]}}},{"url":"/paper/hidden-or-inferred-fair-learning-to-rank-with","slug":"hidden-or-inferred-fair-learning-to-rank-with","title":"Hidden or Inferred: Fair Learning-To-Rank with Unknown Demographics","date":"2024-07-24","arxiv_id":"2407.17459","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/hidden-or-inferred-fair-learning-to-rank-with#ran","syntology_url":"https://syntology.ai/paper/2407.17459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17459"}},"official":{"repos":["sewen007/hoiltr"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-passage-embeddings-for-efficient","slug":"leveraging-passage-embeddings-for-efficient","title":"Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models","date":"2024-06-21","arxiv_id":"2406.14848","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/leveraging-passage-embeddings-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.14848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14848"}},"official":{"repos":["liuqi6777/pe_rank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/first-faster-improved-listwise-reranking-with","slug":"first-faster-improved-listwise-reranking-with","title":"FIRST: Faster Improved Listwise Reranking with Single Token Decoding","date":"2024-06-21","arxiv_id":"2406.15657","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/first-faster-improved-listwise-reranking-with#ran","syntology_url":"https://syntology.ai/paper/2406.15657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15657"}},"official":{"repos":["gangiswag/llm-reranker"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/step-level-value-preference-optimization-for","slug":"step-level-value-preference-optimization-for","title":"Step-level Value Preference Optimization for Mathematical Reasoning","date":"2024-06-16","arxiv_id":"2406.10858","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/step-level-value-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10858"}},"official":{"repos":["MARIO-Math-Reasoning/Super_MARIO"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-user-retention-through-generative","slug":"modeling-user-retention-through-generative","title":"Modeling User Retention through Generative Flow Networks","date":"2024-06-10","arxiv_id":"2406.06043","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-user-retention-through-generative#ran","syntology_url":"https://syntology.ai/paper/2406.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06043"}},"official":{"repos":["Applied-Machine-Learning-Lab/GFN4Retention"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-learning-to-rank-formulation-of-clustering","slug":"a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","arxiv_id":"2404.11731","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-learning-to-rank-formulation-of-clustering#ran","syntology_url":"https://syntology.ai/paper/2404.11731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11731"}},"official":{"repos":["tomvek/mips-learnt-ivf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-patches-for-unbiased-image","slug":"learning-to-rank-patches-for-unbiased-image","title":"Learning to Rank Patches for Unbiased Image Redundancy Reduction","date":"2024-03-31","arxiv_id":"2404.00680","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-rank-patches-for-unbiased-image#ran","syntology_url":"https://syntology.ai/paper/2404.00680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00680"}},"official":{"repos":["irslu/ltrp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rankingshap-listwise-feature-attribution","slug":"rankingshap-listwise-feature-attribution","title":"RankingSHAP -- Listwise Feature Attribution Explanations for Ranking Models","date":"2024-03-24","arxiv_id":"2403.16085","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rankingshap-listwise-feature-attribution#ran","syntology_url":"https://syntology.ai/paper/2403.16085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16085"}},"official":{"repos":["mariaheuss/rankingshap"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metasql-a-generate-then-rank-framework-for","slug":"metasql-a-generate-then-rank-framework-for","title":"Metasql: A Generate-then-Rank Framework for Natural Language to SQL Translation","date":"2024-02-27","arxiv_id":"2402.17144","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/metasql-a-generate-then-rank-framework-for#ran","syntology_url":"https://syntology.ai/paper/2402.17144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17144"}},"official":{"repos":["Kaimary/MetaSQL"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/list-aware-reranking-truncation-joint-model","slug":"list-aware-reranking-truncation-joint-model","title":"List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation","date":"2024-02-05","arxiv_id":"2402.02764","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/list-aware-reranking-truncation-joint-model#ran","syntology_url":"https://syntology.ai/paper/2402.02764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02764"}},"official":{"repos":["xsc1234/genrt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lipo-listwise-preference-optimization-through","slug":"lipo-listwise-preference-optimization-through","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","date":"2024-02-02","arxiv_id":"2402.01878","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lipo-listwise-preference-optimization-through#ran","syntology_url":"https://syntology.ai/paper/2402.01878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01878"}},"official":null}},{"url":"/paper/sharp-explaining-rankings-with-shapley-values","slug":"sharp-explaining-rankings-with-shapley-values","title":"ShaRP: A Novel Feature Importance Framework for Ranking","date":"2024-01-30","arxiv_id":"2401.16744","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sharp-explaining-rankings-with-shapley-values#ran","syntology_url":"https://syntology.ai/paper/2401.16744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16744"}},"official":{"repos":["dataresponsibly/sharp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/glen-generative-retrieval-via-lexical-index","slug":"glen-generative-retrieval-via-lexical-index","title":"GLEN: Generative Retrieval via Lexical Index Learning","date":"2023-11-06","arxiv_id":"2311.03057","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/glen-generative-retrieval-via-lexical-index#ran","syntology_url":"https://syntology.ai/paper/2311.03057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03057"}},"official":{"repos":["skleee/GLEN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/spatialrank-urban-event-ranking-with-ndcg","slug":"spatialrank-urban-event-ranking-with-ndcg","title":"SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data","date":"2023-09-30","arxiv_id":"2310.00270","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/spatialrank-urban-event-ranking-with-ndcg#ran","syntology_url":"https://syntology.ai/paper/2310.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00270"}},"official":null}},{"url":"/paper/identifiability-matters-revealing-the-hidden","slug":"identifiability-matters-revealing-the-hidden","title":"Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to Rank","date":"2023-09-27","arxiv_id":"2309.15560","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/identifiability-matters-revealing-the-hidden#ran","syntology_url":"https://syntology.ai/paper/2309.15560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15560"}},"official":{"repos":["keytoyze/ultr-identifiability"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mist-cf-chemical-formula-inference-from","slug":"mist-cf-chemical-formula-inference-from","title":"MIST-CF: Chemical formula inference from tandem mass spectra","date":"2023-07-17","arxiv_id":"2307.08240","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mist-cf-chemical-formula-inference-from#ran","syntology_url":"https://syntology.ai/paper/2307.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08240"}},"official":{"repos":["samgoldman97/mist-cf"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-meets-language-boosting-1","slug":"learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","arxiv_id":"2306.13856","repositories_listed":2,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":11,"n_instrument":7,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-to-rank-meets-language-boosting-1#ran","syntology_url":"https://syntology.ai/paper/2306.13856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13856"}},"official":{"repos":["raywang335/l2rclip"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/libauc-a-deep-learning-library-for-x-risk","slug":"libauc-a-deep-learning-library-for-x-risk","title":"LibAUC: A Deep Learning Library for X-Risk Optimization","date":"2023-06-05","arxiv_id":"2306.03065","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/libauc-a-deep-learning-library-for-x-risk#ran","syntology_url":"https://syntology.ai/paper/2306.03065","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03065"}},"official":{"repos":["Optimization-AI/LibAUC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/selfood-self-supervised-out-of-distribution","slug":"selfood-self-supervised-out-of-distribution","title":"SELFOOD: Self-Supervised Out-Of-Distribution Detection via Learning to Rank","date":"2023-05-24","arxiv_id":"2305.14696","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selfood-self-supervised-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2305.14696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14696"}},"official":{"repos":["dheeraj7596/selfood"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fantastic-rewards-and-how-to-tame-them-a-case","slug":"fantastic-rewards-and-how-to-tame-them-a-case","title":"Fantastic Rewards and How to Tame Them: A Case Study on Reward Learning for Task-oriented Dialogue Systems","date":"2023-02-20","arxiv_id":"2302.10342","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fantastic-rewards-and-how-to-tame-them-a-case#ran","syntology_url":"https://syntology.ai/paper/2302.10342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10342"}},"official":{"repos":["budzianowski/multiwoz","shentao-yang/fantastic_reward_iclr2023"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scalar-is-not-enough-vectorization-based","slug":"scalar-is-not-enough-vectorization-based","title":"Scalar is Not Enough: Vectorization-based Unbiased Learning to Rank","date":"2022-06-03","arxiv_id":"2206.01702","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalar-is-not-enough-vectorization-based#ran","syntology_url":"https://syntology.ai/paper/2206.01702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01702"}},"official":{"repos":["keytoyze/vectorization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-at-the-speed-of-sampling","slug":"learning-to-rank-at-the-speed-of-sampling","title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity","date":"2022-04-22","arxiv_id":"2204.10872","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-rank-at-the-speed-of-sampling#ran","syntology_url":"https://syntology.ai/paper/2204.10872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10872"}},"official":{"repos":["harrieo/2022-sigir-plackett-luce"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unimodal-concentrated-loss-fully-adaptive","slug":"unimodal-concentrated-loss-fully-adaptive","title":"Unimodal-Concentrated Loss: Fully Adaptive Label Distribution Learning for Ordinal Regression","date":"2022-04-01","arxiv_id":"2204.00309","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unimodal-concentrated-loss-fully-adaptive#ran","syntology_url":"https://syntology.ai/paper/2204.00309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00309"}},"official":null}},{"url":"/paper/predict-and-optimize-through-the-lens-of","slug":"predict-and-optimize-through-the-lens-of","title":"Decision-Focused Learning: Through the Lens of Learning to Rank","date":"2021-12-07","arxiv_id":"2112.03609","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/predict-and-optimize-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2112.03609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03609"}},"official":{"repos":["jayman91/ltr-predopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/pairwise-learning-for-neural-link-prediction","slug":"pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","arxiv_id":"2112.02936","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pairwise-learning-for-neural-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2112.02936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02936"}},"official":{"repos":["zhitao-wang/plnlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pt-ranking-a-benchmarking-platform-for-neural","slug":"pt-ranking-a-benchmarking-platform-for-neural","title":"PT-Ranking: A Benchmarking Platform for Neural Learning-to-Rank","date":"2020-08-31","arxiv_id":"2008.13368","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pt-ranking-a-benchmarking-platform-for-neural#ran","syntology_url":"https://syntology.ai/paper/2008.13368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13368"}},"official":{"repos":["wildltr/ptranking"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","repositories_listed":12,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}},"official":{"repos":["tensorflow/recommenders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/uncertainty-aware-blind-image-quality","slug":"uncertainty-aware-blind-image-quality","title":"Uncertainty-Aware Blind Image Quality Assessment in the Laboratory and Wild","date":"2020-05-28","arxiv_id":"2005.13983","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uncertainty-aware-blind-image-quality#ran","syntology_url":"https://syntology.ai/paper/2005.13983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13983"}},"official":{"repos":["zwx8981/UNIQUE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-boosting-neural-networks-grownet","slug":"gradient-boosting-neural-networks-grownet","title":"Gradient Boosting Neural Networks: GrowNet","date":"2020-02-19","arxiv_id":"2002.07971","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-boosting-neural-networks-grownet#ran","syntology_url":"https://syntology.ai/paper/2002.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07971"}},"official":{"repos":["sbadirli/GrowNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/listwise-learning-to-rank-by-exploring-unique","slug":"listwise-learning-to-rank-by-exploring-unique","title":"Listwise Learning to Rank by Exploring Unique Ratings","date":"2020-01-07","arxiv_id":"2001.01828","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/listwise-learning-to-rank-by-exploring-unique#ran","syntology_url":"https://syntology.ai/paper/2001.01828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01828"}},"official":{"repos":["XiaofengZhu/uRank_uMart"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/select-answer-and-explain-interpretable-multi","slug":"select-answer-and-explain-interpretable-multi","title":"Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documents","date":"2019-11-01","arxiv_id":"1911.00484","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/select-answer-and-explain-interpretable-multi#ran","syntology_url":"https://syntology.ai/paper/1911.00484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00484"}},"official":null}},{"url":"/paper/reward-learning-for-efficient-reinforcement","slug":"reward-learning-for-efficient-reinforcement","title":"Reward Learning for Efficient Reinforcement Learning in Extractive Document Summarisation","date":"2019-07-30","arxiv_id":"1907.12894","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reward-learning-for-efficient-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1907.12894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12894"}},"official":{"repos":["UKPLab/ijcai2019-relis"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-unlabeled-data-in-cnns-by-self","slug":"exploiting-unlabeled-data-in-cnns-by-self","title":"Exploiting Unlabeled Data in CNNs by Self-supervised Learning to Rank","date":"2019-02-17","arxiv_id":"1902.06285","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploiting-unlabeled-data-in-cnns-by-self#ran","syntology_url":"https://syntology.ai/paper/1902.06285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06285"}},"official":null}},{"url":"/paper/policy-learning-for-fairness-in-ranking","slug":"policy-learning-for-fairness-in-ranking","title":"Policy Learning for Fairness in Ranking","date":"2019-02-11","arxiv_id":"1902.04056","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/policy-learning-for-fairness-in-ranking#ran","syntology_url":"https://syntology.ai/paper/1902.04056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04056"}},"official":{"repos":["ashudeep/Fair-PGRank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/opportunistic-learning-budgeted-cost","slug":"opportunistic-learning-budgeted-cost","title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams","date":"2019-01-02","arxiv_id":"1901.00243","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/opportunistic-learning-budgeted-cost#ran","syntology_url":"https://syntology.ai/paper/1901.00243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00243"}},"official":{"repos":["mkachuee/Opportunistic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tf-ranking-scalable-tensorflow-library-for","slug":"tf-ranking-scalable-tensorflow-library-for","title":"TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank","date":"2018-11-30","arxiv_id":"1812.00073","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tf-ranking-scalable-tensorflow-library-for#ran","syntology_url":"https://syntology.ai/paper/1812.00073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00073"}},"official":{"repos":["tensorflow/ranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-groupwise-scoring-functions-using","slug":"learning-groupwise-scoring-functions-using","title":"Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks","date":"2018-11-11","arxiv_id":"1811.04415","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-groupwise-scoring-functions-using#ran","syntology_url":"https://syntology.ai/paper/1811.04415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04415"}},"official":null}},{"url":"/paper/180405938","slug":"180405938","title":"Unbiased Learning to Rank with Unbiased Propensity Estimation","date":"2018-04-16","arxiv_id":"1804.05938","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/180405938#ran","syntology_url":"https://syntology.ai/paper/1804.05938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05938"}},"official":{"repos":["QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/off-policy-evaluation-for-slate","slug":"off-policy-evaluation-for-slate","title":"Off-policy evaluation for slate recommendation","date":"2016-05-16","arxiv_id":"1605.04812","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/off-policy-evaluation-for-slate#ran","syntology_url":"https://syntology.ai/paper/1605.04812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.04812"}},"official":{"repos":["adith387/slates_semisynth_expts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-semibandits-via-supervised","slug":"contextual-semibandits-via-supervised","title":"Contextual Semibandits via Supervised Learning Oracles","date":"2015-02-20","arxiv_id":"1502.05890","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contextual-semibandits-via-supervised#ran","syntology_url":"https://syntology.ai/paper/1502.05890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05890"}},"official":{"repos":["akshaykr/oracle_cb"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"aca1ea042d47516960531348fbceae82a89e42e3d83f6e66742189aa6f1e171b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}