paper-with-me

홈 › Papers

Curse of "Low" Dimensionality in Recommender Systems

2023-05-23 · Naoto Ohsaka, Riku Togashi

Beyond accuracy, there are a variety of aspects to the quality of recommender systems, such as diversity, fairness, and robustness. We argue that many of the prevalent problems in recommender systems are partly due to low-dimensionality of user and item embeddings, particularly when dot-product models, such as matrix factorization, are used. In this study, we showcase empirical evidence suggesting the necessity of sufficient dimensionality for user/item embeddings to achieve diverse, fair, and robust recommendation. We then present theoretical analyses of the expressive power of dot-product models. Our theoretical results demonstrate that the number of possible rankings expressible under dot-product models is exponentially bounded by the dimension of item factors. We empirically found that the low-dimensionality contributes to a popularity bias, widening the gap between the rank positions of popular and long-tail items; we also give a theoretical justification for this phenomenon.

📄 PDF Abstract BibTeX arXiv:2305.13597

Code (0)

등록된 구현이 없습니다.

Tasks

DiversityFairnessRecommendation Systems

Similar Papers 제목 키워드 기반

Variational Autoencoders for Highly Multivariate Spatial Point Processes Intensities

2020-05-01 · ICLR 2020 1 · Baichuan Yuan, Xiaowei Wang, Jianxin Ma, Chang Zhou 외

Multivariate spatial point process models can describe heterotopic data over space. However, highly multivariate intensities are computationally challenging due to the curse of dimensionality. To bridge this gap, we intr…

Collaborative FilteringPoint ProcessesRecommendation Systems

Deep neural network approximations for Monte Carlo algorithms

2019-08-28 · Philipp Grohs, Arnulf Jentzen, Diyora Salimova

Recently, it has been proposed in the literature to employ deep neural networks (DNNs) together with stochastic gradient descent methods to approximate solutions of PDEs. There are also a few results in the literature wh…

What Breaks The Curse of Dimensionality in Deep Learning?

2021-05-21 · NeurIPS 2021 12 · Lechao Xiao, Jeffrey Pennington

Although learning in high dimensions is commonly believed to suffer from the curse of dimensionality, modern machine learning methods often exhibit an astonishing power to tackle a wide range of challenging real-world le…

Deep LearningOpen-Ended Question Answering

Does the Barron space really defy the curse of dimensionality?

2025-08-17 · Olov Schavemaker arxiv

The Barron space has become famous in the theory of (shallow) neural networks because it seemingly defies the curse of dimensionality. And while the Barron space (and generalizations) indeed defies (defy) the curse of di…

RELEAF: An Algorithm for Learning and Exploiting Relevance

2015-02-05 · Cem Tekin, Mihaela van der Schaar

Recommender systems, medical diagnosis, network security, etc., require on-going learning and decision-making in real time. These -- and many others -- represent perfect examples of the opportunities and difficulties pre…

Decision MakingMedical DiagnosisRecommendation SystemsRelation