arXiv subjects

Yongyi Lin

Publications and source records attributed to Yongyi Lin.

3 recordsLinked to original sources

arXiv2026

BIPCL: Bilateral Intent-Enhanced Sequential Recommendation via Embedding Perturbation Contrastive Learning

Accurately modeling users' evolving preferences from sequential interactions remains a central challenge in recommender systems. Recent studies emphasize the importance of capturing multiple latent intents underlying user behaviors. However, existing methods often fail to effectively exploit collective intent signals shared across users and items, leading to information isolation and limited robustness. Meanwhile, current contrastive learning approaches struggle to construct views that are both semantically consistent and sufficiently discriminative. In this work, we propose BIPCL, an end-to-end Bilateral Intent-enhanced, Embedding Perturbation-based Contrastive Learning framework. BIPCL explicitly integrates multi-intent signals into both item and sequence representations via a bilateral intent-enhancement mechanism. Specifically, shared intent prototypes on the user and item sides capture collective intent semantics distilled from behaviorally similar entities, which are subsequently integrated into representation learning. This design alleviates information isolation and improves robustness under sparse supervision. To construct effective contrastive views without disrupting temporal or structural dependencies, BIPCL injects bounded, direction-aware perturbations directly into structural item embeddings. On this basis, BIPCL further enforces multi-level contrastive alignment across interaction- and intent-level representations. Extensive experiments on benchmark datasets demonstrate that BIPCL consistently outperforms state-of-the-art baselines, with ablation studies confirming the contribution of each component.

cs.IR↗

arXiv2025

Dual-Perspective Disentangled Multi-Intent Alignment for Enhanced Collaborative Filtering

Personalized recommendation requires capturing the complex latent intents underlying user-item interactions. Existing structural models, however, often fail to preserve perspective-dependent interaction semantics and provide only indirect supervision for aligning user and item intents, lacking explicit interaction-level constraints. This entangles heterogeneous interaction signals, leading to semantic ambiguity, reduced robustness under sparse interactions, and limited interpretability. To address these issues, we propose DMICF, a Dual-Perspective Disentangled Multi-Intent framework for collaborative filtering. DMICF models interactions from complementary user- and item-centric perspectives and employs a macro-micro prototype-aware variational encoder to disentangle fine-grained latent intents. Interaction-level supervision enforces dimension-wise alignment between user and item intents, grounding latent factors and enabling their collaborative emergence. Importantly, each component is architecturally flexible, and performance is robust to specific module instantiations. We offer a theoretical analysis to help explain how prototype-aware conditioning may alleviate posterior collapse, while the reconstruction objective promotes intent-wise contrastive alignment between positive and negative interactions. Extensive experiments on multiple benchmarks demonstrate consistent improvements over strong baselines, with ablations validating each core component.

cs.IR↗

arXiv2024

Efficient Bipartite Graph Embedding Induced by Clustering Constraints

Bipartite graph embedding (BGE) maps nodes to compressed embedding vectors that can reflect the hidden topological features of the network, and learning high-quality BGE is crucial for facilitating downstream applications such as recommender systems. However, most existing methods either struggle to efficiently learn embeddings suitable for users and items with fewer interactions, or exhibit poor scalability to handle large-scale networks. In this paper, we propose a Clustering Constraints induced BIpartite graph Embedding (CCBIE) as an integrated solution to both problems. CCBIE facilitates automatic and dynamic soft clustering of items in a top-down manner, and capturing macro-preference information of users through clusters. Specifically, by leveraging the cluster embedding matrix of items, CCBIE calculates the cluster assignment matrix for items and also captures the extent of user preferences across different clusters, thereby elucidating the similarity between users and items on a macro-scale level. CCBIE effectively preserves the global properties of bipartite graphs, maintaining the cluster structure of isomorphic nodes and accounting for long-range dependencies among heterogeneous nodes. Our approach significantly enhances user-item collaborative relation modeling by integrating adaptive clustering for relationship learning, thereby markedly improving prediction performance, particularly benefiting cold users and items. Extensive experiments indicate that CCBIE consistently and significantly improves accuracy over baseline models, particularly on sparse graphs, while also enhancing training speed and reducing memory requirements on large-scale bipartite graphs.

cs.SI↗