arXiv:2605.27043v2 Announce Type: replace
Abstract: Predictive models trained on observational data often fail to generalise when deployed, especially when the training data is a product of the syste...
By Yorgos Felekis, Michael O'Riordan, Oriol Corcoll, Ciar\'an M. Gilligan-Lee
The paper introduces a method for learning risk scores that remain reliable even when historical data contain unobserved confounders. By treating propensity weights as uncertain and applying sensitivity analysis with Wasserstein distributionally robust optimization, the authors formulate a robust learning problem solvable via an exponential cone program. Experiments on semi‑synthetic UCI data show the approach improves calibration by up to 29.2% over traditional benchmarks and 11.1% over the state of the art, without harming other performance metrics.
By Ryan Edmonds, Yingxiao Ye, Sina Aghaei, Andr\'es G\'omez, \c{C}a\u{g}{\i}l Ko\c{c}yi\u{g}it, Phebe Vayanos
Uplift modeling, crucial for estimating individual treatment effects (ITE), faces dual challenges: flexibly leveraging inter-group similarity to enhance discriminative power and debiasing under unobserved confounding scenarios. In this paper, we propose the Cross-Head Attention Uplift Network (CHAUN) and Robust Adversarial Inverse Propensity Score (RA-IPS) method to address these limitations.
arXiv:2606. 27114v1 Announce Type: new Abstract: Uplift modeling, crucial for estimating individual treatment effects (ITE), faces dual challenges: flexibly leveraging inter-group similarity to enhance discriminative power and debiasing under unobserved confounding scenarios.
By Haoran Zhang, Chuanpu Li, Yuxin Fu, Bin Tong, Guan Wang, Bo Zheng, Feng Zhou
The paper introduces Neighborhood-Aware Unlearning (NAU) for generative recommendation systems that use semantic identifiers (SIDs). It addresses the problem that standard unlearning can unintentionally alter predictions for items neighboring the forgotten interactions due to shared SID tokens. NAU augments interaction-level unlearning with explicit control over probability mass in these neighborhoods, restoring utility for spam-induced exposures and recovering neighborhood performance without affecting overall test set metrics.
By Pierre Lubitzsch, Yubao Tang, Maarten de Rijke, Sebastian Schelter
arXiv:2607. 03425v1 Announce Type: new Abstract: Algorithmic recourse addresses the challenge of providing tailored recommendations to users affected by unfavorable machine learning decisions, in potentially high-stakes scenarios.
By Denise Tampieri, Giovanni De Toni, Paolo Giudici
The paper introduces Adaptive Doubly Robust (ADR), an off‑policy evaluation method for ranking policies that blends adaptive importance weighting with reward regression to reduce variance. ADR is unbiased when the true user behavior model is known and, under a sufficient condition, achieves lower variance than the prior Adaptive Inverse Propensity Scoring (AIPS) approach. Experiments on synthetic data show that ADR consistently improves mean squared error over AIPS and other ranking OPE estimators across various data sizes and ranking lengths.
By Kosuke Iguchi, Ren Kishimoto
This reproducibility study confirms that incorporating generated natural‑language user profiles into recommender systems enhances transparency and allows users to directly intervene by correcting preferences or addressing cold‑start issues. The authors replicated the original findings and extended the evaluation with context ablation, multi‑seed stability tests, and mechanistic interpretability analysis using nnsight. Their results show that while perturbing profiles shifts predicted ratings uniformly across genres, the overall rankings remain unchanged, attributing this to the rating‑regression objective rather than the profile interface.
By Noah Mami\'e, Laurin van den Bergh
arXiv:2608. 12389v1 Announce Type: new Abstract: Cross-domain zero- or few-shot personalization aims to generate user-preferred responses in unseen conversational domains from only a handful of target-domain interactions.
By Xuefei Wang, Jun Han, Zixuan Wang, Qingkai Zeng, Xiao Wang, Ruijie Wang, Jianxin Li
The paper proposes an incremental recommendation system that uses causal modeling to avoid delivering redundant recommendations. By leveraging existing holdback data and a dual‑threshold targeting policy, the authors reduce recommendation impressions by 7% without harming overall content consumption. Joint training with holdback data also improves the calibration of the treated model, suggesting better generalisable representations than purely observational models.
By Athanasios Vlontzos, David Gustafsson, Michael O'Riordan, Ciar\'an M. Gilligan-Lee
The paper proposes an incremental recommendation approach that uses a causal model built from existing holdback data to avoid delivering redundant recommendations. By applying a dual‑threshold targeting policy, the system only recommends content when the likelihood of a treated stream is high and the likelihood of an organic stream is low, thereby reducing recommendation impressions by 7% without hurting overall consumption. Joint training with holdback data also improves the calibration of the treated head, suggesting that causal models capture more generalisable representations than purely observational models.
FAIDER is a fairness-aware decoding method for large language model recommenders that selects complete item candidates instead of manipulating token-level logits, thereby reducing semantic disparity across protected attribute groups. It uses conformal-inspired calibration to set a cross-group disparity threshold and applies either hard filtering or a soft penalty during online decoding, with dual-inspired feedback to target a specific violation rate. The approach offers a theoretical guarantee that the empirical violation rate of the soft decoder exceeds its target by at most $O(1/T)$ and demonstrates improved semantic fairness and ranking quality over prompt-repair baselines in experiments.
By Ziwei Wu, Jingrui He