Preference-based learning for news headline recommendation
- URL: http://arxiv.org/abs/2506.06334v1
- Date: Sat, 31 May 2025 12:57:56 GMT
- Title: Preference-based learning for news headline recommendation
- Abstract summary: This study explores strategies for optimizing news headline recommendations through preference-based learning.<n>Using real-world data of user interactions with French-language online news posts, we learn a headline recommender agent under a contextual bandit setting.
- Score: 46.32599797180165
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This study explores strategies for optimizing news headline recommendations through preference-based learning. Using real-world data of user interactions with French-language online news posts, we learn a headline recommender agent under a contextual bandit setting. This allows us to explore the impact of translation on engagement predictions, as well as the benefits of different interactive strategies on user engagement during data collection. Our results show that explicit exploration may not be required in the presence of noisy contexts, opening the door to simpler but efficient strategies in practice.
Related papers
- When and How to Ask: Dynamic Preference Elicitation Strategies for Conversational Recommendation [14.76143686519353]
We conduct a systematic investigation of preference elicitation strategies from a stage-aware perspective.<n>We introduce InPE, a dataset enriched with fine-grained annotations for elicitation necessity and strategy selection.<n>Extensive offline evaluation on our dataset indicates that context-aware preference elicitation strategies are beneficial for conversational recommendation.
arXiv Detail & Related papers (2026-07-07T19:54:00Z) - Interactive Visualization Recommendation with Hier-SUCB [52.11209329270573]
We propose an interactive personalized visualization recommendation (PVisRec) system that learns on user feedback from previous interactions.<n>For more interactive and accurate recommendations, we propose Hier-SUCB, a contextual semi-bandit in the PVisRec setting.
arXiv Detail & Related papers (2025-02-05T17:14:45Z) - Con-ReCall: Detecting Pre-training Data in LLMs via Contrastive Decoding [118.75567341513897]
Existing methods typically analyze target text in isolation or solely with non-member contexts.<n>We propose Con-ReCall, a novel approach that leverages the asymmetric distributional shifts induced by member and non-member contexts.
arXiv Detail & Related papers (2024-09-05T09:10:38Z) - Reformulating Sequential Recommendation: Learning Dynamic User Interest with Content-enriched Language Modeling [18.297332953450514]
We propose LANCER, which leverages the semantic understanding capabilities of pre-trained language models to generate personalized recommendations.
Our approach bridges the gap between language models and recommender systems, resulting in more human-like recommendations.
arXiv Detail & Related papers (2023-09-19T08:54:47Z) - Investigating Reinforcement Learning for Communication Strategies in a
Task-Initiative Setting [8.680676599607123]
We analyze the trade-offs between initial presentation and subsequent followup as a function of user clarification strategy.
We find surprising advantages to coherence-based representations of dialogue strategy, which bring minimal data requirements, explainable choices, and strong audit capabilities.
arXiv Detail & Related papers (2023-08-03T00:10:23Z) - Two-Stage Neural Contextual Bandits for Personalised News Recommendation [50.3750507789989]
Existing personalised news recommendation methods focus on exploiting user interests and ignores exploration in recommendation.
We build on contextual bandits recommendation strategies which naturally address the exploitation-exploration trade-off.
We use deep learning representations for users and news, and generalise the neural upper confidence bound (UCB) policies to generalised additive UCB and bilinear UCB.
arXiv Detail & Related papers (2022-06-26T12:07:56Z) - Onception: Active Learning with Expert Advice for Real World Machine
Translation [0.0]
Most active learning approaches for Machine Translation assume the existence of a pool of sentences in a source language, and rely on human annotators to provide translations or post-edits.
In this paper, we assume a real world human-in-the-loop scenario in which: (i) the source sentences may not be readily available, but instead arrive in a stream; (ii) the automatic translations receive feedback in the form of a rating, instead of a correct/edited translation, since the human-in-the-loop might be a user looking for a translation, but not be able to provide one
arXiv Detail & Related papers (2022-03-09T03:32:42Z) - Aspect-driven User Preference and News Representation Learning for News
Recommendation [9.187076140490902]
News recommender systems usually learn topic-level representations of users and news for recommendation.
We propose a novel Aspect-driven News Recommender System (ANRS) built on aspect-level user preference and news representation learning.
arXiv Detail & Related papers (2021-10-12T07:38:54Z) - Reward Constrained Interactive Recommendation with Natural Language
Feedback [158.8095688415973]
We propose a novel constraint-augmented reinforcement learning (RL) framework to efficiently incorporate user preferences over time.
Specifically, we leverage a discriminator to detect recommendations violating user historical preference.
Our proposed framework is general and is further extended to the task of constrained text generation.
arXiv Detail & Related papers (2020-05-04T16:23:34Z) - Dynamic Data Selection and Weighting for Iterative Back-Translation [116.14378571769045]
We propose a curriculum learning strategy for iterative back-translation models.
We evaluate our models on domain adaptation, low-resource, and high-resource MT settings.
Experimental results demonstrate that our methods achieve improvements of up to 1.8 BLEU points over competitive baselines.
arXiv Detail & Related papers (2020-04-07T19:49:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.