Pith. sign in

REVIEW 2 cited by

End-to-end Learnable Clustering for Intent Learning in Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.05975 v5 pith:ZDHTNVL7 submitted 2024-01-11 cs.IR cs.AI

classification cs.IRcs.AI
keywords learningrecommendationunderlinecentersclusterelcrecgithubintent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Intent learning, which aims to learn users' intents for user understanding and item recommendation, has become a hot research spot in recent years. However, existing methods suffer from complex and cumbersome alternating optimization, limiting performance and scalability. To this end, we propose a novel intent learning method termed \underline{ELCRec}, by unifying behavior representation learning into an \underline{E}nd-to-end \underline{L}earnable \underline{C}lustering framework, for effective and efficient \underline{Rec}ommendation. Concretely, we encode user behavior sequences and initialize the cluster centers (latent intents) as learnable neurons. Then, we design a novel learnable clustering module to separate different cluster centers, thus decoupling users' complex intents. Meanwhile, it guides the network to learn intents from behaviors by forcing behavior embeddings close to cluster centers. This allows simultaneous optimization of recommendation and clustering via mini-batch data. Moreover, we propose intent-assisted contrastive learning by using cluster centers as self-supervision signals, further enhancing mutual promotion. Both experimental results and theoretical analyses demonstrate the superiority of ELCRec from six perspectives. Compared to the runner-up, ELCRec improves NDCG@5 by 8.9\% and reduces computational costs by 22.5\% on the Beauty dataset. Furthermore, due to the scalability and universal applicability, we deploy this method on the industrial recommendation system with 130 million page views and achieve promising results. The codes are available on GitHub (https://github.com/yueliu1999/ELCRec). A collection (papers, codes, datasets) of deep group recommendation/intent learning methods is available on GitHub (https://github.com/yueliu1999/Awesome-Deep-Group-Recommendation).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LLM4MEA: Data-free Model Extraction Attacks on Sequential Recommenders via Large Language Models

    cs.IR 2025-07 conditional novelty 6.0 of 10

    An LLM-driven agent generates synthetic interaction sequences that, when queried against a target sequential recommender, produce surrogate models with higher agreement to the target than random or autoregressive data...

  2. Intent-Interest Disentanglement and Item-Aware Intent Contrastive Learning for Sequential Recommendation

    cs.IR 2025-01 conditional novelty 6.0 of 10

    IDCLRec disentangles user behaviors into interests and intents and applies intent-item contrastive learning to improve sequential recommendation accuracy beyond current baselines.

Pith tools