{"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/5","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":5,"pages_in_order":8,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/learning-to-rank/papers/6","papers":[{"url":null,"slug":"optimizing-ranking-systems-online-as-bandits","title":"Optimizing Ranking Systems Online as Bandits","date":"2021-10-12","arxiv_id":"2110.05807","repositories_listed":0,"syntology":null},{"url":null,"slug":"roomstructnet-learning-to-rank-non-cuboidal","title":"RoomStructNet: Learning to Rank Non-Cuboidal Room Layouts From Single View","date":"2021-10-01","arxiv_id":"2110.00644","repositories_listed":0,"syntology":null},{"url":null,"slug":"born-again-neural-rankers","title":"Improving Neural Ranking via Lossless Knowledge Distillation","date":"2021-09-30","arxiv_id":"2109.15285","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-count-by-learning-to-rank-weakly","title":"Learning-to-Count by Learning-to-Rank: Weakly Supervised Object Counting & Localization Using Only Pairwise Image Rankings","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rank4class-examining-multiclass","title":"Rank4Class: Examining Multiclass Classification through the Lens of Learning to Rank","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"overview-of-the-clef-2019-checkthat-automatic","title":"Overview of the CLEF-2019 CheckThat!: Automatic Identification and Verification of Claims","date":"2021-09-25","arxiv_id":"2109.15118","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-anomalies-scalar-performance","title":"Learning to Rank Anomalies: Scalar Performance Criteria and Maximization of Two-Sample Rank Statistics","date":"2021-09-20","arxiv_id":"2109.09590","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-of-optimally-diverse-rankings","title":"Online Learning of Optimally Diverse Rankings","date":"2021-09-13","arxiv_id":"2109.05899","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-nosh-efficient-predictor-based","title":"RANK-NOSH: Efficient Predictor-Based Architecture Search via Non-Uniform Successive Halving","date":"2021-08-18","arxiv_id":"2108.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-relevance-ranking-under-the-pre","title":"Modeling Relevance Ranking under the Pre-training and Fine-tuning Paradigm","date":"2021-08-12","arxiv_id":"2108.05652","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-neural-ranking-models-robust","title":"Are Neural Ranking Models Robust?","date":"2021-08-11","arxiv_id":"2108.05018","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-pairwise-learning-to-rank-for-search","title":"Deep Pairwise Learning To Rank For Search Autocomplete","date":"2021-08-11","arxiv_id":"2108.04976","repositories_listed":0,"syntology":null},{"url":null,"slug":"ultra-an-unbiased-learning-to-rank-algorithm","title":"ULTRA: An Unbiased Learning To Rank Algorithm Toolbox","date":"2021-08-11","arxiv_id":"2108.05073","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-cascade-bandits-mitigating-exposure","title":"Unbiased Cascade Bandits: Mitigating Exposure Bias in Online Learning to Rank Recommendation","date":"2021-08-07","arxiv_id":"2108.03440","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-effects-of-adversarial","title":"Understanding the Effects of Adversarial Personalized Ranking Optimization Method on Recommendation Quality","date":"2021-07-29","arxiv_id":"2107.13876","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranker-agnostic-contextual-position-bias","title":"Ranker-agnostic Contextual Position Bias Estimation","date":"2021-07-28","arxiv_id":"2107.13327","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranksrgan-super-resolution-generative","title":"RankSRGAN: Super Resolution Generative Adversarial Networks with Learning to Rank","date":"2021-07-20","arxiv_id":"2107.09427","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-semantically-similar-queries-for","title":"Leveraging semantically similar queries for ranking via combining representations","date":"2021-06-23","arxiv_id":"2106.12621","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-question-answer-pairs-with-1","title":"Learning to Rank Question Answer Pairs with Bilateral Contrastive Data Augmentation","date":"2021-06-21","arxiv_id":"2106.11096","repositories_listed":0,"syntology":null},{"url":null,"slug":"rankdetnet-delving-into-ranking-constraints","title":"RankDetNet: Delving Into Ranking Constraints for Object Detection","date":"2021-06-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learning-to-rank-long-sequences-with","title":"On Learning to Rank Long Sequences with Contextual Bandits","date":"2021-06-07","arxiv_id":"2106.03546","repositories_listed":0,"syntology":null},{"url":null,"slug":"de-biased-modelling-of-search-click-behavior","title":"De-Biased Modelling of Search Click Behavior with Reinforcement Learning","date":"2021-05-21","arxiv_id":"2105.10072","repositories_listed":0,"syntology":null},{"url":null,"slug":"rlirank-learning-to-rank-with-reinforcement","title":"RLIRank: Learning to Rank with Reinforcement Learning for Dynamic Search","date":"2021-05-21","arxiv_id":"2105.10124","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-unbiased-learning-to-rank","title":"Federated Unbiased Learning to Rank","date":"2021-05-11","arxiv_id":"2105.04761","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-personalised-item-ranking-through","title":"Scalable Personalised Item Ranking through Parametric Density Estimation","date":"2021-05-11","arxiv_id":"2105.04769","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-bert-a-context-aware-bert-retrieval-model","title":"Co-BERT: A Context-Aware BERT Retrieval Model Incorporating Local and Query-specific Context","date":"2021-04-17","arxiv_id":"2104.08523","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-financial-news-and-tweet-based-time","title":"FAST: Financial News and Tweet Based Time Aware Network for Stock Trading","date":"2021-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-calibration-and-uncertainty-of-neural-1","title":"On the Calibration and Uncertainty of Neural Learning to Rank Models for Conversational Search","date":"2021-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"community-based-cyberreading-for-information","title":"Community-based Cyberreading for Information Understanding","date":"2021-03-27","arxiv_id":"2103.14934","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-ranking-a-survey","title":"Fairness in Ranking: A Survey","date":"2021-03-25","arxiv_id":"2103.14000","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-neural-re-ranking-approach","title":"Attention-based neural re-ranking approach for next city in trip recommendations","date":"2021-03-23","arxiv_id":"2103.12475","repositories_listed":0,"syntology":null},{"url":null,"slug":"individually-fair-ranking","title":"Individually Fair Ranking","date":"2021-03-19","arxiv_id":"2103.11023","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-feature-selection-for-learning-to-rank","title":"Neural Feature Selection for Learning to Rank","date":"2021-02-22","arxiv_id":"2102.11345","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-ranking-using-optimum-path-forest","title":"Information Ranking Using Optimum-Path Forest","date":"2021-02-16","arxiv_id":"2102.07917","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-user-behavior-history-for","title":"Leveraging User Behavior History for Personalized Email Search","date":"2021-02-15","arxiv_id":"2102.07279","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-through-regularization-for-learning","title":"Fairness Through Regularization for Learning to Rank","date":"2021-02-11","arxiv_id":"2102.05996","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-perspective-combined-recall-and-rank","title":"A multi-perspective combined recall and rank framework for Chinese procedure terminology normalization","date":"2021-01-22","arxiv_id":"2101.09101","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-the-benefits-of-model-ensembles-in","title":"Assessing the Benefits of Model Ensembles in Neural Re-Ranking for Passage Retrieval","date":"2021-01-21","arxiv_id":"2101.08705","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-e-commerce-ranking-signals-via","title":"Analysis of E-commerce Ranking Signals via Signal Temporal Logic","date":"2021-01-14","arxiv_id":"2101.05415","repositories_listed":0,"syntology":null},{"url":null,"slug":"individually-fair-rankings","title":"Individually Fair Rankings","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-rankers-are-hitherto-outperformed-by","title":"Neural Rankers are hitherto Outperformed by Gradient Boosted Decision Trees","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-frequency-based-learning-to-rank-approach","title":"A Frequency-Based Learning-To-Rank Approach for Personal Digital Traces","date":"2020-12-24","arxiv_id":"2012.13114","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-cross-sectional-systematic","title":"Building Cross-Sectional Systematic Strategies By Learning to Rank","date":"2020-12-13","arxiv_id":"2012.07149","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-user-interactions-with-rankings","title":"Learning from User Interactions with Rankings: A Unification of the Field","date":"2020-12-09","arxiv_id":"2012.06576","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-protocol-to-screening-a-hybrid-learning","title":"From Protocol to Screening: A Hybrid Learning Approach for Technology-Assisted Systematic Literature Reviews","date":"2020-11-19","arxiv_id":"2011.09752","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrec-matrix-factorization-for-highly-skewed","title":"MatRec: Matrix Factorization for Highly Skewed Dataset","date":"2020-11-09","arxiv_id":"2011.04395","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-missing-data-via","title":"Extended Missing Data Imputation via GANs for Ranking Applications","date":"2020-11-04","arxiv_id":"2011.02089","repositories_listed":0,"syntology":null},{"url":null,"slug":"u-rank-utility-oriented-learning-to-rank-with","title":"U-rank: Utility-oriented Learning to Rank with Implicit Feedback","date":"2020-11-01","arxiv_id":"2011.00550","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-are-you-trying-to-do-semantic-typing-of-1","title":"What Are You Trying to Do? Semantic Typing of Event Processes","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/embedding-meta-textual-information-for","slug":"embedding-meta-textual-information-for","title":"Embedding Meta-Textual Information for Improved Learning to Rank","date":"2020-10-30","arxiv_id":"2010.16313","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-purchase-impression-gap-through-a","title":"Addressing Purchase-Impression Gap through a Sequential Re-ranker","date":"2020-10-27","arxiv_id":"2010.14570","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-ranking-for-representation","title":"Self-Supervised Ranking for Representation Learning","date":"2020-10-14","arxiv_id":"2010.07258","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-are-you-trying-to-do-semantic-typing-of","title":"\"What Are You Trying to Do?\" Semantic Typing of Event Processes","date":"2020-10-13","arxiv_id":"2010.06724","repositories_listed":0,"syntology":null},{"url":null,"slug":"refining-data-for-text-generation","title":"Refining Data for Text Generation","date":"2020-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-personalize-for-web-search","title":"Learning to Personalize for Web Search Sessions","date":"2020-09-17","arxiv_id":"2009.08206","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-evidence-ranking-for-fact-checking","title":"Time-Aware Evidence Ranking for Fact-Checking","date":"2020-09-10","arxiv_id":"2009.06402","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-under-multinomial-logit","title":"Learning to Rank under Multinomial Logit Choice","date":"2020-09-07","arxiv_id":"2009.03207","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimize-what-you-evaluate-with-a-simple-yet","title":"Optimize What You Evaluate With: A Simple Yet Effective Framework For Direct Optimization Of IR Metrics","date":"2020-08-31","arxiv_id":"2008.13373","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-rank-weak-multi-objective","title":"Sample-Rank: Weak Multi-Objective Recommendations Using Rejection Sampling","date":"2020-08-24","arxiv_id":"2008.10277","repositories_listed":0,"syntology":null},{"url":null,"slug":"no-reference-quality-assessment-with","title":"No-reference Screen Content Image Quality Assessment with Unsupervised Domain Adaptation","date":"2020-08-19","arxiv_id":"2008.08561","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-put-users-in-control-of-their-data-via","title":"How to Put Users in Control of their Data in Federated Top-N Recommendation with Learning to Rank","date":"2020-08-17","arxiv_id":"2008.07192","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-bert-and-lightgbm-based-model-for","title":"A Hybrid BERT and LightGBM based Model for Predicting Emotion GIF Categories on Twitter","date":"2020-08-14","arxiv_id":"2008.06176","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-active-learning-a","title":"Learning to Rank for Active Learning: A Listwise Approach","date":"2020-07-31","arxiv_id":"2008.00078","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-representations-for-axis-aligned","title":"Learning Representations for Axis-Aligned Decision Forests through Input Perturbation","date":"2020-07-29","arxiv_id":"2007.14761","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-principals-and-accessories-in-a","title":"Identifying Principals and Accessories in a Complex Case based on the Comprehension of Fact Description","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-automated-neural-interaction","title":"Towards Automated Neural Interaction Discovery for Click-Through Rate Prediction","date":"2020-06-29","arxiv_id":"2007.06434","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-partitioned-preference","title":"Learning-to-Rank with Partitioned Preference: Fast Estimation for the Plackett-Luce Model","date":"2020-06-09","arxiv_id":"2006.05067","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-learning-curves-1","title":"Learning to Rank Learning Curves","date":"2020-06-05","arxiv_id":"2006.03361","repositories_listed":0,"syntology":null},{"url":null,"slug":"cascade-model-based-propensity-estimation-for","title":"Cascade Model-based Propensity Estimation for Counterfactual Learning to Rank","date":"2020-05-25","arxiv_id":"2005.11938","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-music-tracks-using-triplet","title":"Learning to rank music tracks using triplet loss","date":"2020-05-18","arxiv_id":"2005.12977","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-learning-to-rank-via-propensity","title":"Non-Clicks Mean Irrelevant? Propensity Ratio Scoring As a Correction","date":"2020-05-18","arxiv_id":"2005.08480","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-document-interactions-for-learning","title":"Modeling Document Interactions for Learning to Rank with Regularized Self-Attention","date":"2020-05-08","arxiv_id":"2005.03932","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-learning-to-rank-with","title":"Interpretable Learning-to-Rank with Generalized Additive Models","date":"2020-05-06","arxiv_id":"2005.02553","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-intents-in-voice-assistants","title":"Learning to Rank Intents in Voice Assistants","date":"2020-04-30","arxiv_id":"2005.00119","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-level-early-exit-for-additive-learning","title":"Query-level Early Exit for Additive Learning-to-Rank Ensembles","date":"2020-04-30","arxiv_id":"2004.14641","repositories_listed":0,"syntology":null},{"url":null,"slug":"valid-explanations-for-learning-to-rank","title":"Valid Explanations for Learning to Rank Models","date":"2020-04-29","arxiv_id":"2004.13972","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-memory-efficient-neural-code","title":"Fast and Memory-Efficient Neural Code Completion","date":"2020-04-28","arxiv_id":"2004.13651","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-learning-to-rank-online-or-offline","title":"Unbiased Learning to Rank: Online or Offline?","date":"2020-04-28","arxiv_id":"2004.13574","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-in-the-position-based-model","title":"Learning to Rank in the Position Based Model with Bandit Feedback","date":"2020-04-27","arxiv_id":"2004.13106","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-driven-distractor-generation-for","title":"Knowledge-Driven Distractor Generation for Cloze-style Multiple Choice Questions","date":"2020-04-21","arxiv_id":"2004.09853","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-bert-in-tf-ranking","title":"Learning-to-Rank with BERT in TF-Ranking","date":"2020-04-17","arxiv_id":"2004.08476","repositories_listed":0,"syntology":null},{"url":null,"slug":"layered-graph-embedding-for-entity","title":"Layered Graph Embedding for Entity Recommendation using Wikipedia in the Yahoo! Knowledge Graph","date":"2020-04-15","arxiv_id":"2004.06842","repositories_listed":0,"syntology":null},{"url":"/paper/grayscale-data-construction-and-multi-level","slug":"grayscale-data-construction-and-multi-level","title":"The World is Not Binary: Learning to Rank with Grayscale Data for Dialogue Response Selection","date":"2020-04-06","arxiv_id":"2004.02421","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-productionizing-subjective-search","title":"Towards Productionizing Subjective Search Systems","date":"2020-03-31","arxiv_id":"2003.13968","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-ground-truth-an-evaluator","title":"AliExpress Learning-To-Rank: Maximizing Online Model Performance without Going Online","date":"2020-03-25","arxiv_id":"2003.11941","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-notable-news-stories","title":"Identifying Notable News Stories","date":"2020-03-16","arxiv_id":"2003.07461","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochasticrank-global-optimization-of-scale","title":"StochasticRank: Global Optimization of Scale-Free Discrete Functions","date":"2020-03-04","arxiv_id":"2003.02122","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-position-bias-for-unbiased-learning","title":"Handling Position Bias for Unbiased Learning to Rank in Hotels Search","date":"2020-02-28","arxiv_id":"2002.12528","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-prioritization-of-cognitive","title":"Cognitive Biomarker Prioritization in Alzheimer's Disease using Brain Morphometric Data","date":"2020-02-18","arxiv_id":"2002.07699","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-uplift-modeling","title":"Learning to rank for uplift modeling","date":"2020-02-14","arxiv_id":"2002.05897","repositories_listed":0,"syntology":null},{"url":null,"slug":"listwise-learning-to-rank-with-deep-q","title":"Listwise Learning to Rank with Deep Q-Networks","date":"2020-02-13","arxiv_id":"2002.07651","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoalpha-an-efficient-hierarchical","title":"AutoAlpha: an Efficient Hierarchical Evolutionary Algorithm for Mining Alpha Factors in Quantitative Investment","date":"2020-02-09","arxiv_id":"2002.08245","repositories_listed":0,"syntology":null},{"url":null,"slug":"eliminating-search-intent-bias-in-learning-to","title":"Eliminating Search Intent Bias in Learning to Rank","date":"2020-02-08","arxiv_id":"2002.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"jplink-on-linking-jobs-to-vocational-interest","title":"JPLink: On Linking Jobs to Vocational Interest Types","date":"2020-02-06","arxiv_id":"2002.02557","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-api-recommendation-with-implicit","title":"Boosting API Recommendation with Implicit Feedback","date":"2020-02-04","arxiv_id":"2002.01264","repositories_listed":0,"syntology":null},{"url":null,"slug":"correcting-for-selection-bias-in-learning-to","title":"Correcting for Selection Bias in Learning-to-rank Systems","date":"2020-01-29","arxiv_id":"2001.11358","repositories_listed":0,"syntology":null},{"url":null,"slug":"toprank-a-refinement-of-toprank-algorithm","title":"TopRank+: A Refinement of TopRank Algorithm","date":"2020-01-21","arxiv_id":"2001.07617","repositories_listed":0,"syntology":null},{"url":null,"slug":"influence-diagram-bandits","title":"Influence Diagram Bandits","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-sensitive-feature-value-acquisition","title":"Cost-Sensitive Feature-Value Acquisition Using Feature Relevance","date":"2019-12-17","arxiv_id":"1912.08281","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-contextual-bandit-approach-to-online","title":"Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity","date":"2019-12-01","arxiv_id":"1912.00508","repositories_listed":0,"syntology":null}],"record_sha256":"d23ae75ce6ab14340a2beb986b62f7eec8874d0212828107d3c92092bdc2a455","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}