arXiv Statistics ML
Causal Representation Learning for Generalisable Recommendation
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Aug 28
Incremental Recommendation via Causal Models
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.
Hugging Face Trending Papers
Aug 27
Incremental Recommendation via Causal Models
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.
arXiv AI
Jul 2
CausalMix: Data Mixture as Causal Inference for Language Model Training
arXiv:2607. 01104v1 Announce Type: cross Abstract: In Large Language Model (LLM) training, data mixing plays a pivotal role in determining model performance.
arXiv AI
Aug 12
From Prediction to Incrementality: Causal Optimization for Large-Scale Targeting and Recommendation
arXiv:2608. 10182v1 Announce Type: cross Abstract: Large-scale targeting and recommendation systems are typically built around predictive scores fed into heuristic or local allocation.
arXiv Machine Learning
Sep 10
PUID: A Personalized Deconfounding Framework for Recommender Systems under Hidden Confounding
The paper introduces PUID, a Personalized Unobserved-Confounding-aware Interaction Deconfounder, designed to mitigate hidden confounding in recommender systems without relying on costly randomized controlled trials. PUID estimates user-item level sensitivity bounds using an entropy-based method that gauges the strength of hidden confounding from the mutual information between observed features and exposure status. An adversarial optimization strategy and a benchmark-guided variant (BPUID) further enhance robustness and predictive accuracy, and experiments on three real-world datasets show consistent outperformance over state-of-the-art baselines.
arXiv AI
Jun 17
FoundCause: Causal Discovery with Latent Confounders from Observational Data
arXiv:2606. 17516v1 Announce Type: cross Abstract: Causal discovery from observational data remains challenging due to the need to recover directed structure and latent confounding without interventions.