CoSimRec: Measuring Coordinated-Content Penetration in Recommender Feedback Loops

• URL: http://arxiv.org/abs/2607.15114v1
• Date: Thu, 16 Jul 2026 15:24:09 GMT
• Title: CoSimRec: Measuring Coordinated-Content Penetration in Recommender Feedback Loops
• Abstract summary: CoSimRec is an offline agent-based evaluation framework that models coordinated accounts, dynamic ranking, non-bot responses, and ranking interventions.<n>CoSimRec introduces the Algorithmic Penetration Rate metric family to measure target content's share of non-bot exposure and engagement.<n>We evaluate CoSimRec on MIND, MovieLens, and LastFM using random, popularity-based, feedback-sensitive, MF, and BPR-MF recommenders.
• Score: 2.633426951319157
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems increasingly shape which content reaches users, making it important to understand whether coordinated activity is amplified beyond the accounts that initiate it. Existing robustness evaluations largely focus on static target-rank changes and do not capture how coordinated interactions, recommendation, and user response evolve within a feedback loop. To address this gap, we propose CoSimRec, an offline agent-based evaluation framework that models coordinated accounts, dynamic ranking, non-bot responses, and ranking interventions in a shared closed-loop process. CoSimRec introduces the Algorithmic Penetration Rate (APR) metric family to measure target content's share of non-bot exposure and engagement, lift against matched no-attack baselines, and exposure gained per coordinated interaction. We evaluate CoSimRec on MIND, MovieLens, and LastFM using random, popularity-based, feedback-sensitive, MF, and BPR-MF recommenders, with ten-seed inference for the primary APR analysis and population-scale experiments of up to 1000 users. Random controls show no statistically supported positive penetration, whereas popularity-based and feedback-sensitive ranking produce significant positive APR-Lift in all six master-worker dataset--recommender settings, reaching 0.4505 on LastFM; synchronization-aware ranking reduces APR in every corresponding defense setting.

Related papers

• SWIM: Step-Wise Integrated Measure for Session-supervised List Evaluation in Generative Re-ranking [50.941707269747866]
  We propose SWIM, a list-level evaluator that models user behaviors as a finite-horizon prefix session-level survival process.<n>We show that SWIM significantly outperforms baselines in listwise reranking tasks, yielding substantial improvements in overall recommendation engagement.
  arXiv  Detail & Related papers  (2026-08-25T19:57:48Z)
• Are We Really Making Progress in Group Recommendation? Unmasking the Tie-Breaking Illusion [4.153834414190214]
  Group recommendation methods have reported strong improvements on standard benchmarks.<n>But it remains unclear whether these gains always reflect genuine advances in modeling group preferences.<n>We show that several recent methods are affected by a systematic evaluation bias caused by the interaction between training-time score compression and evaluation-time deterministic tie-breaking.
  arXiv  Detail & Related papers  (2026-08-11T17:50:08Z)
• Co-Evolving LLM Evaluators and Policies via DynamicRubric [67.2962847914162]
  Post-training with evaluator feedback on policy-induced samples serves as a major mechanism for improving large language models.<n>We propose DynamicRubric, a response-set-conditioned evaluator--policy co-evolution framework.<n>In experiments with 8B backbones, DynamicRubric improves evaluator performance and provides stronger policy supervision than baselines.
  arXiv  Detail & Related papers  (2026-07-22T12:35:40Z)
• Boosting Self-Consistency with Ranking [56.38798757709555]
  Self-consistency improves large language models by sampling multiple reasoning paths and selecting the most frequent answer.<n>We address this limitation with Ranking-Improved Self-Consistency (RISC), which reformulates answer selection in self-consistency as a ranking problem.
  arXiv  Detail & Related papers  (2026-06-03T16:12:30Z)
• Don't Let Bandit Feedback Pull Continual LLM-Recommender Updates Off Target [42.681980014826536]
  Generative recommenders (LLM-Rec) require continual post-deployment updates.<n> deployment logs provide only policy-shaped contextual bandit feedback.<n>We propose an Anchored Bandit Policy Optimization framework for continual LLM-Rec updates.
  arXiv  Detail & Related papers  (2026-05-17T11:10:44Z)
• Revisiting Reinforcement Learning with Verifiable Rewards from a Contrastive Perspective [10.958642517467721]
  We present a framework for Contrastive Sequence-level Policy Optimization in RLVR.<n>ConSPO replaces GRPO's clipped ratio-based scores with length-normalized sequence log-probabilities.<n>ConSPO consistently outperforms several strong RLVR baselines on challenging mathematical reasoning benchmarks.
  arXiv  Detail & Related papers  (2026-05-13T04:02:36Z)
• The Reciprocity Gradient [52.35929743862925]
  Communication is fundamental to sustaining reciprocity and cooperation in strategic interactions.<n>We identify and formulate the influence attribution problem as the central optimization difficulty inherent in such dynamics for a learning agent.<n>To address this, we introduce the reciprocity gradient, which explicitly backpropagates reward gradients through private estimators of opponents' policies trained from public observations.
  arXiv  Detail & Related papers  (2026-05-08T16:29:52Z)
• Consensus-Driven Group Recommendation on Sparse Explicit Feedback: A Collaborative Filtering and Choquet-Borda Aggregation Framework [0.0]
  This paper proposes a consensus-driven hybrid group recommendation framework.<n>It integrates neighborhood-based collaborative filtering with fuzzy aggregation to support agreement, fairness, and under sparsity.<n> Experimental results on real-world datasets show that the proposed method improves group-level consensus, satisfaction, and fairness, while maintaining a balanced level of novelty.
  arXiv  Detail & Related papers  (2026-01-14T03:49:35Z)
• Reference-Free Rating of LLM Responses via Latent Information [53.463883683503106]
  We study the common practice of asking a judge model to assign Likert-scale scores to free-text responses.<n>We then propose and evaluate Latent Judges, which derive scalar ratings from internal model signals.<n>Across a broad suite of pairwise and single-rating benchmarks, latent methods match or surpass standard prompting.
  arXiv  Detail & Related papers  (2025-09-29T12:15:52Z)
• RAG-Zeval: Towards Robust and Interpretable Evaluation on RAG Responses through End-to-End Rule-Guided Reasoning [64.46921169261852]
  RAG-Zeval is a novel end-to-end framework that formulates faithfulness and correctness evaluation as a rule-guided reasoning task.<n>Our approach trains evaluators with reinforcement learning, facilitating compact models to generate comprehensive and sound assessments.<n>Experiments demonstrate RAG-Zeval's superior performance, achieving the strongest correlation with human judgments.
  arXiv  Detail & Related papers  (2025-05-28T14:55:33Z)
• Enhancing Federated Survival Analysis through Peer-Driven Client Reputation in Healthcare [1.2289361708127877]
  Federated Learning holds great promise for digital health by enabling collaborative model training without compromising patient data privacy.<n>We propose a peer-driven reputation mechanism for federated healthcare that integrates decentralized peer feedback with clustering-based noise handling.<n>Applying differential privacy to client-side model updates ensures sensitive information remains protected during reputation computation.
  arXiv  Detail & Related papers  (2025-05-22T03:49:51Z)
• Search-Based Interaction For Conversation Recommendation via Generative Reward Model Based Simulated User [117.82681846559909]
  Conversational recommendation systems (CRSs) use multi-turn interaction to capture user preferences and provide personalized recommendations.<n>We propose a generative reward model based simulated user, named GRSU, for automatic interaction with CRSs.
  arXiv  Detail & Related papers  (2025-04-29T06:37:30Z)
• Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions [18.90946044396516]
  Music streaming, video streaming, news recommendation, and e-commerce services often engage with content in a sequential manner. Providing and evaluating good sequences of recommendations is therefore a central problem for these services. We propose a new counterfactual estimator that allows for sequential interactions in the rewards with lower variance in anally unbiased manner.
  arXiv  Detail & Related papers  (2020-07-25T17:58:01Z)
• SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback [50.13745601531148]
  We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons. We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
  arXiv  Detail & Related papers  (2020-02-23T06:40:48Z)

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.