Can Recommender Systems Teach Themselves? A Recursive Self-Improving Framework with Fidelity Control
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Feb 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Why Thinking Hurts: Diagnosing and Rectifying Linguistic Inertia in Large Language Models for Recommendationcited by 9
- 2026Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibrationcited by 4
- 2026Efficient Personalized Reranking with Semi-Autoregressive Generation and Online Knowledge Distillationcited by 3
- 2026IE as Cache: Information Extraction Enhanced Agentic Reasoningcited by 3
- 2026AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMscited by 1
- 2026AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMs26 Aug 2026
- 2026IE as Cache: Information Extraction Enhanced Agentic Reasoning16 Apr 2026
- 2026Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibration11 Apr 2026
- 2026Efficient Personalized Reranking with Semi-Autoregressive Generation and Online Knowledge Distillation7 Mar 2026
- 2026Why Thinking Hurts: Diagnosing and Rectifying Linguistic Inertia in Large Language Models for Recommendation18 Feb 2026