Is Personalized Modality Weighting Actually Personalized? A Controlled Audit of Per-User Weighting Claims in Multimodal Recommenders

• URL: http://arxiv.org/abs/2608.05655v1
• Date: Thu, 06 Aug 2026 06:52:38 GMT
• Title: Is Personalized Modality Weighting Actually Personalized? A Controlled Audit of Per-User Weighting Claims in Multimodal Recommenders
• Abstract summary: We show that a single global weight delivers nearly all of the content gain across three independent short-video corpora.<n>We propose reporting real-GM alongside real-shuf as a minimum evidentiary standard for personalization claims.
• Score: 29.643383372337308
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Per-user modality weighting is deployed at billion-user scale in multimodal recommenders, through user modality-strength vectors, attention gates, meta-weight hypernetworks, and low-rank guided weights, each claiming a ranking gain from user-specific modality preference. Yet, to our knowledge, prior evaluations do not isolate a genuinely user-specific signal from a global modality weight plus model capacity. We audit this family with a two-contrast audit principle, reducing six implementations onto one shared collaborative backbone and measuring a utility gap (real-GM) against a single global modality weight and an identifiability gap (real-shuf) against an eval-time permutation of the user-weight binding. Across three independent short-video corpora, a single global weight already delivers nearly all of the content gain (+1.9/+3.6/+3.5pp over a no-modality baseline, p < .001). Making the weight per-user adds no consistent utility: no implementation wins on all corpora and metrics, and the few positive gaps are small (<=0.9pp) and flip. The shuffle control is necessary but not sufficient, since real-shuf reaches +128% of the content gain for heads that simultaneously lose to the global weight. We trace this dissociation to gates reading the shared collaborative embedding: decoupling the gate input collapses the inflated real-shuf to near zero while the utility conclusion stands. A monotone signal-implant dose-response (capture AUROC rising from 0.57 to 0.89 and from 0.64 to 1.00) verifies the harness would detect user-specific structure if present, and every finding replicates on a fourth, cross-domain e-commerce corpus. We propose reporting real-GM alongside real-shuf as a minimum evidentiary standard for personalization claims.

Related papers

• From Production Traffic to Post-Training: Building a Self-Hosted LLM That Covers the Corporate Request Mix [55.08143827481755]
  We consolidate traffic from over 200 internal applications onto a single model.<n>We train a separate GRPO expert per axis and merge them via two-stage SLERP.<n>The model absorbs 50% of platform traffic, 116M requests per month, at a fraction of the serving cost.
  arXiv  Detail & Related papers  (2026-09-01T17:39:26Z)
• BLOOM-WILT: Logit Tilting for Behaviour Elicitation in Automated LLM Auditing [0.898478290216692]
  BLOOM-WILT elicits natural multi-turn instances of rare behaviours without training cost or access beyond the target's next-token distribution.<n>We evaluate WILT across 4 target models and 8 behaviours, where it beats the baseline auditor in 30 of the 32 settings.
  arXiv  Detail & Related papers  (2026-08-31T17:10:59Z)
• SlimPer: Make Personalization Model Slim and Smart [20.68857468213109]
  We propose SlimPer to reformulate personalized ranking as iterative refinement of a compact, unified user, item> knowledge base.<n>SlimPer unifies sparse, dense, and sequence features within a single backbone and provides inherent interpretability through its attention mechanism.
  arXiv  Detail & Related papers  (2026-07-14T02:31:32Z)
• Strength-Parity Ensembling with Parameter-Isolated Experts for Multi-Task Affect Recognition [4.4644619064521995]
  We build on a shared affect-latent that marginalizes the missing labels across two affect-supervised backbones.<n>An added member lowers the ensemble error only when it is both decorrelated from the current members and a near-peer of them in individual accuracy.<n>The resulting system raises the overall validation score to 1.6949, against the organizersNeXt-with-Mixment baseline of 0.45.
  arXiv  Detail & Related papers  (2026-07-12T17:12:15Z)
• Modeling Normal Is All You Need: Joint Latent Clustering for Anomaly Detection in Multimodal Cyber-Physical Systems [47.027290803102666]
  Normal behaviour is the union of many imbalanced, curved, thin-fringed operating regimes.<n>We model the normal law with a jointly learned latent representation plus explicit Gaussian-mixture mode clustering.<n>We evaluate under a deliberately fair protocol: raw point-wise metrics with no point adjustment, a trivial-detector difficulty split, prevalence-matched F1, and train-normal-only calibration.
  arXiv  Detail & Related papers  (2026-07-07T10:10:00Z)
• SP-CACW: Convergence-Aware Client Weighting for Selfish Personalized Learning [8.941998221680409]
  We study how a designated target client can use peer gradients to minimize its own risk while avoiding negative transfer.<n>We propose SP-CACW, a convergence-aware client-weighting framework that selects aggregation weights by minimizing an upper bound on the target client's convergence error.
  arXiv  Detail & Related papers  (2026-06-28T10:28:04Z)
• Putting HUMANS first: Efficient LAM Evaluation with Human Preference Alignment [53.72927532626824]
  We show that subsets of just 50 examples (0.3% of data) can achieve over 0.93 Pearson correlation with full benchmark scores.<n>To better predict preferences, we trained regression models on these selected subsets, achieving 0.98 correlation.<n>This demonstrates that in regression modeling, well-curated subsets outpredict the full benchmark, showing quality over quantity.
  arXiv  Detail & Related papers  (2026-04-20T00:57:31Z)
• P-GenRM: Personalized Generative Reward Model with Test-time User-based Scaling [66.55381105691818]
  We propose P-GenRM, the first Personalized Generative Reward Model with test-time user-based scaling.<n>P-GenRM transforms preference signals into structured evaluation chains that derive adaptive personas and scoring rubrics.<n>It further clusters users into User Prototypes and introduces a dual-granularity scaling mechanism.
  arXiv  Detail & Related papers  (2026-02-12T16:07:22Z)
• Personalized Denoising Implicit Feedback for Robust Recommender System [60.719158008403376]
  We show that for a given user, there is a clear distinction between normal and noisy interactions in the user's personal loss distribution.<n>We propose a resampling strategy to Denoise using the user's Personal Loss distribution, named PLD, which reduces the probability of noisy interactions being optimized.
  arXiv  Detail & Related papers  (2025-02-01T07:13:06Z)
• Choosing the Right Weights: Balancing Value, Strategy, and Noise in Recommender Systems [3.2855008639856575]
  Many recommender systems optimize a linear weighting of different user behaviors, such as clicks, likes, and shares.<n>We consider three aspects of each potential behavior: value-faithfulness, strategy-robustness, and noisiness.<n>We apply our framework to design weights on Facebook, using a large-scale dataset of approximately 70 million URLs.
  arXiv  Detail & Related papers  (2023-05-27T09:37:58Z)
• Beyond ADMM: A Unified Client-variance-reduced Adaptive Federated Learning Framework [82.36466358313025]
  We propose a primal-dual FL algorithm, termed FedVRA, that allows one to adaptively control the variance-reduction level and biasness of the global model. Experiments based on (semi-supervised) image classification tasks demonstrate superiority of FedVRA over the existing schemes.
  arXiv  Detail & Related papers  (2022-12-03T03:27:51Z)
• Partial Bandit and Semi-Bandit: Making the Most Out of Scarce Users' Feedback [62.997667081978825]
  We present a novel approach for considering user feedback and evaluate it using three distinct strategies. Despite a limited number of feedbacks returned by users (as low as 20% of the total), our approach obtains similar results to those of state of the art approaches.
  arXiv  Detail & Related papers  (2020-09-16T07:32:51Z)

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.