Temporally and Distributionally Robust Optimization for Cold-Start Recommendation
Not on the map. Why?
Abstract (arXiv)
Collaborative Filtering (CF) recommender models highly depend on user-item interactions to learn CF representations, thus falling short of recommending cold-start items. To address this issue, prior studies mainly introduce item features (e.g., thumbnails) for cold-start item recommendation. They learn a feature extractor on warm-start items to align feature representations with interactions, and then leverage the feature extractor to extract the feature representations of cold-start items for interaction prediction. Unfortunately, the features of cold-start items, especially the popular ones, tend to diverge from those of warm-start ones due to temporal feature shifts, preventing the feature extractor from accurately learning feature representations of cold-start items. To alleviate the impact of temporal feature shifts, we consider using Distributionally Robust Optimization (DRO) to enhance the generation ability of the feature extractor. Nonetheless, existing DRO methods face an inconsistency issue: the worse-case warm-start items emphasized during DRO training might not align well with the cold-start item distribution. To capture the temporal feature shifts and combat this inconsistency issue, we propose a novel temporal DRO with new optimization objectives, namely, 1) to integrate a worst-case factor to improve the worst-case performance, and 2) to devise a shifting factor to capture the shifting trend of item features and enhance the optimization of the potentially popular groups in cold-start items. Substantial experiments on three real-world datasets validate the superiority of our temporal DRO in enhancing the generalization ability of cold-start recommender models. The code is available at https://github.com/Linxyhaha/TDRO/.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Dec 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 2.
5 papers.
- 2024Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendationcited by 11
- 2026BalDRO: A Distributionally Robust Optimization based Framework for Large Language Model Unlearningcited by 8
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Modelcited by 7
- 2024Semantic Codebook Learning for Dynamic Recommendation Modelscited by 6
- 2026Revisiting Content-Based Music Recommendation: Efficient Feature Aggregation from Large-Scale Music Modelscited by 0
- 2026Revisiting Content-Based Music Recommendation: Efficient Feature Aggregation from Large-Scale Music Models10 Feb 2026
- 2026BalDRO: A Distributionally Robust Optimization based Framework for Large Language Model Unlearning14 Jan 2026
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model26 Jan 2025
- 2024Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendation1 Aug 2024
- 2024Semantic Codebook Learning for Dynamic Recommendation Models31 Jul 2024