arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.08176cs.IRcs.AI
收藏

HRCF:通过双曲几何正则化增强协同过滤

HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric Regularization

The Chinese University of Hong Kong(香港中文大学);Huawei Noah’s Ark Lab(华为诺亚方舟实验室);Harbin Institute of Technology(哈尔滨工业大学);University of Science and Technology of China(中国科学技术大学)

Menglin Yang, Min Zhou, Jiahong Liu, Defu Lian, Irwin King

摘要:

在大规模推荐系统中,用户-项目网络通常是无标度的或指数扩展的。用于描述用户和项目的潜在特征(也称为嵌入)取决于嵌入空间与数据分布的匹配程度。双曲空间提供了一个宽敞的空间来学习嵌入与其负曲率和度量性质,它可以很好地适应数据与树状结构。最近,已经提出了几种双曲线方法来学习用户和项目的高质量表示。然而,他们中的大多数人都集中在开发双曲相似通过设计适当的投影操作,而双曲空间的许多有利的和令人兴奋的几何性质还没有明确地探索。例如,双曲空间最显著的性质之一是其容量空间随半径呈指数增长,这表明远离双曲原点的区域更可嵌入。针对双曲空间的几何特性,提出了基于双曲正则化的协同过滤算法(HRCF),并设计了一个几何感知的双曲正则化器。具体而言,该建议通过根对齐和原点感知惩罚来提高优化过程,这是简单而有效的。通过理论分析,我们进一步表明,我们的建议是能够解决双曲聚集所造成的过度平滑问题,也带来了更好的模型的鉴别能力。我们进行了广泛的实证分析,将我们的建议与几个公共基准的大量基线进行比较。实证结果表明,我们的方法实现了极具竞争力的性能,并超过了领先的欧几里得和双曲线基线相当大的利润。

英文摘要:

In large-scale recommender systems, the user-item networks are generally scale-free or expand exponentially. The latent features (also known as embeddings) used to describe the user and item are determined by how well the embedding space fits the data distribution. Hyperbolic space offers a spacious room to learn embeddings with its negative curvature and metric properties, which can well fit data with tree-like structures. Recently, several hyperbolic approaches have been proposed to learn high-quality representations for the users and items. However, most of them concentrate on developing the hyperbolic similitude by designing appropriate projection operations, whereas many advantageous and exciting geometric properties of hyperbolic space have not been explicitly explored. For example, one of the most notable properties of hyperbolic space is that its capacity space increases exponentially with the radius, which indicates the area far away from the hyperbolic origin is much more embeddable. Regarding the geometric properties of hyperbolic space, we bring up a Hyperbolic Regularization powered Collaborative Filtering(HRCF) and design a geometric-aware hyperbolic regularizer. Specifically, the proposal boosts optimization procedure via the root alignment and origin-aware penalty, which is simple yet impressively effective. Through theoretical analysis, we further show that our proposal is able to tackle the over-smoothing problem caused by hyperbolic aggregation and also brings the models a better discriminative ability. We conduct extensive empirical analysis, comparing our proposal against a large set of baselines on several public benchmarks. The empirical results show that our approach achieves highly competitive performance and surpasses both the leading Euclidean and hyperbolic baselines by considerable margins.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑