{"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/6","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":6,"pages_in_order":8,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/learning-to-rank/papers/7","papers":[{"url":null,"slug":"an-alternative-cross-entropy-loss-for","title":"An Alternative Cross Entropy Loss for Learning-to-Rank","date":"2019-11-22","arxiv_id":"1911.09798","repositories_listed":0,"syntology":null},{"url":null,"slug":"separate-and-attend-in-personal-email-search","title":"Separate and Attend in Personal Email Search","date":"2019-11-21","arxiv_id":"1911.09732","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphene-a-precise-biomedical-literature","title":"GRAPHENE: A Precise Biomedical Literature Retrieval Engine with Graph Augmented Deep Learning and External Knowledge Empowerment","date":"2019-11-02","arxiv_id":"1911.00760","repositories_listed":0,"syntology":null},{"url":null,"slug":"answering-questions-by-learning-to-rank-1","title":"Answering questions by learning to rank - Learning to rank by answering questions","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"arsm-gradient-estimator-for-supervised","title":"ARSM Gradient Estimator for Supervised Learning to Rank","date":"2019-11-01","arxiv_id":"1911.00465","repositories_listed":0,"syntology":null},{"url":null,"slug":"team-svmrank-leveraging-feature-rich-support","title":"Team SVMrank: Leveraging Feature-rich Support Vector Machines for Ranking Explanations to Elementary Science Questions","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-dipinfounito-realizer-at-srst19-learning","title":"The DipInfoUniTo Realizer at SRST'19: Learning to Rank and Deep Morphology Prediction for Multilingual Surface Realization","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"banditrank-learning-to-rank-using-contextual","title":"BanditRank: Learning to Rank Using Contextual Bandits","date":"2019-10-23","arxiv_id":"1910.10410","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-attentive-document-interaction-networks","title":"Self-Attentive Document Interaction Networks for Permutation Equivariant Ranking","date":"2019-10-21","arxiv_id":"1910.09676","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-text-representation-from-bert-an","title":"Universal Text Representation from BERT: An Empirical Study","date":"2019-10-17","arxiv_id":"1910.07973","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-context-aware-multi-modal","title":"Personalized Context-Aware Multi-Modal Transportation Recommendation","date":"2019-10-13","arxiv_id":"1910.12601","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-based-features-to-rank-influential","title":"Content-Based Features to Rank Influential Hidden Services of the Tor Darknet","date":"2019-10-05","arxiv_id":"1910.02332","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-proposals-for-object","title":"Learning to Rank Proposals for Object Detection","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-effective-exploration-strategies-for","title":"Learning Effective Exploration Strategies For Contextual Bandits","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asu-at-textgraphs-2019-shared-task","title":"ASU at TextGraphs 2019 Shared Task: Explanation ReGeneration using Language Models and Iterative Re-Ranking","date":"2019-09-19","arxiv_id":"1909.08863","repositories_listed":0,"syntology":null},{"url":null,"slug":"marlrank-multi-agent-reinforced-learning-to","title":"MarlRank: Multi-agent Reinforced Learning to Rank","date":"2019-09-15","arxiv_id":"1909.06859","repositories_listed":0,"syntology":null},{"url":null,"slug":"plackett-luce-model-for-learning-to-rank-task","title":"Plackett-Luce model for learning-to-rank task","date":"2019-09-15","arxiv_id":"1909.06722","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-regression-tree-fitting","title":"Analysis of Regression Tree Fitting Algorithms in Learning to Rank","date":"2019-09-12","arxiv_id":"1909.05965","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertain-natural-language-inference","title":"Uncertain Natural Language Inference","date":"2019-09-06","arxiv_id":"1909.03042","repositories_listed":0,"syntology":null},{"url":null,"slug":"answering-questions-by-learning-to-rank","title":"Answering questions by learning to rank -- Learning to rank by answering questions","date":"2019-09-02","arxiv_id":"1909.00596","repositories_listed":0,"syntology":null},{"url":null,"slug":"explore-entity-embedding-effectiveness-in","title":"Explore Entity Embedding Effectiveness in Entity Retrieval","date":"2019-08-28","arxiv_id":"1908.10554","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-bert-for-non-factoid-question","title":"A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints","date":"2019-08-19","arxiv_id":"1908.06780","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learning-approach-for-smartphone","title":"A Machine Learning Approach for Smartphone-based Sensing of Roads and Driving Style","date":"2019-08-15","arxiv_id":"1908.10187","repositories_listed":0,"syntology":null},{"url":null,"slug":"aibench-an-industry-standard-internet-service","title":"AIBench: An Industry Standard Internet Service AI Benchmark Suite","date":"2019-08-13","arxiv_id":"1908.08998","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-effect-of-an-items-neighborhood","title":"Influence of Neighborhood on the Preference of an Item in eCommerce Search","date":"2019-08-10","arxiv_id":"1908.03825","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-link-prediction-with","title":"Differentially Private Link Prediction With Protected Connections","date":"2019-07-20","arxiv_id":"1908.04849","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-more-from-less-towards-strengthening","title":"Learning More From Less: Towards Strengthening Weak Supervision for Ad-Hoc Retrieval","date":"2019-07-19","arxiv_id":"1907.08657","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-learning-to-rank-counterfactual-and","title":"Unbiased Learning to Rank: Counterfactual and Online Approaches","date":"2019-07-16","arxiv_id":"1907.07260","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-broad-and-narrow-queries-in","title":"Learning to Rank Broad and Narrow Queries in E-Commerce","date":"2019-07-01","arxiv_id":"1907.01549","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-user-feedback-driven-internal","title":"Practical User Feedback-driven Internal Search Using Online Learning to Rank","date":"2019-06-15","arxiv_id":"1906.06581","repositories_listed":0,"syntology":null},{"url":null,"slug":"microsoft-ai-challenge-india-2018-learning-to","title":"Microsoft AI Challenge India 2018: Learning to Rank Passages for Web Question Answering with Deep Attention Networks","date":"2019-06-14","arxiv_id":"1906.06056","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduction-in-gradient-exploration","title":"Variance Reduction in Gradient Exploration for Online Learning to Rank","date":"2019-06-10","arxiv_id":"1906.03766","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-passage-based-approach-to-learning-to-rank","title":"A Passage-Based Approach to Learning to Rank Documents","date":"2019-06-05","arxiv_id":"1906.02083","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-plausible-plausibility","title":"Learning to Rank for Plausible Plausibility","date":"2019-06-05","arxiv_id":"1906.02079","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-latent-structured-prediction","title":"A Study of Latent Structured Prediction Approaches to Passage Reranking","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-subjectivity-detection-for","title":"Cross-lingual Subjectivity Detection for Resource Lean Languages","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cascading-non-stationary-bandits-online","title":"Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model","date":"2019-05-29","arxiv_id":"1905.12370","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectrum-enhanced-pairwise-learning-to-rank","title":"Spectrum-enhanced Pairwise Learning to Rank","date":"2019-05-02","arxiv_id":"1905.00805","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-distributed-gradient-boosted-trees","title":"Block-distributed Gradient Boosted Trees","date":"2019-04-23","arxiv_id":"1904.10522","repositories_listed":0,"syntology":null},{"url":null,"slug":"dipiq-blind-image-quality-assessment-by","title":"dipIQ: Blind Image Quality Assessment by Learning-to-Rank Discriminable Image Pairs","date":"2019-04-13","arxiv_id":"1904.06505","repositories_listed":0,"syntology":null},{"url":null,"slug":"vitor-learning-to-rank-webpages-based-on","title":"ViTOR: Learning to Rank Webpages Based on Visual Features","date":"2019-03-07","arxiv_id":"1903.02939","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-application-of-learning-to-rank-for-e","title":"On Application of Learning to Rank for E-Commerce Search","date":"2019-03-01","arxiv_id":"1903.04263","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-domain-generalization-perspective-on","title":"A Domain Generalization Perspective on Listwise Context Modeling","date":"2019-02-12","arxiv_id":"1902.04484","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-ranking-models-in-an-online","title":"Optimizing Ranking Models in an Online Setting","date":"2019-01-29","arxiv_id":"1901.10262","repositories_listed":0,"syntology":null},{"url":null,"slug":"190108286","title":"Neural IR Meets Graph Embedding: A Ranking Model for Product Search","date":"2019-01-24","arxiv_id":"1901.08286","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-estimation-of-position-bias-for","title":"Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search","date":"2018-12-21","arxiv_id":"1812.09338","repositories_listed":0,"syntology":null},{"url":null,"slug":"factorization-machines-for-data-with-implicit","title":"Factorization Machines for Data with Implicit Feedback","date":"2018-12-19","arxiv_id":"1812.08254","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-position-bias-without-intrusive","title":"Estimating Position Bias without Intrusive Interventions","date":"2018-12-12","arxiv_id":"1812.05161","repositories_listed":0,"syntology":null},{"url":null,"slug":"top-n-rank-a-scalable-list-wise-ranking","title":"Top-N-Rank: A Scalable List-wise Ranking Method for Recommender Systems","date":"2018-12-10","arxiv_id":"1812.04109","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-knowledge-graph-based-solution-for-entity","title":"A Knowledge Graph Based Solution for Entity Discovery and Linking in Open-Domain Questions","date":"2018-12-05","arxiv_id":"1812.01889","repositories_listed":0,"syntology":null},{"url":null,"slug":"mofsrank-a-multiobjective-evolutionary","title":"MOFSRank: A Multiobjective Evolutionary Algorithm for Feature Selection in Learning to Rank","date":"2018-12-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"intervention-harvesting-for-context-dependent","title":"Intervention Harvesting for Context-Dependent Examination-Bias Estimation","date":"2018-11-05","arxiv_id":"1811.01802","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-diverse-learning-to-rank-from-partial","title":"Online Diverse Learning to Rank from Partial-Click Feedback","date":"2018-11-01","arxiv_id":"1811.00911","repositories_listed":0,"syntology":null},{"url":null,"slug":"ontology-based-retrieval-neural-approaches","title":"Ontology-Based Retrieval \\& Neural Approaches for BioASQ Ideal Answer Generation","date":"2018-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieve-and-re-rank-a-simple-and-effective","title":"Retrieve and Re-rank: A Simple and Effective IR Approach to Simple Question Answering over Knowledge Graphs","date":"2018-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-to-rank-with-features","title":"Online Learning to Rank with Features","date":"2018-10-05","arxiv_id":"1810.02567","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-understanding-via-entity-attribute","title":"Query Understanding via Entity Attribute Identification","date":"2018-09-23","arxiv_id":"1809.08566","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-gist-of-images-ranking-of","title":"Understanding the Gist of Images - Ranking of Concepts for Multimedia Indexing","date":"2018-09-23","arxiv_id":"1809.08593","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-deep-and-representation-learning-for","title":"Towards Deep and Representation Learning for Talent Search at LinkedIn","date":"2018-09-17","arxiv_id":"1809.06473","repositories_listed":0,"syntology":null},{"url":null,"slug":"story-disambiguation-tracking-evolving-news","title":"Story Disambiguation: Tracking Evolving News Stories across News and Social Streams","date":"2018-08-16","arxiv_id":"1808.05906","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-focus-when-ranking-answers","title":"Learning to Focus when Ranking Answers","date":"2018-08-08","arxiv_id":"1808.02724","repositories_listed":0,"syntology":null},{"url":null,"slug":"crst-a-claim-retrieval-system-in-twitter","title":"CRST: a Claim Retrieval System in Twitter","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extractive-headline-generation-based-on","title":"Extractive Headline Generation Based on Learning to Rank for Community Question Answering","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"responding-e-commerce-product-questions-via","title":"Responding E-commerce Product Questions via Exploiting QA Collections and Reviews","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"live-detection-of-face-using-machine-learning","title":"Live Detection of Face Using Machine Learning with Multi-feature Method","date":"2018-07-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-line-in-the-sand-recommendation-or-ad-hoc","title":"A Line in the Sand: Recommendation or Ad-hoc Retrieval?","date":"2018-07-21","arxiv_id":"1807.08061","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-ranking-model-with-multiple","title":"A Collaborative Ranking Model with Multiple Location-based Similarities for Venue Suggestion","date":"2018-07-13","arxiv_id":"1807.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-non-parametric-learning-to-rank","title":"Towards Non-Parametric Learning to Rank","date":"2018-07-09","arxiv_id":"1807.03395","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-autoencoder-approach-for-document","title":"A Neural Autoencoder Approach for Document Ranking and Query Refinement in Pharmacogenomic Information Retrieval","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"biomedical-document-retrieval-for-clinical","title":"Biomedical Document Retrieval for Clinical Decision Support System","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-consistent-adversarial","title":"Efficient and Consistent Adversarial Bipartite Matching","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-learning-to-rank-via-low-rank","title":"Extreme Learning to Rank via Low Rank Assumption","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"posthoc-interpretability-of-learning-to-rank","title":"Posthoc Interpretability of Learning to Rank Models using Secondary Training Data","date":"2018-06-29","arxiv_id":"1806.11330","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-from-samples-of-variable","title":"Learning to Rank from Samples of Variable Quality","date":"2018-06-21","arxiv_id":"1806.08694","repositories_listed":0,"syntology":null},{"url":null,"slug":"par4sim-adaptive-paraphrasing-for-text","title":"Par4Sim -- Adaptive Paraphrasing for Text Simplification","date":"2018-06-21","arxiv_id":"1806.08309","repositories_listed":0,"syntology":null},{"url":null,"slug":"bubblerank-safe-online-learning-to-rerank","title":"BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback","date":"2018-06-15","arxiv_id":"1806.05819","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-context-aware-point-of-interest","title":"Personalized Context-Aware Point of Interest Recommendation","date":"2018-06-14","arxiv_id":"1806.05736","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-robustness-under-adversarial-document","title":"Ranking Robustness Under Adversarial Document Manipulations","date":"2018-06-13","arxiv_id":"1806.04425","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-theoretical-understanding-of-weak","title":"Towards Theoretical Understanding of Weak Supervision for Information Retrieval","date":"2018-06-13","arxiv_id":"1806.04815","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-position-bias-estimation-without","title":"Consistent Position Bias Estimation without Online Interventions for Learning-to-Rank","date":"2018-06-09","arxiv_id":"1806.03555","repositories_listed":0,"syntology":null},{"url":null,"slug":"toprank-a-practical-algorithm-for-online","title":"TopRank: A practical algorithm for online stochastic ranking","date":"2018-06-06","arxiv_id":"1806.02248","repositories_listed":0,"syntology":null},{"url":null,"slug":"ifair-learning-individually-fair-data","title":"iFair: Learning Individually Fair Data Representations for Algorithmic Decision Making","date":"2018-06-04","arxiv_id":"1806.01059","repositories_listed":0,"syntology":null},{"url":"/paper/cross-lingual-learning-to-rank-with-shared","slug":"cross-lingual-learning-to-rank-with-shared","title":"Cross-Lingual Learning-to-Rank with Shared Representations","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dialog-generation-using-multi-turn-reasoning","title":"Dialog Generation Using Multi-Turn Reasoning Neural Networks","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-of-gradient-space-for","title":"Efficient Exploration of Gradient Space for Online Learning to Rank","date":"2018-05-18","arxiv_id":"1805.07317","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-contextualization-of","title":"Weakly-supervised Contextualization of Knowledge Graph Facts","date":"2018-05-07","arxiv_id":"1805.02393","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-relatedness-of-wikipedia-concepts","title":"Semantic Relatedness of Wikipedia Concepts -- Benchmark Data and a Working Solution","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-automatic-construction-of-word-formation","title":"Semi-Automatic Construction of Word-Formation Networks (for Polish and Spanish)","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"counterfactual-learning-to-rank-for-additive","title":"A General Framework for Counterfactual Learning-to-Rank","date":"2018-04-30","arxiv_id":"1805.00065","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-the-ranking-relative-principal","title":"Application of the Ranking Relative Principal Component Attributes Network Model (REL-PCANet) for the Inclusive Development Index Estimation","date":"2018-04-16","arxiv_id":"1804.06219","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-descriptors-optimized-for-average","title":"Local Descriptors Optimized for Average Precision","date":"2018-04-15","arxiv_id":"1804.05312","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-and-model-comparison-on","title":"Feature Selection and Model Comparison on Microsoft Learning-to-Rank Data Sets","date":"2018-03-14","arxiv_id":"1803.05127","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-network-for-learning-to-rank","title":"Deep Neural Network for Learning to Rank Query-Text Pairs","date":"2018-02-25","arxiv_id":"1802.08988","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-learning-to-rank-and-rerank","title":"Direct Learning to Rank and Rerank","date":"2018-02-21","arxiv_id":"1802.07400","repositories_listed":0,"syntology":null},{"url":null,"slug":"web-scale-responsive-visual-search-at-bing","title":"Web-Scale Responsive Visual Search at Bing","date":"2018-02-14","arxiv_id":"1802.04914","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-neural-networks-for-soft","title":"Convolutional Neural Networks for Soft Matching N-Grams in Ad-hoc Search","date":"2018-02-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-multi-view-learning-to-rank","title":"Deep Multi-view Learning to Rank","date":"2018-01-31","arxiv_id":"1801.10402","repositories_listed":0,"syntology":null},{"url":null,"slug":"assertion-based-qa-with-question-aware-open","title":"Assertion-based QA with Question-Aware Open Information Extraction","date":"2018-01-23","arxiv_id":"1801.07414","repositories_listed":0,"syntology":null},{"url":null,"slug":"drug-selection-via-joint-push-and-learning-to","title":"Drug Selection via Joint Push and Learning to Rank","date":"2018-01-23","arxiv_id":"1801.07691","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-select-problem-solution-and","title":"Learning to Select: Problem, Solution, and Applications","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"3812ca4f78f432214b56982502d4fee5c72a1929fc50db2ff6a449da6be34f16","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}