中文
相关论文

相关论文: ARSM Gradient Estimator for Supervised Learning to…

200 篇论文

Multi-label ranking maps instances to a ranked set of predicted labels from multiple possible classes. The ranking approach for multi-label learning problems received attention for its success in multi-label classification, with one of the…

计算机视觉与模式识别 · 计算机科学 2022-12-09 Emine Dari , V. Bugra Yesilkaynak , Alican Mertan , Gozde Unal

Active learning emerged as an alternative to alleviate the effort to label huge amount of data for data hungry applications (such as image/video indexing and retrieval, autonomous driving, etc.). The goal of active learning is to…

计算机视觉与模式识别 · 计算机科学 2020-10-20 Minghan Li , Xialei Liu , Joost van de Weijer , Bogdan Raducanu

Ranking is a key aspect of many applications, such as information retrieval, question answering, ad placement and recommender systems. Learning to rank has the goal of estimating a ranking model automatically from training data. In…

信息检索 · 计算机科学 2015-02-10 Truyen Tran , Dinh Phung , Svetha Venkatesh

Learning to rank (LTR) plays a crucial role in various Information Retrieval (IR) tasks. Although supervised LTR methods based on fine-grained relevance labels (e.g., document-level annotations) have achieved significant success, their…

信息检索 · 计算机科学 2025-08-21 Yiteng Tu , Zhichao Xu , Tao Yang , Weihang Su , Yujia Zhou , Yiqun Liu , Fen Lin , Qin Liu , Qingyao Ai

Learning-to-Rank (LTR) is a supervised machine learning approach that constructs models specifically designed to order a set of items or documents based on their relevance or importance to a given query or context. Despite significant…

信息检索 · 计算机科学 2026-04-17 Camilo Gomez , Pengyang Wang , Yanjie Fu

Learning to rank -- producing a ranked list of items specific to a query and with respect to a set of supervisory items -- is a problem of general interest. The setting we consider is one in which no analytic description of what constitutes…

Many popular linear classifiers, such as logistic regression, boosting, or SVM, are trained by optimizing a margin-based risk function. Traditionally, these risk functions are computed based on a labeled dataset. We develop a novel…

机器学习 · 计算机科学 2010-07-23 Krishnakumar Balasubramanian , Pinar Donmez , Guy Lebanon

Graded labels are ubiquitous in real-world learning-to-rank applications, especially in human rated relevance data. Traditional learning-to-rank techniques aim to optimize the ranked order of documents. They typically, however, ignore…

信息检索 · 计算机科学 2023-06-21 Le Yan , Zhen Qin , Gil Shamir , Dong Lin , Xuanhui Wang , Mike Bendersky

While in a classification or a regression setting a label or a value is assigned to each individual document, in a ranking setting we determine the relevance ordering of the entire input document list. This difference leads to the notion of…

信息检索 · 计算机科学 2021-05-07 Qingyao Ai , Xuanhui Wang , Sebastian Bruch , Nadav Golbandi , Michael Bendersky , Marc Najork

Nowadays, recommender systems already impact almost every facet of peoples lives. To provide personalized high quality recommendation results, conventional systems usually train pointwise rankers to predict the absolute value of objectives…

信息检索 · 计算机科学 2021-12-01 Yi Ren , Hongyan Tang , Siwen Zhu

List-wise learning to rank methods are considered to be the state-of-the-art. One of the major problems with these methods is that the ambiguous nature of relevance labels in learning to rank data is ignored. Ambiguity of relevance labels…

信息检索 · 计算机科学 2017-07-26 Rolf Jagerman , Julia Kiseleva , Maarten de Rijke

Listwise learning-to-rank methods form a powerful class of ranking algorithms that are widely adopted in applications such as information retrieval. These algorithms learn to rank a set of items by optimizing a loss that is a function of…

机器学习 · 计算机科学 2021-02-08 Sebastian Bruch

We present an attention-based ranking framework for learning to order sentences given a paragraph. Our framework is built on a bidirectional sentence encoder and a self-attention based transformer network to obtain an input order invariant…

计算与语言 · 计算机科学 2020-01-03 Pawan Kumar , Dhanajit Brahma , Harish Karnick , Piyush Rai

Learning from implicit feedback is challenging because of the difficult nature of the one-class problem: we can observe only positive examples. Most conventional methods use a pairwise ranking approach and negative samplers to cope with the…

机器学习 · 计算机科学 2021-05-12 Riku Togashi , Masahiro Kato , Mayu Otani , Tetsuya Sakai , Shin'ichi Satoh

News recommendation is a challenging task that involves personalization based on the interaction history and preferences of each user. Recent works have leveraged the power of pretrained language models (PLMs) to directly rank news items by…

信息检索 · 计算机科学 2024-09-27 Nithish Kannen , Yao Ma , Gerrit J. J. van den Burg , Jean Baptiste Faddoul

The last decade has seen a revolution in the theory and application of machine learning and pattern recognition. Through these advancements, variable ranking has emerged as an active and growing research area and it is now beginning to be…

计算机视觉与模式识别 · 计算机科学 2017-06-20 Giorgio Roffo

Learning to rank has recently emerged as an attractive technique to train deep convolutional neural networks for various computer vision tasks. Pairwise ranking, in particular, has been successful in multi-label image classification,…

计算机视觉与模式识别 · 计算机科学 2017-06-02 Yuncheng Li , Yale Song , Jiebo Luo

In the last years decision-focused learning framework, also known as predict-and-optimize, have received increasing attention. In this setting, the predictions of a machine learning model are used as estimated cost coefficients in the…

机器学习 · 计算机科学 2022-06-20 Jayanta Mandi , Víctor Bucarey , Maxime Mulamba , Tias Guns

Supervisory signals are a critical resource for training learning to rank models. In many real-world search and retrieval scenarios, these signals may not be readily available or could be costly to obtain for some queries. The examples…

信息检索 · 计算机科学 2024-10-10 Xuyang Wu , Ajit Puthenputhussery , Hongwei Shang , Changsung Kang , Yi Fang

Learning to Rank (LETOR) algorithms are usually trained on annotated corpora where a single relevance label is assigned to each available document-topic pair. Within the Cranfield framework, relevance labels result from merging either…

信息检索 · 计算机科学 2022-02-15 Alberto Purpura , Gianmaria Silvello , Gian Antonio Susto
‹ 上一页 1 2 3 10 下一页 ›