Can Recommender Systems Teach Themselves? A Recursive Self-Improving Framework with Fidelity Control
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913104032432128 |
|---|---|
| author | Zhang, Luankang Wang, Hao Liu, Zhongzhou Yin, Mingjia Huang, Yonghao Li, Jiaqi Guo, Wei Liu, Yong Guo, Huifeng Lian, Defu Chen, Enhong |
| author_facet | Zhang, Luankang Wang, Hao Liu, Zhongzhou Yin, Mingjia Huang, Yonghao Li, Jiaqi Guo, Wei Liu, Yong Guo, Huifeng Lian, Defu Chen, Enhong |
| contents | The scarcity of high-quality training data presents a fundamental bottleneck to scaling machine learning models. This challenge is particularly acute in recommendation systems, where extreme sparsity in user interactions leads to rugged optimization landscapes and poor generalization. We propose the Recursive Self-Improving Recommendation (RSIR) framework, a paradigm in which a model bootstraps its own performance without reliance on external data or teacher models. RSIR operates in a closed loop: the current model generates plausible user interaction sequences, a fidelity-based quality control mechanism filters them for consistency with user's approximate preference manifold, and a successor model is augmented on the enriched dataset. Our theoretical analysis shows that RSIR acts as a data-driven implicit regularizer, smoothing the optimization landscape and guiding models toward more robust solutions. Empirically, RSIR yields consistent, cumulative gains across multiple benchmarks and architectures. Notably, even smaller models benefit, and weak models can generate effective training curricula for stronger ones. These results demonstrate that recursive self-improvement is a general, model-agnostic approach to overcoming data sparsity, suggesting a scalable path forward for recommender systems and beyond. Our anonymized code is available at https://github.com/USTC-StarTeam/RSIR. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_15659 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Can Recommender Systems Teach Themselves? A Recursive Self-Improving Framework with Fidelity Control Zhang, Luankang Wang, Hao Liu, Zhongzhou Yin, Mingjia Huang, Yonghao Li, Jiaqi Guo, Wei Liu, Yong Guo, Huifeng Lian, Defu Chen, Enhong Information Retrieval The scarcity of high-quality training data presents a fundamental bottleneck to scaling machine learning models. This challenge is particularly acute in recommendation systems, where extreme sparsity in user interactions leads to rugged optimization landscapes and poor generalization. We propose the Recursive Self-Improving Recommendation (RSIR) framework, a paradigm in which a model bootstraps its own performance without reliance on external data or teacher models. RSIR operates in a closed loop: the current model generates plausible user interaction sequences, a fidelity-based quality control mechanism filters them for consistency with user's approximate preference manifold, and a successor model is augmented on the enriched dataset. Our theoretical analysis shows that RSIR acts as a data-driven implicit regularizer, smoothing the optimization landscape and guiding models toward more robust solutions. Empirically, RSIR yields consistent, cumulative gains across multiple benchmarks and architectures. Notably, even smaller models benefit, and weak models can generate effective training curricula for stronger ones. These results demonstrate that recursive self-improvement is a general, model-agnostic approach to overcoming data sparsity, suggesting a scalable path forward for recommender systems and beyond. Our anonymized code is available at https://github.com/USTC-StarTeam/RSIR. |
| title | Can Recommender Systems Teach Themselves? A Recursive Self-Improving Framework with Fidelity Control |
| topic | Information Retrieval |
| url | https://arxiv.org/abs/2602.15659 |