TF-DCon: Leveraging Large Language Models (LLMs) to Empower Training-Free Dataset Condensation for Content-Based Recommendation
Not on the map. Why?
Abstract (arXiv)
Modern techniques in Content-based Recommendation (CBR) leverage item content information to provide personalized services to users, but suffer from resource-intensive training on large datasets. To address this issue, we explore the dataset condensation for textual CBR in this paper. The goal of dataset condensation is to synthesize a small yet informative dataset, upon which models can achieve performance comparable to those trained on large datasets. While existing condensation approaches are tailored to classification tasks for continuous data like images or embeddings, direct application of them to CBR has limitations. To bridge this gap, we investigate efficient dataset condensation for content-based recommendation. Inspired by the remarkable abilities of large language models (LLMs) in text comprehension and generation, we leverage LLMs to empower the generation of textual content during condensation. To handle the interaction data involving both users and items, we devise a dual-level condensation method: content-level and user-level. At content-level, we utilize LLMs to condense all contents of an item into a new informative title. At user-level, we design a clustering-based synthesis module, where we first utilize LLMs to extract user interests. Then, the user interests and user embeddings are incorporated to condense users and generate interactions for condensed users. Notably, the condensation paradigm of this method is forward and free from iterative optimization on the synthesized dataset. Extensive empirical findings from our study, conducted on three authentic datasets, substantiate the efficacy of the proposed method. Particularly, we are able to approximate up to 97% of the original performance while reducing the dataset size by 95% (i.e., on dataset MIND).
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Oct 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 7; 2025: 1; 2026: 1.
9 papers.
- 2024Graph Machine Learning in the Era of Large Language Models (LLMs)cited by 33
- 2024Towards Next-Generation LLM-based Recommender Systems: A Survey and Beyondcited by 26
- 2025TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendationcited by 13
- 2024Adapt2Reward: Adapting Video-Language Models to Generalizable Robotic Rewards via Failure Promptscited by 9
- 2024Generative Explore-Exploit: Training-free Optimization of Generative Recommender Systems using LLM Optimizerscited by 7
- 2024Backdoor Graph Condensationcited by 5
- 2024Survey for Landing Generative AI in Social and E-commerce Recsys -- the Industry Perspectivescited by 3
- 2024LLM-KT: A Versatile Framework for Knowledge Transfer from Large Language Models to Collaborative Filteringcited by 2
- 2026Generative Data Transformation: From Mixed to Unified Datacited by 0
- 2026Generative Data Transformation: From Mixed to Unified Data26 Feb 2026
- 2025TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation5 Feb 2025
- 2024LLM-KT: A Versatile Framework for Knowledge Transfer from Large Language Models to Collaborative Filtering1 Nov 2024
- 2024Towards Next-Generation LLM-based Recommender Systems: A Survey and Beyond10 Oct 2024
- 2024Adapt2Reward: Adapting Video-Language Models to Generalizable Robotic Rewards via Failure Prompts20 Jul 2024
- 2024Backdoor Graph Condensation3 Jul 2024
- 2024Survey for Landing Generative AI in Social and E-commerce Recsys -- the Industry Perspectives10 Jun 2024
- 2024Generative Explore-Exploit: Training-free Optimization of Generative Recommender Systems using LLM Optimizers7 Jun 2024
- 2024Graph Machine Learning in the Era of Large Language Models (LLMs)23 Apr 2024