中文
相关论文

相关论文: Learning to Rank in the Position Based Model with …

200 篇论文

Implicit feedback data, such as user clicks, is commonly used in learning-to-rank (LTR) systems because it is easy to collect and it often reflects user preferences. However, this data is prone to various biases, and training an LTR…

信息检索 · 计算机科学 2026-01-30 Md Aminul Islam , Kathryn Vasilaky , Elena Zheleva

Clinical trials involving multiple treatments utilize randomization of the treatment assignments to enable the evaluation of treatment efficacies in an unbiased manner. Such evaluation is performed in post hoc studies that usually use…

人工智能 · 计算机科学 2018-09-10 Yogatheesan Varatharajah , Brent Berry , Sanmi Koyejo , Ravishankar Iyer

The recent literature on online learning to rank (LTR) has established the utility of prior knowledge to Bayesian ranking bandit algorithms. However, a major limitation of existing work is the requirement for the prior used by the algorithm…

机器学习 · 计算机科学 2023-02-27 Javad Azizi , Ofer Meshi , Masrour Zoghi , Maryam Karimzadehgan

Contextual bandits are widely used in industrial personalization systems. These online learning frameworks learn a treatment assignment policy in the presence of treatment effects that vary with the observed contextual features of the…

机器学习 · 计算机科学 2022-05-11 Claudia Roberts , Maria Dimakopoulou , Qifeng Qiao , Ashok Chandrashekhar , Tony Jebara

In recent years, instructional practices in Operations Research (OR), Management Science (MS), and Analytics have increasingly shifted toward digital environments, where large and diverse groups of learners make it difficult to provide…

机器学习 · 统计学 2026-03-12 Lukas De Kerpel , Arthur Thuy , Dries F. Benoit

In many web applications, a recommendation is not a single item suggested to a user but a list of possibly interesting contents that may be ranked in some contexts. The combinatorial bandit problem has been studied quite extensively these…

数据结构与算法 · 计算机科学 2016-05-27 Hossein Vahabi , Paul Lagrée , Claire Vernade , Olivier Cappé

Contextual multi-armed bandits are classical models in reinforcement learning for sequential decision-making associated with individual information. A widely-used policy for bandits is Thompson Sampling, where samples from a data-driven…

机器学习 · 统计学 2021-11-30 Hongju Park , Mohamad Kazem Shirani Faradonbeh

Personalized recommendation based on multi-arm bandit (MAB) algorithms has shown to lead to high utility and efficiency as it can dynamically adapt the recommendation strategy based on feedback. However, unfairness could incur in…

机器学习 · 计算机科学 2020-10-26 Wen Huang , Kevin Labille , Xintao Wu , Dongwon Lee , Neil Heffernan

Understanding which parts of the retrieved context contribute to a large language model's generated answer is essential for building interpretable and trustworthy retrieval-augmented generation. We propose a novel framework that formulates…

人工智能 · 计算机科学 2026-04-23 Deng Pan , Keerthiram Murugesan , Ting Hua , Nuno Moniz , Nitesh Chawla

The last decade has witnessed many successes of deep learning-based models for industry-scale recommender systems. These models are typically trained offline in a batch manner. While being effective in capturing users' past interactions…

The probability that a user will click a search result depends both on its relevance and its position on the results page. The position based model explains this behavior by ascribing to every item an attraction probability, and to every…

机器学习 · 计算机科学 2017-03-21 Sumeet Katariya , Branislav Kveton , Csaba Szepesvári , Claire Vernade , Zheng Wen

Contextual Multi-Armed Bandits is a well-known and accepted online optimization algorithm, that is used in many Web experiences to tailor content or presentation to users' traffic. Much has been published on theoretical guarantees (e.g.…

信息检索 · 计算机科学 2019-07-12 David Abensur , Ivan Balashov , Shaked Bar , Ronny Lempel , Nurit Moscovici , Ilan Orlov , Danny Rosenstein , Ido Tamir

Exposure bias is a well-known issue in recommender systems where items and suppliers are not equally represented in the recommendation results. This bias becomes particularly problematic over time as a few items are repeatedly…

信息检索 · 计算机科学 2024-08-09 Masoud Mansoury , Bamshad Mobasher , Herke van Hoof

Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers' point of view. Content providers, e.g., vloggers and bloggers,…

机器学习 · 计算机科学 2023-11-13 Omer Ben-Porat , Rotem Torkan

Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed…

机器学习 · 统计学 2019-03-20 Tor Lattimore , Branislav Kveton , Shuai Li , Csaba Szepesvari

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually…

信息检索 · 计算机科学 2019-07-04 Yong Liu , Yingtai Xiao , Qiong Wu , Chunyan Miao , Juyong Zhang

Implicit feedback (e.g., clicks, dwell times, etc.) is an abundant source of data in human-interactive systems. While implicit feedback has many advantages (e.g., it is inexpensive to collect, user centric, and timely), its inherent biases…

信息检索 · 计算机科学 2016-08-17 Thorsten Joachims , Adith Swaminathan , Tobias Schnabel

Search engines intentionally influence user behavior by picking and ranking the list of results. Users engage with the highest results both because of their prominent placement and because they are typically the most relevant documents.…

信息检索 · 计算机科学 2022-07-14 Richard Demsyn-Jones

Contextual multi-armed bandits (CMAB) have been widely used for learning to filter and prioritize information according to a user's interest. In this work, we analyze top-K ranking under the CMAB framework where the top-K arms are chosen…

机器学习 · 计算机科学 2022-01-31 Michael Rawson , Jade Freeman

Personalization is important for search engines to improve user experience. Most of the existing work do pure feature engineering and extract a lot of session-style features and then train a ranking model. Here we proposed a novel way to…

信息检索 · 计算机科学 2015-02-05 Li Zhou