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