arXiv AI By Mubaraka Sani Ibrahim, Lehel Csat\'o, Isah Charles Saidu

Rank-Constrained Deep Matrix Completion for Group Recommendation

Read the original on arXiv AI →

arXiv:2606. 01948v1 Announce Type: cross Abstract: The growing popularity of group activities has increased the need for methods that provide recommendations to groups of users given their individual preferences.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Jul 28

SpecFormer: Mitigating Embedding and Attention Collapse via Spectral-Aware Transformer for Recommendation

arXiv:2607. 24025v1 Announce Type: cross Abstract: Transformer architectures have achieved remarkable success across diverse domains; however, directly applying their standard self-attention mechanism to recommendation often yields suboptimal performance, sometimes even trailing behind well-designed simple recommendation models.

By Yu Cui, Yi Xu, Jiahao Wang, Hao Zhang, Yu Zhang, Xiaoyi Zeng, Can Wang, Jinxin Hu, Jiawei Chen
arXiv Computer Vision
3d ago

SOLAR: SVD-Optimized Lifelong Attention for Recommendation

arXiv:2603.02561v2 Announce Type: replace-cross Abstract: Attention mechanism remains the defining operator in Transformers since it provides expressive global credit assignment, yet its quadratic co...

By Chenghao Zhang, Chao Feng, Yuanhao Pu, Xunyong Yang, Wenhui Yu, Xiang Li, Chunjie Chen, Kaiqiao Zhan
arXiv AI
Aug 13

VLM2Rec: Resolving Modality Collapse in Vision-Language Model Embedders for Multimodal Sequential Recommendation

arXiv:2603. 17450v2 Announce Type: replace-cross Abstract: Sequential Recommendation (SR) in multimodal settings typically relies on small frozen pretrained encoders, which limits semantic capacity and prevents Collaborative Filtering (CF) signals from being fully integrated into item representations.

By Junyoung Kim, Woojoo Kim, Wonbin Kweon, Jaehyung Lim, Dongha Kim, Hwanjo Yu
arXiv AI
Sep 12

On the Regularization Landscape for the Linear Recommendation Models

The paper investigates why many state‑of‑the‑art recommendation algorithms, despite using diverse deep‑learning techniques, achieve similar performance. It shows that the key commonality is a regularizer: either a nuclear‑norm or a Frobenius‑norm term. The authors further propose two new low‑rank, closed‑form solutions that combine the advantages of both regularizers.

By Dong Li, Zhenming Liu, Ruoming Jin, Hao Zhou, Zhi Liu, Jing Gao, Bin Ren