{"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/8","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":8,"pages_in_order":8,"rows_per_page":100,"rows":[701,753],"of":753,"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","prev":"/task/learning-to-rank/papers/7","next":null,"papers":[{"url":null,"slug":"robust-subjective-visual-property-prediction","title":"Robust Subjective Visual Property Prediction from Crowdsourced Pairwise Labels","date":"2015-01-25","arxiv_id":"1501.06202","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-academic-experts-in-the-dblp","title":"Learning to Rank Academic Experts in the DBLP Dataset","date":"2015-01-21","arxiv_id":"1501.05132","repositories_listed":0,"syntology":null},{"url":null,"slug":"detect2rank-combining-object-detectors-using","title":"Detect2Rank : Combining Object Detectors Using Learning to Rank","date":"2014-12-26","arxiv_id":"1412.7957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-representation-theory-for-ranking-functions","title":"A Representation Theory for Ranking Functions","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-via-robust-binary-classification","title":"Ranking via Robust Binary Classification","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-binary-codes","title":"Learning to Rank Binary Codes","date":"2014-10-21","arxiv_id":"1410.5524","repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-spearmans-rho-for-aggregating","title":"Multivariate Spearman's rho for aggregating ranks using copulas","date":"2014-10-16","arxiv_id":"1410.4391","repositories_listed":0,"syntology":null},{"url":null,"slug":"invited-talk-learning-from-rational-behavior","title":"Invited Talk: Learning from Rational Behavior","date":"2014-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-differentiate-better-from-worse","title":"Learning to Differentiate Better from Worse Translations","date":"2014-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lovasz-bregman-divergence-and-connections-1","title":"The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking","date":"2014-08-09","arxiv_id":"1408.2062","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-important-features-for-graph","title":"Identifying Important Features for Graph Retrieval","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-peculiar-value-of-actions","title":"Learning the Peculiar Value of Actions","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-rank-functionals-an-empirical-study","title":"Learning Rank Functionals: An Empirical Study","date":"2014-07-23","arxiv_id":"1407.6089","repositories_listed":0,"syntology":null},{"url":null,"slug":"rankmerging-a-supervised-learning-to-rank","title":"RankMerging: A supervised learning-to-rank framework to predict links in large social network","date":"2014-07-09","arxiv_id":"1407.2515","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-to-rank-approach-for-image-color","title":"A Learning-to-Rank Approach for Image Color Enhancement","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-disease-normalization-with-low-rank","title":"Automated Disease Normalization with Low Rank Approximations","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-answer-candidates-for","title":"Learning to Rank Answer Candidates for Automatic Resolution of Crossword Puzzles","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/learning-translational-and-knowledge-based","slug":"learning-translational-and-knowledge-based","title":"Learning Translational and Knowledge-based Similarities from Relevance Rankings for Cross-Language Retrieval","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-exploit-different-translation","title":"Learning to Exploit Different Translation Resources for Cross Language Information Retrieval","date":"2014-05-20","arxiv_id":"1405.5447","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-functionally-related","title":"Identification of functionally related enzymes by learning-to-rank methods","date":"2014-05-17","arxiv_id":"1405.4394","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-lipschitz-continuity-and-smoothness-of","title":"On Lipschitz Continuity and Smoothness of Loss Functions in Learning to Rank","date":"2014-05-03","arxiv_id":"1405.0586","repositories_listed":0,"syntology":null},{"url":null,"slug":"perceptron-like-algorithms-and-generalization","title":"Perceptron-like Algorithms and Generalization Bounds for Learning to Rank","date":"2014-05-03","arxiv_id":"1405.0591","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-via-robust-binary-classification-and","title":"Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data","date":"2014-02-11","arxiv_id":"1402.2676","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchical-semantics-aware-distributional","title":"A Hierarchical Semantics-Aware Distributional Similarity Scheme","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-essay-scoring-by-maximizing-human","title":"Automated Essay Scoring by Maximizing Human-Machine Agreement","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/boosting-cross-language-retrieval-by-learning","slug":"boosting-cross-language-retrieval-by-learning","title":"Boosting Cross-Language Retrieval by Learning Bilingual Phrase Associations from Relevance Rankings","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-collective-entity-linking-with","title":"Efficient Collective Entity Linking with Stacking","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-lexical-substitutions","title":"Learning to Rank Lexical Substitutions","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-blind-image-quality","title":"Learning to Rank for Blind Image Quality Assessment","date":"2013-09-01","arxiv_id":"1309.0213","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lovasz-bregman-divergence-and-connections","title":"The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking","date":"2013-08-24","arxiv_id":"1308.5275","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpkex-genetically-programmed-keyphrase","title":"GPKEX: Genetically Programmed Keyphrase Extraction from Croatian Texts","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-extract-folktale-keywords","title":"Learning to Extract Folktale Keywords","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-order-natural-language-texts","title":"Learning to Order Natural Language Texts","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reranking-with-linguistic-and-semantic","title":"Reranking with Linguistic and Semantic Features for Arabic Optical Character Recognition","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-entity-morphs-in-censored-data","title":"Resolving Entity Morphs in Censored Data","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-expert-search-in-digital","title":"Learning to Rank for Expert Search in Digital Libraries of Academic Publications","date":"2013-02-02","arxiv_id":"1302.0413","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-algorithms-for-2","title":"Communication-Efficient Algorithms for Statistical Optimization","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"expected-divergence-based-feature-selection","title":"Expected Divergence Based Feature Selection for Learning to Rank","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extraction-of-domain-specific-bilingual","title":"Extraction of Domain-Specific Bilingual Lexicon from Comparable Corpora: Compositional Translation and Ranking","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"label-ranking-with-partial-abstention-based","title":"Label Ranking with Partial Abstention based on Thresholded Probabilistic Models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relationlistwise-for-query-focused-multi","title":"RelationListwise for Query-Focused Multi-Document Summarization","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visualization-on-financial-terms-via-risk","title":"Visualization on Financial Terms via Risk Ranking from Financial Reports","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-auc-pairwise","title":"On the Consistency of AUC Pairwise Optimization","date":"2012-08-03","arxiv_id":"1208.0645","repositories_listed":0,"syntology":null},{"url":null,"slug":"forest-reranking-through-subtree-ranking","title":"Forest Reranking through Subtree Ranking","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-temporally-order-medical-events","title":"Learning to Temporally Order Medical Events in Clinical Text","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-ranking-from-pairwise","title":"Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-music-annotation-and-retrieval","title":"Large-Scale Music Annotation and Retrieval: Learning to Rank in Joint Semantic Spaces","date":"2011-05-26","arxiv_id":"1105.5196","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-layer-generalization-analysis-for-ranking","title":"Two-Layer Generalization Analysis for Ranking Using Rademacher Average","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-by-optimizing-ndcg-measure","title":"Learning to Rank by Optimizing NDCG Measure","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-measures-and-loss-functions-in","title":"Ranking Measures and Loss Functions in Learning to Rank","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"global-ranking-using-continuous-conditional","title":"Global Ranking Using Continuous Conditional Random Fields","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-ranking-learning-using-cumulative","title":"Structured ranking learning using cumulative distribution networks","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-diverse-rankings-with-multi-armed","title":"Learning diverse rankings with multi-armed bandits","date":"2008-07-05","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"74226fe4588ecfaced9a8b1861e8fe6efb79f7caabce7f5c045961cec029a99f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}