Controllable Gradient Item Retrieval

Haonan Wang, Chang Zhou, Carl Yang, Hongxia Yang, Jingrui He

Introduction: Moving Beyond the "Best Match"

Standard recommendation systems are typically designed to find a single, most relevant item for a user. However, human preferences are often nuanced and subjective. For instance, a shopper viewing a white dress might desire something "more floral." A single result may fail to capture the specific intensity of the change the user has in mind—ranging from a subtle pattern to a dense botanical print.

Conceptual illustration of gradient item retrieval where users seek items with specific attribute modifications.

The challenge lies in the fact that current models focus primarily on similarity, mapping queries and items to the same point in a latent space. They often ignore the demand for a gradient: a smooth transition where one specific attribute changes while others, such as category or basic style, remain constant. Furthermore, training such systems usually requires expensive, hand-labeled sequences of "increasingly X" items, which are rarely available in real-world datasets.

The CGIR Framework

To address these challenges, researchers developed CGIR (Controllable Gradient Item Retrieval). This framework treats a modification query not as a static destination, but as a "walk" within a hidden representation space. The architecture is built on four key pillars:

  1. Disentangled Representations: Utilizing a Variational Autoencoder (VAE), the model learns to represent items such that different data dimensions are independent. This ensures that modifying one attribute (e.g., "more floral") does not inadvertently change another (e.g., making a dress "shorter").
  2. Sparse Attribute Grounding: A sparse encoder maps text attributes (like "romantic" or "sporty") to specific dimensions in the item's latent space. By enforcing sparsity, the model ensures each attribute only affects a few specific "knobs" in the representation.
  3. The "Latent Walk": To retrieve a gradient, the system starts at the reference item's position and moves in the direction of the attribute vector. By gradually increasing the "step size" ($\gamma$), it retrieves a sequence of items exhibiting the desired change.
  4. Weak Supervision: Instead of requiring labeled sequences, the model only needs binary data indicating whether an item possesses an attribute. This makes the training process significantly more practical for industrial applications.
The CGIR architecture featuring disentangled representations and the "latent walk" modification process.

Key Insights and Results

The authors emphasize two measurable goals for disentanglement: Consistency (ensuring the retrieved items actually follow the requested attribute change) and Restrictiveness (ensuring irrelevant attributes remain unchanged). By using a VAE framework, the model acts as an information bottleneck, filtering out noise from raw user-item interaction data and maintaining a predictable, linear path for retrieval.

Performance Metrics

CGIR was evaluated against state-of-the-art baselines (such as TIRG and DSCMR) on three large-scale datasets: ALiShop-tag (from Alibaba’s Taobao), MovieLens-25M, and MovieLens-20M.

  • Retrieval Accuracy: On the ALiShop-tag dataset, CGIR achieved a Hit@50 of 0.1019, nearly doubling the performance of several cross-modal retrieval baselines.
  • Gradient Quality: Using a new metric called Mean Gradient Score (MGS), the researchers confirmed that CGIR is superior at maintaining restrictiveness while following the desired attribute gradient.
  • Qualitative Success: Case studies demonstrated the model's ability to retrieve movies that became progressively "more romantic" or "less action-oriented," as well as sneakers that became increasingly "sporty."

Future Directions

While CGIR represents a significant step forward, future work may explore simultaneous multi-attribute gradients (e.g., "more floral AND shorter") and the integration of real-time user feedback to refine the direction of the latent walk during a search session.

Summary updated

Abstract

In this paper, we identify and study an important problem of gradient item retrieval. We define the problem as retrieving a sequence of items with a gradual change on a certain attribute, given a reference item and a modification text. For example, after a customer saw a white dress, she/he wants to buy a similar one but more floral on it. The extent of "more floral" is subjective, thus prompting one floral dress is hard to satisfy the customer's needs. A better way is to present a sequence of products with increasingly floral attributes based on the white dress, and allow the customer to select the most satisfactory one from the sequence. Existing item retrieval methods mainly focus on whether the target items appear at the top of the retrieved sequence, but ignore the demand for retrieving a sequence of products with gradual change on a certain attribute. To deal with this problem, we propose a weakly-supervised method that can learn a disentangled item representation from user-item interaction data and ground the semantic meaning of attributes to dimensions of the item representation. Our method takes a reference item and a modification as a query. During inference, we start from the reference item and "walk" along the direction of the modification in the item representation space to retrieve a sequence of items in a gradient manner. We demonstrate our proposed method can achieve disentanglement through weak supervision. Besides, we empirically show that an item sequence retrieved by our method is gradually changed on an indicated attribute and, in the item retrieval task, our method outperforms existing approaches on three different datasets.
BibTeX
@inproceedings{wang2021controllable,
  author = {Haonan Wang and Chang Zhou and Carl Yang and Hongxia Yang and Jingrui He},
  title = {{Controllable Gradient Item Retrieval}},
  booktitle = {The Web Conference},
  year = {2021},
  doi = {10.1145/3442381.3449963},
}
Figure