CPGRec+: A Balance-oriented Framework for Personalized Video Game Recommendations

• URL: http://arxiv.org/abs/2604.14586v1
• Date: Thu, 16 Apr 2026 03:25:18 GMT
• Title: CPGRec+: A Balance-oriented Framework for Personalized Video Game Recommendations
• Abstract summary: We propose Preference-informed Edge Reweighting (PER) module and Preference-informed Representation Generation (PRG) module.<n>PER module assigns signed edge weights to qualitatively distinguish significant player interests and disinterests while then quantitatively measuring preference strength to mitigate over-smoothing in graph convolutions.<n>PRG module leverages LLMs to generate contextualized descriptions of games and players by reasoning personal preferences from comparing global and personal interests.
• Score: 26.80916834756631
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapid expansion of gaming industry requires advanced recommender systems tailored to its dynamic landscape. Existing Graph Neural Network (GNN)-based methods primarily prioritize accuracy over diversity, overlooking their inherent trade-off. To address this, we previously proposed CPGRec, a balance-oriented gaming recommender system. However, CPGRec fails to account for critical disparities in player-game interactions, which carry varying significance in reflecting players' personal preferences and may exacerbate over-smoothness issues inherent in GNN-based models. Moreover, existing approaches underutilize the reasoning capabilities and extensive knowledge of large language models (LLMs) in addressing these limitations. To bridge this gap, we propose two new modules. First, Preference-informed Edge Reweighting (PER) module assigns signed edge weights to qualitatively distinguish significant player interests and disinterests while then quantitatively measuring preference strength to mitigate over-smoothing in graph convolutions. Second, Preference-informed Representation Generation (PRG) module leverages LLMs to generate contextualized descriptions of games and players by reasoning personal preferences from comparing global and personal interests, thereby refining representations of players and games. Experiments on \textcolor{black}{two Steam datasets} demonstrate CPGRec+'s superior accuracy and diversity over state-of-the-art models. The code is accessible at https://github.com/HsipingLi/CPGRec-Plus.

Related papers

• Think, then Score: Decoupled Reasoning and Scoring for Video Reward Modeling [32.50799160769865]
  Video reward models should predict accurate rewards that align with human preferences across diverse scenarios.<n>Existing paradigms face a fundamental dilemma: textitDiscriminative RMs regress rewards directly on features extracted by multimodal large language models without explicit reasoning.<n>We introduce DeScore, a training-efficient and generalizable video reward model.
  arXiv  Detail & Related papers  (2026-05-07T09:30:58Z)
• Category-based and Popularity-guided Video Game Recommendation: A Balance-oriented Framework [29.0540988283535]
  Current video game recommendation approaches tend to prioritize accuracy over diversity, potentially leading to unvaried game suggestions.<n>We introduce a novel framework, called CPGRec, comprising three modules, namely accuracy-driven, diversity-driven, and comprehensive.<n>The first module extends the state-of-the-art accuracy-focused game recommendation method by connecting games in a more stringent manner to enhance recommendation accuracy.<n>The second module connects neighbors with diverse categories within the proposed game graph and harnesses the advantages of popular game nodes to amplify the influence of long-tail games within the player-game bipartite graph.
  arXiv  Detail & Related papers  (2026-04-16T04:03:45Z)
• ICG: Improving Cover Image Generation via MLLM-based Prompting and Personalized Preference Alignment [70.19758313256503]
  We propose ICG, a framework that integrates MLLM-based prompting with personalized preference alignment to generate contextually relevant covers.<n>ICG extracts semantic features from item titles and reference images via meta tokens, refines them with user embeddings, and injects the resulting personalized context into the diffusion model.<n>Experiments demonstrate that ICG significantly improves image quality, semantic fidelity, and personalization, leading to stronger user appeal and offline recommendation accuracy.
  arXiv  Detail & Related papers  (2026-04-08T06:36:54Z)
• Bringing Reasoning to Generative Recommendation Through the Lens of Cascaded Ranking [107.09842504618369]
  Generative Recommendation (GR) has become a promising end-to-end approach with high FLOPS utilization for resource-efficient recommendation.<n>We show that current GR models suffer from a critical textbfbias amplification issue, where token-level bias escalates as token generation progresses.<n>To combat the bias amplification issue, it is crucial for GR to 1) incorporate more heterogeneous information, and 2) allocate greater computational resources at each token generation step.
  arXiv  Detail & Related papers  (2026-02-03T16:10:54Z)
• End-to-End Personalization: Unifying Recommender Systems with Large Language Models [0.0]
  We propose a novel hybrid recommendation framework that combines Graph Attention Networks (GATs) with Large Language Models (LLMs)<n>LLMs are first used to enrich user and item representations by generating semantically meaningful profiles based on metadata such as titles, genres, and overviews.<n>We evaluate our model on benchmark datasets, including MovieLens 100k and 1M, where it consistently outperforms strong baselines.
  arXiv  Detail & Related papers  (2025-08-02T22:46:50Z)
• Reinforcing Video Reasoning with Focused Thinking [65.85683941058916]
  We propose TW-GRPO, a novel framework that enhances visual reasoning with focused thinking and dense reward granularity.<n>Specifically, we employ a token weighting mechanism that prioritizes tokens with high informational density.<n>We also reformulate RL training by shifting from single-choice to multi-choice QA tasks.
  arXiv  Detail & Related papers  (2025-05-30T15:42:19Z)
• MM-RLHF: The Next Step Forward in Multimodal LLM Alignment [59.536850459059856]
  We introduce MM-RLHF, a dataset containing $mathbf120k$ fine-grained, human-annotated preference comparison pairs.<n>We propose several key innovations to improve the quality of reward models and the efficiency of alignment algorithms.<n>Our approach is rigorously evaluated across $mathbf10$ distinct dimensions and $mathbf27$ benchmarks.
  arXiv  Detail & Related papers  (2025-02-14T18:59:51Z)
• Prediction of Football Player Value using Bayesian Ensemble Approach [13.163358022899335]
  We present a case study on the key factors affecting the world's top soccer players' transfer fees based on the FIFA data analysis. To predict each player's market value, we propose an improved LightGBM model using a Tree-structured Parzen Estimator (TPE) algorithm.
  arXiv  Detail & Related papers  (2022-06-24T07:13:53Z)
• Deep Policy Networks for NPC Behaviors that Adapt to Changing Design Parameters in Roguelike Games [137.86426963572214]
  Turn-based strategy games like Roguelikes, for example, present unique challenges to Deep Reinforcement Learning (DRL) We propose two network architectures to better handle complex categorical state spaces and to mitigate the need for retraining forced by design decisions.
  arXiv  Detail & Related papers  (2020-12-07T08:47:25Z)
• Interpretable Learning-to-Rank with Generalized Additive Models [78.42800966500374]
  Interpretability of learning-to-rank models is a crucial yet relatively under-examined research area. Recent progress on interpretable ranking models largely focuses on generating post-hoc explanations for existing black-box ranking models. We lay the groundwork for intrinsically interpretable learning-to-rank by introducing generalized additive models (GAMs) into ranking tasks.
  arXiv  Detail & Related papers  (2020-05-06T01:51:30Z)

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.