cs.IR · 2026-10-27 · No. 155
Information Retrieval, 2026-10-27.
4 new papers in cs.IR. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
4 entries-
01
Do Similarity Measures Measure Similarity? How User Activity Creates Phantom Correlation in Recommender Systems
Marco Favier, Noah Daniëls, Jens Leysen, Sander Marinus, Bart Goethals
cs.IR · cs.AI
Item-item similarity is one of the oldest and most foundational signals in recommender systems: two items are assumed to be similar when the same users consume them. Despite the sparsity and scale of interaction data, the implicit assumption across the field is that item co-occurrence reflects genuine shared preference, capturing what users like together. In this paper, we demonstrate that a substantial fraction of observed item-item...
-
02
Towards a Unified Framework of Optimal Input-Side Dimensional Configuration for Deep CTR Prediction
Chaohua Yang, Fuyuan Lyu, Xing Tang, Dugang Liu, Xiuqiang He, Zhong Ming
cs.IR · cs.AI
Deep click-through rate (CTR) prediction has achieved substantial success through increasingly expressive feature interaction architectures. However, predictive performance also depends on how input-side information is configured before interaction modeling. Existing studies have shown that selecting informative samples, features, or embedding units can improve prediction accuracy. Nevertheless, they primarily optimize these selection...
-
03
Cross-Domain Sequential Recommendation with Representation-Level User Transfer
Abdulaziz Samra, Nikita Sukhorukov, Alexey Grishanov, Alexey Vasilev, Evgeny Frolov
cs.IR · cs.AI · cs.DC
Cross-domain sequential recommendation aims to improve next-item prediction in a target domain by leveraging user behavior from auxiliary source domains. However, real-world deployment faces two critical challenges: business constraints that isolate interaction data across domains, and user heterogeneity, where many users lack cross-domain activity. This makes existing cross-domain methods difficult to apply. In this paper, we propose a...
-
04
CA-HNM: Constraint-Aware Hard Negative Mining for Dense Retrieval with Structured Domain Models
Ngoc Luyen Le, Marie-Hélène Abel, Bertrand Laforge
cs.IR · cs.AI
Dense retrievers are commonly trained with hard negatives selected from lexical or dense retrieval results. Retrieval proximity, however, does not indicate whether a candidate conflicts with explicit domain structure. We introduce CA-HNM, a constraint-aware hard-negative mining framework that combines retrieval-based candidate generation with deterministic incompatibility rules derived from a structured domain model. The framework removes...
This edition is part of The Daily Abstract — cs.IR archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.