{"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/7","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":7,"pages_in_order":8,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/learning-to-rank/papers/8","papers":[{"url":null,"slug":"learning-to-rank-based-on-analogical","title":"Learning to Rank based on Analogical Reasoning","date":"2017-11-28","arxiv_id":"1711.10207","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-ranking-models-with-multiple-document","title":"Neural Ranking Models with Multiple Document Fields","date":"2017-11-25","arxiv_id":"1711.09174","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-erm-principle-with-networked-data","title":"On the ERM Principle with Networked Data","date":"2017-11-12","arxiv_id":"1711.04297","repositories_listed":0,"syntology":null},{"url":null,"slug":"wmrb-learning-to-rank-in-a-scalable-batch","title":"WMRB: Learning to Rank in a Scalable Batch Training Approach","date":"2017-11-10","arxiv_id":"1711.04015","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-visual-features-from-snapshots-for","title":"Learning Visual Features from Snapshots for Web Search","date":"2017-10-19","arxiv_id":"1710.06997","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-selection-for-real-time-sports-news","title":"Content Selection for Real-time Sports News Construction from Commentary Texts","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-semantic-coherence-for-topic","title":"Learning to Rank Semantic Coherence for Topic Segmentation","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-kernels-for-structures-and-embeddings","title":"Ranking Kernels for Structures and Embeddings: A Hybrid Preference and Classification Model","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-answer-selection-with-pre-trained","title":"Improved Answer Selection with Pre-Trained Word Embeddings","date":"2017-08-14","arxiv_id":"1708.04326","repositories_listed":0,"syntology":null},{"url":null,"slug":"beihang-msra-at-semeval-2017-task-3-a-ranking","title":"Beihang-MSRA at SemEval-2017 Task 3: A Ranking System with Neural Matching Features for Community Question Answering","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learningtoquestion-at-semeval-2017-task-3","title":"LearningToQuestion at SemEval 2017 Task 3: Ranking Similar Questions by Learning to Rank Using Rich Features","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factorization-machines-leveraging-lightweight","title":"Factorization Machines Leveraging Lightweight Linked Open Data-enabled Features for Top-N Recommendations","date":"2017-07-28","arxiv_id":"1707.05651","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-investigation-of-deep-ir-models","title":"A Deep Investigation of Deep IR Models","date":"2017-07-24","arxiv_id":"1707.07700","repositories_listed":0,"syntology":null},{"url":null,"slug":"darkrank-accelerating-deep-metric-learning","title":"DarkRank: Accelerating Deep Metric Learning via Cross Sample Similarities Transfer","date":"2017-07-05","arxiv_id":"1707.01220","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-network-framework-for-noisy-label","title":"A Network Framework for Noisy Label Aggregation in Social Media","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"alternative-objective-functions-for-training","title":"Alternative Objective Functions for Training MT Evaluation Metrics","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-retargeted-images","title":"Learning to Rank Retargeted Images","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"autobagging-learning-to-rank-bagging","title":"autoBagging: Learning to Rank Bagging Workflows with Metalearning","date":"2017-06-28","arxiv_id":"1706.09367","repositories_listed":0,"syntology":null},{"url":null,"slug":"click-aware-purchase-prediction-with-push-at","title":"Click-aware purchase prediction with push at the top","date":"2017-06-21","arxiv_id":"1706.06716","repositories_listed":0,"syntology":null},{"url":null,"slug":"word-entity-duet-representations-for-document","title":"Word-Entity Duet Representations for Document Ranking","date":"2017-06-20","arxiv_id":"1706.06636","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-to-learn-and-learning-to-rank-on-the","title":"Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications","date":"2017-06-01","arxiv_id":"1706.05933","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-models-for-information-retrieval","title":"Neural Models for Information Retrieval","date":"2017-05-03","arxiv_id":"1705.01509","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-by-ranking-for-weakly","title":"Transfer Learning by Ranking for Weakly Supervised Object Annotation","date":"2017-05-02","arxiv_id":"1705.00873","repositories_listed":0,"syntology":null},{"url":null,"slug":"misspecified-linear-bandits","title":"Misspecified Linear Bandits","date":"2017-04-23","arxiv_id":"1704.06880","repositories_listed":0,"syntology":null},{"url":null,"slug":"if-you-cant-beat-them-join-them-handcrafted","title":"If You Can't Beat Them Join Them: Handcrafted Features Complement Neural Nets for Non-Factoid Answer Reranking","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-to-rank-in-stochastic-click","title":"Online Learning to Rank in Stochastic Click Models","date":"2017-03-07","arxiv_id":"1703.02527","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-to-engage-new-listwise-approaches-to","title":"Rank-to-engage: New Listwise Approaches to Maximize Engagement","date":"2017-02-24","arxiv_id":"1702.07798","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-attention-based-deep-net-for-learning-to","title":"An Attention-Based Deep Net for Learning to Rank","date":"2017-02-20","arxiv_id":"1702.06106","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-what-matters-sampling-interesting","title":"Learning what matters - Sampling interesting patterns","date":"2017-02-07","arxiv_id":"1702.01975","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-to-complex-cross-modal-learning-to","title":"Simple to Complex Cross-modal Learning to Rank","date":"2017-02-04","arxiv_id":"1702.01229","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-novelty-and-salience-adaptive","title":"Balancing Novelty and Salience: Adaptive Learning to Rank Entities for Timeline Summarization of High-impact Events","date":"2017-01-14","arxiv_id":"1701.03947","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-and-learning-to-rank","title":"Classification and Learning-to-rank Approaches for Cross-Device Matching at CIKM Cup 2016","date":"2016-12-20","arxiv_id":"1612.07117","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-jitter-dense-supervision-for-visual","title":"Semantic Jitter: Dense Supervision for Visual Comparisons via Synthetic Images","date":"2016-12-19","arxiv_id":"1612.06341","repositories_listed":0,"syntology":null},{"url":null,"slug":"chinese-to-japanese-patent-machine-1","title":"Chinese-to-Japanese Patent Machine Translation based on Syntactic Pre-ordering for WAT 2016","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-weight-translations-using-ordinal","title":"Learning to Weight Translations using Ordinal Linear Regression and Query-generated Training Data for Ad-hoc Retrieval with Long Queries","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-attention-for-learning-to-rank","title":"Neural Attention for Learning to Rank Questions in Community Question Answering","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vsolscsum-building-a-vietnamese-sentence","title":"VSoLSCSum: Building a Vietnamese Sentence-Comment Dataset for Social Context Summarization","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quad-networks-unsupervised-learning-to-rank","title":"Quad-networks: unsupervised learning to rank for interest point detection","date":"2016-11-22","arxiv_id":"1611.07571","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-scientific-documents-from","title":"Learning to Rank Scientific Documents from the Crowd","date":"2016-11-04","arxiv_id":"1611.01400","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-community-question-answering-in","title":"Addressing Community Question Answering in English and Arabic","date":"2016-10-18","arxiv_id":"1610.05522","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-lambdamart-using-oblivious-trees","title":"Enhancing LambdaMART Using Oblivious Trees","date":"2016-09-19","arxiv_id":"1609.05610","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-recommendation-system-for-cable-tv","title":"A Flexible Recommendation System for Cable TV","date":"2016-09-13","arxiv_id":"1609.02451","repositories_listed":0,"syntology":null},{"url":null,"slug":"dont-mention-the-shoe-a-learning-to-rank","title":"Don't Mention the Shoe! A Learning to Rank Approach to Content Selection for Image Description Generation","date":"2016-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-to-rank-with-top-k-feedback","title":"Online Learning to Rank with Top-k Feedback","date":"2016-08-23","arxiv_id":"1608.06408","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-and-statistical-tradeoffs-in","title":"Computational and Statistical Tradeoffs in Learning to Rank","date":"2016-08-22","arxiv_id":"1608.06203","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-learning-to-rank-with-biased","title":"Unbiased Learning-to-Rank with Biased Feedback","date":"2016-08-16","arxiv_id":"1608.04468","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-gap-incorporating-a-semantic","title":"Bridging the Gap: Incorporating a Semantic Similarity Measure for Effectively Mapping PubMed Queries to Documents","date":"2016-08-05","arxiv_id":"1608.01972","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-synthesizing-planning","title":"Learning to Rank for Synthesizing Planning Heuristics","date":"2016-08-03","arxiv_id":"1608.01302","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-multi-task-learning-for-automated","title":"Constrained Multi-Task Learning for Automated Essay Scoring","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"docchat-an-information-retrieval-approach-for","title":"DocChat: An Information Retrieval Approach for Chatbot Engines Using Unstructured Documents","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-paraphrasing-for-multiword","title":"Learning Paraphrasing for Multiword Expressions","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"news-citation-recommendation-with-implicit","title":"News Citation Recommendation with Implicit and Explicit Semantics","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-constructing-sports-news-from-live","title":"Towards Constructing Sports News from Live Text Commentary","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-learning-to-rank-to-enhance-nlm-medical","title":"Using Learning-To-Rank to Enhance NLM Medical Text Indexer Results","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-optimal-card-ranking-from-query","title":"Learning Optimal Card Ranking from Query Reformulation","date":"2016-06-22","arxiv_id":"1606.06816","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-term-weights-for-ad-hoc-retrieval","title":"Learning Term Weights for Ad-hoc Retrieval","date":"2016-06-14","arxiv_id":"1606.04223","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-neural-networks-vs-convolution","title":"Convolutional Neural Networks vs. Convolution Kernels: Feature Engineering for Answer Sentence Reranking","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ecnu-at-semeval-2016-task-7-an-enhanced","title":"ECNU at SemEval-2016 Task 7: An Enhanced Supervised Learning Method for Lexicon Sentiment Intensity Ranking","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mte-nn-at-semeval-2016-task-3-can-machine","title":"MTE-NN at SemEval-2016 Task 3: Can Machine Translation Evaluation Help Community Question Answering?","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"qu-ir-at-semeval-2016-task-3-learning-to-rank","title":"QU-IR at SemEval 2016 Task 3: Learning to Rank on Arabic Community Question Answering Forums with Word Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recognizing-reference-spans-and-classifying","title":"Recognizing Reference Spans and Classifying their Discourse Facets","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-personalized-search-results","title":"Learning to Rank Personalized Search Results in Professional Networks","date":"2016-05-16","arxiv_id":"1605.04624","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-comprehension-based-on-learning-to","title":"Machine Comprehension Based on Learning to Rank","date":"2016-05-11","arxiv_id":"1605.03284","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-based-learning-to-rank-assessment-of","title":"Transfer-Based Learning-to-Rank Assessment of Medical Term Technicality","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-for-learning-to","title":"Generalization error bounds for learning to rank: Does the length of document lists matter?","date":"2016-03-06","arxiv_id":"1603.01860","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-to-rank-with-feedback-at-the","title":"Online Learning to Rank with Feedback at the Top","date":"2016-03-06","arxiv_id":"1603.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"choice-by-elimination-via-deep-neural","title":"Choice by Elimination via Deep Neural Networks","date":"2016-02-17","arxiv_id":"1602.05285","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-minimum-volume-sets-and-anomaly","title":"Learning Minimum Volume Sets and Anomaly Detectors from KNN Graphs","date":"2016-01-22","arxiv_id":"1601.06105","repositories_listed":0,"syntology":null},{"url":null,"slug":"termpicker-enabling-the-reuse-of-vocabulary","title":"TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from the Linked Open Data Cloud - An Extended Technical Report","date":"2016-01-11","arxiv_id":"1512.05685","repositories_listed":0,"syntology":null},{"url":null,"slug":"activity-auto-completion-predicting-human","title":"Activity Auto-Completion: Predicting Human Activities From Partial Videos","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-based-on-subsequences","title":"Learning to Rank Based on Subsequences","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predtron-a-family-of-online-algorithms-for","title":"Predtron: A Family of Online Algorithms for General Prediction Problems","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"midrank-learning-to-rank-based-on","title":"MidRank: Learning to rank based on subsequences","date":"2015-11-29","arxiv_id":"1511.08951","repositories_listed":0,"syntology":null},{"url":null,"slug":"images-dont-lie-transferring-deep-visual","title":"Images Don't Lie: Transferring Deep Visual Semantic Features to Large-Scale Multimodal Learning to Rank","date":"2015-11-20","arxiv_id":"1511.06746","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-class-imbalance-in-link-prediction","title":"Handling Class Imbalance in Link Prediction using Learning to Rank Techniques","date":"2015-11-13","arxiv_id":"1511.04383","repositories_listed":0,"syntology":null},{"url":null,"slug":"factorizing-lambdamart-for-cold-start","title":"Factorizing LambdaMART for cold start recommendations","date":"2015-11-04","arxiv_id":"1511.01282","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-top-k-listnet","title":"Stochastic Top-k ListNet","date":"2015-11-01","arxiv_id":"1511.00271","repositories_listed":0,"syntology":null},{"url":null,"slug":"chinese-to-japanese-patent-machine","title":"Chinese-to-Japanese Patent Machine Translation based on Syntactic Pre-ordering forWAT 2015","date":"2015-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inducing-clause-combining-rules-a-case-study","title":"Inducing Clause-Combining Rules: A Case Study with the SPaRKy Restaurant Corpus","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ldtm-a-latent-document-type-model-for","title":"LDTM: A Latent Document Type Model for Cumulative Citation Recommendation","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-modulo-theories-for-preference","title":"Learning Modulo Theories for preference elicitation in hybrid domains","date":"2015-08-18","arxiv_id":"1508.04261","repositories_listed":0,"syntology":null},{"url":null,"slug":"perceptron-like-algorithms-for-online","title":"Perceptron like Algorithms for Online Learning to Rank","date":"2015-08-04","arxiv_id":"1508.00842","repositories_listed":0,"syntology":null},{"url":"/paper/challenges-in-clinical-natural-language","slug":"challenges-in-clinical-natural-language","title":"Challenges in clinical natural language processing for automated disorder normalization","date":"2015-07-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"faq-based-question-answering-via-word","title":"FAQ-based Question Answering via Word Alignment","date":"2015-07-09","arxiv_id":"1507.02628","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-regularizations-for-feature","title":"Non-convex Regularizations for Feature Selection in Ranking With Sparse SVM","date":"2015-07-02","arxiv_id":"1507.00500","repositories_listed":0,"syntology":null},{"url":null,"slug":"bring-you-to-the-past-automatic-generation-of","title":"Bring you to the past: Automatic Generation of Topically Relevant Event Chronicles","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-hybrid-representations-to-retrieve","title":"Learning Hybrid Representations to Retrieve Semantically Equivalent Questions","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sacry-syntax-based-automatic-crossword-puzzle","title":"SACRY: Syntax-based Automatic Crossword puzzle Resolution sYstem","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solar-scalable-online-learning-algorithms-for","title":"SOLAR: Scalable Online Learning Algorithms for Ranking","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cicbuapnlp-graph-based-approach-for-answer","title":"CICBUAPnlp: Graph-Based Approach for Answer Selection in Community Question Answering Task","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"making-better-use-of-edges-via-perceptual","title":"Making Better Use of Edges via Perceptual Grouping","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-learning-on-an-explicit-polynomial","title":"Similarity Learning on an Explicit Polynomial Kernel Feature Map for Person Re-Identification","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-image-retrieval-with-a-dual","title":"Cross-domain Image Retrieval with a Dual Attribute-aware Ranking Network","date":"2015-05-29","arxiv_id":"1505.07922","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-ranking-for-person-re-identification-via","title":"Deep Ranking for Person Re-identification via Joint Representation Learning","date":"2015-05-26","arxiv_id":"1505.06821","repositories_listed":0,"syntology":null},{"url":null,"slug":"bag-of-words-forced-decoding-for-cross","title":"Bag-of-Words Forced Decoding for Cross-Lingual Information Retrieval","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-accurate-preordering-for-smt-using","title":"Fast and Accurate Preordering for SMT using Neural Networks","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-in-person-re-identification","title":"Learning to rank in person re-identification with metric ensembles","date":"2015-03-05","arxiv_id":"1503.01543","repositories_listed":0,"syntology":null},{"url":null,"slug":"cascading-bandits-learning-to-rank-in-the","title":"Cascading Bandits: Learning to Rank in the Cascade Model","date":"2015-02-10","arxiv_id":"1502.02763","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-efficient-anomaly-detectors-from-k","title":"Learning Efficient Anomaly Detectors from $K$-NN Graphs","date":"2015-02-06","arxiv_id":"1502.01783","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-and-learning-to-rank-aggregation","title":"Regression and Learning to Rank Aggregation for User Engagement Evaluation","date":"2015-01-29","arxiv_id":"1501.07467","repositories_listed":0,"syntology":null}],"record_sha256":"5b5b6b15967be1d371b2321bc67f1bee8e86cac7e9a86841c0dc4029606473b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}