Papers for

media streaming service teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Multimodal graph method improves item recommendations efficiently

Multimodal Graph Retrieval-Augmented Sequential Recommendation via Collaborative Filtering Paths

Abstract: Multimodal Large Language Models (MLLMs) have demonstrated strong potential for sequential recommendation through their ability to reason over complex multimodal data. However, existing approaches either rely solely on the target user's own interaction history, neglecting collaborative signals from neighboring users, or incur substantial computational overhead through repeated MLLM inference over long interaction histories. To address these challenges, we propose MGRASRec, a multimodal graph retrieval-augmented framework for sequential recommendation. MGRASRec injects collaborative filtering signals conditioned on the candidate item directly into the MLLM prompt by retrieving structured paths from a user-item interaction graph, extended via multimodal similarity to increase coverage beyond exact co-interaction overlap. This retrieval also surfaces the history items most relevant to the candidate at no additional cost, removing the need for recurrent summarization and keeping inference to a single forward pass per candidate. All components are unified into an augmented prompt for parameter-efficient fine-tuning of an MLLM. Extensive evaluations across three publicly available datasets validate the effectiveness of MGRASRec, achieving the best performance on all metrics with particularly strong gains in ranking quality.

Thu 8 OctMachine Learning
The gist
Making good recommendations often means understanding what a user likes and what similar users enjoy. The paper presents a new way to improve recommendations by combining information about one user with signals from other users nearby in a network, especially when items have images, text, or other data types. Their method finds helpful connections in a user-item network and feeds those to a large language model just once per item, making the process faster and better. Tests show this method predicts what users will like more accurately than past approaches.
Open → 2610.11228v1

Llms improve recommendations by adjusting for misleading history events

When History Misleads: Asymmetric Margin Supervision for Instruction-Guided LLM Generative Recommendation

Abstract: In instruction-guided generative recommendation, LLM-based recommenders need to balance two goals: responding to the user's current request and aligning with the preferences in their interaction history. When the two conflict, history events can override the request. We show that turning the effect of individual history events into supervision faces two obstacles. First, the events that most influence a recommendation are not necessarily the ones that support the target item. Second, removing a misleading event can raise the target's score but a competing item's score even more, so a higher target score alone does not guarantee a better ranking. We propose Asymmetric Intervention-Guided Margin Supervision (AIMS), which converts the effect of removing individual history events into ranking supervision. For training requests already ranked correctly, a frozen reference model identifies request-specific deletions that improve both the target's score and its margin over a competitor near the recommendation cutoff. These margins serve as training targets, while the complete history is retained as input. Training combines cross-entropy with an asymmetric auxiliary loss that penalizes margin shortfalls and routes its gradient only through the competitor score. Inference is unchanged, requiring no history editing or deletion search. Across six LLM backbones on an industrial dataset and two public benchmarks, AIMS improves Recall and NDCG over strong baselines. Ablations support request-specific margins and asymmetric supervision, and the selected deletions preferentially remove constraint-violating history.

Thu 1 OctInformation Retrieval
The gist
When large language models recommend things based on what a user asked and their past preferences, sometimes old history can wrongly overshadow the current request. The authors show that just increasing the recommended item's score isn't enough to improve rankings because competing items might also increase more. They created a new training approach that carefully studies how removing certain past events affects rankings and uses this to teach the model better decisions without changing how it works during recommendations. Their method improves recommendation quality across several models and datasets.
Open → 2610.02600v1