Table of Contents
Fetching ...

TF-DCon: Leveraging Large Language Models (LLMs) to Empower Training-Free Dataset Condensation for Content-Based Recommendation

Jiahao Wu, Qijiong Liu, Hengchang Hu, Wenqi Fan, Shengcai Liu, Qing Li, Xiao-Ming Wu, Ke Tang

TL;DR

The paper tackles the prohibitive training costs of textual content-based recommendation by introducing TF-DCon, a training-free dataset condensation method that leverages large language models. It condenses item content into informative titles (content-level) and synthesizes users with condensed histories via clustering based on extracted interests (user-level), all in a forward, non-iterative process. TF-DCon achieves up to approximately 97% of original performance with around 95% data reduction on real-world datasets and offers substantial training-time speedups, while generalizing across multiple CBR backbones and language models. The approach significantly reduces compute and data requirements, enabling scalable deployment in dynamic recommendation settings, though it relies on LLM preprocessing and shows varying performance with open-source LLMs.

Abstract

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).

TF-DCon: Leveraging Large Language Models (LLMs) to Empower Training-Free Dataset Condensation for Content-Based Recommendation

TL;DR

The paper tackles the prohibitive training costs of textual content-based recommendation by introducing TF-DCon, a training-free dataset condensation method that leverages large language models. It condenses item content into informative titles (content-level) and synthesizes users with condensed histories via clustering based on extracted interests (user-level), all in a forward, non-iterative process. TF-DCon achieves up to approximately 97% of original performance with around 95% data reduction on real-world datasets and offers substantial training-time speedups, while generalizing across multiple CBR backbones and language models. The approach significantly reduces compute and data requirements, enabling scalable deployment in dynamic recommendation settings, though it relies on LLM preprocessing and shows varying performance with open-source LLMs.

Abstract

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).
Paper Structure (39 sections, 10 equations, 5 figures, 12 tables, 3 algorithms)

This paper contains 39 sections, 10 equations, 5 figures, 12 tables, 3 algorithms.

Figures (5)

  • Figure 1: Comparison on the pipelines of dataset synthesis between our TF-DCon and previously proposed methods in other domains.
  • Figure 2: The Proposed Method in a Nutshell. The outline of this method is presented in Algorithm \ref{['alg:tf-dcon']} and the details of the prompt's evolution are outlined in Algorithm \ref{['alg:EvoPro']}. "N. G." denotes "Next Generated Prompt Candidates". Given a prompt, the content-level condensation and user interest extraction are instanced in Figure \ref{['fig:instances']}.
  • Figure 3: An instance of content-level condensation and user interest extraction.
  • Figure 4: Training efficiency on original and condensed datasets.
  • Figure 5: Varying the hyperparameter $\alpha$ in Eq. \ref{['eq:dis-user']}.