Skip to content
Open access

Multimodal Interest-Shifting Sequence Recommendation with Offline Policy Optimization and Drift-Aware Representation Learning

Aug 2026 · Applied Sciences · 0 citations · 32 references

TL;DR

The reported results indicate competitive public-data sequential ranking under the stated protocol, together with a reproducible and inference-safe evaluation design, and the practical value of the method lies in reaching, and in several comparisons, significantly exceeding, the accuracy of heavyweight multimodal-LLM-style approaches with a lightweight architecture whose inference overhead is only about 20% above IDURL.

Abstract

Interest changes complicate sequential recommendation when interaction histories are combined with item content. We evaluate MM-DRLSR on four public Amazon and Yelp benchmarks. The model integrates category-overlap drift supervision, history-derived drift representations, lightweight identifier–image–text fusion, candidate-conditioned scoring, and an offline actor–critic surrogate objective trained by logged-context replay. The observed next item is used only to construct training labels and rewards; inference ranks candidates from the observed history and candidate content. In the reported five-run summaries under a common leave-one-out protocol, MM-DRLSR attains the highest mean Recall and NDCG among the evaluated methods, with consistent advantages of 0.12–0.22 percentage points over the strongest contemporary multimodal baselines (relative gains of about 1.1–3.6%) that reach Holm-adjusted significance on three of four metrics against Harnessing MLLMs and on Recall@20 against DMESR. The practical value of the method lies in reaching, and in several comparisons, significantly exceeding, the accuracy of heavyweight multimodal-LLM-style approaches with a lightweight architecture whose inference overhead is only about 20% above IDURL. Ablation, sensitivity, and observed interest-shift summaries further describe the contributions of multimodal fusion and offline policy adaptation. The reported results indicate competitive public-data sequential ranking under the stated protocol, together with a reproducible and inference-safe evaluation design.

Read PDF

Similar papers

Open access Sep 2026

Dual stream adaptive sequential recommendation

The results show that DSASR consistently outperforms existing methods, making the recommendations more personalized than existing systems, due to the Consistency Gate computing a personalized blend weight for each user, which takes user demographic attributes as well as preference drift into account.

Swastika Ghosh, Sourav Mandal, Rohini Basak et al. · 0 citations
#large language models Review Open access Sep 2026

PALRec: Large Language Model-Based Sequential Recommendation with Parameter-Preserving Augmentation

PALRec is proposed, a parameter-preserving augmentation framework that equips an LLM with recommendation capabilities while keeping its original parameters fixed and consistently outperforms fully fine-tuned counterparts in recommendation accuracy while preserving the LLM’s pre-trained knowledge.

Hyunsoo Na, Minseok Gang, Sang-goo Lee et al. · 0 citations
Preprint Sep 2026

GRP v0.1 Technical Report

Industrial recommendation systems rely on multi-stage cascades whose retrieval, ranking, and serving components are difficult to replace jointly. We present GRP, a generative recommendation framework that combines retrieval, ranking, and reward modeling in a single encoder-decoder model, and evaluate a progressive path...

Wen-Feng Zhuo, Vincent Xue, Charles Wei et al. · 0 citations
Preprint Sep 2026

Recommendation World Models for Future-State Control

UA-TWM is introduced, a utility-anchored world-model interface that constructs nearby slate actions, estimates their target-relevant consequences, and selects an alternative subject to utility constraints, and enables target-aware selection around a trained sequential ranker.

Jin-Feng Xu, Zhe-Yu Chen, Zi-Yue Peng et al. · 0 citations
Sep 2026

Instruction-Tuned LLMs via Bayesian Mixture Model Preference Priors

Large language models (LLMs) deployed as interactive recommendation agents must adapt to user preferences across dialogue rounds without access to ground-truth reward functions. Existing Bayesian-prompting approaches assume a uniform prior over user types, discarding population structure and weakening cold-start perfor...

Ornela Bregu, Nizar Bouguila · 0 citations
Preprint Aug 2026

Difficulty-Aware Semantic-ID Optimization for Generative Recommendation

Difficulty-Aware Semantic-ID Optimization (DASO), a tree-aware post-training method that addresses failure mode as an online rollout-allocation problem and improves over MiniOneRec-style GRPO on 11 of 12 metrics and achieves the best result on 9 of 12 metrics.

Xin Yu, Stephen Li, S. Aghaei et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.