AI & ML
Theoretically Sound Item Similarity Measures for Recommender Systems
arXiv cs.IR0 views
arXiv:2610.34402v1 Announce Type: new Abstract: Quantifying the similarity between items is fundamental to neighborhood-based collaborative filtering, yet many commonly used similarity measures are heuristics that lack theoretical justification. The use of heuristics forces practitioners to rely on empirical trial-and-error, offering little insight into why certain measures outperform others or how they might be improved. In this paper, we present a principled approach for designing item similarity measures grounded in probabilistic modeling and parameter estimation. By adopting this formal perspective, we derive two previously overlooked similarity measures based on the Bernoulli and multinomial distributions. Through an extensive ablation study we highlight the critical role of bias, probabilistic smoothing, treating the unknowns correctly, and choosing appropriate probability distributions. Finally, we show that the commonly used cosine similarity can be interpreted as the solution to a specific optimization problem, thereby providing a novel perspective on this decades-old heuristic.
Source:https://arxiv.org/abs/2610.34402PreviousA Domain-Aware Pipeline for Structured Extraction and Retrieval-Augmented Question Answering over arXiv Superconductivity LiteratureNextAgent Memory as Recommendation: Recommender-System Design for Long-Term Memory of LLM Agents
Related posts

Keep Distributed Training Running with Automated Workload Recovery
0NVIDIA Developer Blog

Diagnose Distributed AI Workload Failures with NVIDIA Attribution
0NVIDIA Developer Blog
Alibaba Lab Cuts AI Upgrade Bills By Rewriting Core Numbers
0dev.to AI
Regalos para la persona que tiene un negocio pequeno, ensena, o crea cosas (en espanol)
0dev.to AI
CrowdStrike Expands Project QuiltWorks Across Europe
0dev.to AI
Lighthouse 13.6 Can Raise PageSpeed Insights Scores Without a Site Change
0dev.to AI