HICF: Hyperbolic Informative Collaborative Filtering

• URL: http://arxiv.org/abs/2207.09051v1
• Date: Tue, 19 Jul 2022 03:45:38 GMT
• Title: HICF: Hyperbolic Informative Collaborative Filtering
• Authors: Menglin Yang, Zhihao Li, Min Zhou, Jiahong Liu, Irwin King
• Abstract summary: hyperbolic space is well-suited to describe the power-law distributed user-item network. It is unclear which kinds of items can be effectively recommended by the hyperbolic model and which cannot. We propose a novel learning method, named hyperbolic informative collaborative filtering (HICF), to compensate for the recommendation effectiveness of the head item.
• Score: 35.26872278129825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Considering the prevalence of the power-law distribution in user-item networks, hyperbolic space has attracted considerable attention and achieved impressive performance in the recommender system recently. The advantage of hyperbolic recommendation lies in that its exponentially increasing capacity is well-suited to describe the power-law distributed user-item network whereas the Euclidean equivalent is deficient. Nonetheless, it remains unclear which kinds of items can be effectively recommended by the hyperbolic model and which cannot. To address the above concerns, we take the most basic recommendation technique, collaborative filtering, as a medium, to investigate the behaviors of hyperbolic and Euclidean recommendation models. The results reveal that (1) tail items get more emphasis in hyperbolic space than that in Euclidean space, but there is still ample room for improvement; (2) head items receive modest attention in hyperbolic space, which could be considerably improved; (3) and nonetheless, the hyperbolic models show more competitive performance than Euclidean models. Driven by the above observations, we design a novel learning method, named hyperbolic informative collaborative filtering (HICF), aiming to compensate for the recommendation effectiveness of the head item while at the same time improving the performance of the tail item. The main idea is to adapt the hyperbolic margin ranking learning, making its pull and push procedure geometric-aware, and providing informative guidance for the learning of both head and tail items. Extensive experiments back up the analytic findings and also show the effectiveness of the proposed method. The work is valuable for personalized recommendations since it reveals that the hyperbolic space facilitates modeling the tail item, which often represents user-customized preferences or new products.

Related papers

• Towards a Theoretical Understanding of Two-Stage Recommender Systems [0.5439020425819]
  Production-grade recommender systems rely heavily on a large-scale corpus used by online media services, including Netflix, Pinterest, and Amazon. We study the behaviors of the two-stage recommender that entail a strong convergence to the optimal recommender system. We show numerically that the two-stage recommender enables encapsulating the impacts of items' and users' attributes on ratings.
  arXiv  Detail & Related papers  (2024-02-23T21:11:55Z)
• Hyperbolic vs Euclidean Embeddings in Few-Shot Learning: Two Sides of the Same Coin [49.12496652756007]
  We show that the best few-shot results are attained for hyperbolic embeddings at a common hyperbolic radius. In contrast to prior benchmark results, we demonstrate that better performance can be achieved by a fixed-radius encoder equipped with the Euclidean metric.
  arXiv  Detail & Related papers  (2023-09-18T14:51:46Z)
• Hyperbolic Representation Learning: Revisiting and Advancing [43.1661098138936]
  We introduce a position-tracking mechanism to scrutinize existing prevalent hlms, revealing that the learned representations are sub-optimal and unsatisfactory. We propose a simple yet effective method, hyperbolic informed embedding (HIE), by incorporating cost-free hierarchical information deduced from the hyperbolic distance of the node to origin. Our method achieves a remarkable improvement of up to 21.4% compared to the competing baselines.
  arXiv  Detail & Related papers  (2023-06-15T13:25:39Z)
• Time-aware Hyperbolic Graph Attention Network for Session-based Recommendation [58.748215444851226]
  Session-based Recommendation (SBR) is to predict users' next interested items based on their previous browsing sessions. We propose Time-aware Hyperbolic Graph Attention Network (TA-HGAT) to build a session-based recommendation model considering temporal information.
  arXiv  Detail & Related papers  (2023-01-10T04:16:09Z)
• HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric Regularization [52.369435664689995]
  We introduce a textitHyperbolic 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. Our proposal is able to tackle the over-smoothing problem caused by hyperbolic aggregation and also brings the models a better discriminative ability.
  arXiv  Detail & Related papers  (2022-04-18T06:11:44Z)
• PipAttack: Poisoning Federated Recommender Systems forManipulating Item Promotion [58.870444954499014]
  A common practice is to subsume recommender systems under the decentralized federated learning paradigm. We present a systematic approach to backdooring federated recommender systems for targeted item promotion.
  arXiv  Detail & Related papers  (2021-10-21T06:48:35Z)
• Self-Supervised Reinforcement Learning for Recommender Systems [77.38665506495553]
  We propose self-supervised reinforcement learning for sequential recommendation tasks. Our approach augments standard recommendation models with two output layers: one for self-supervised learning and the other for RL. Based on such an approach, we propose two frameworks namely Self-Supervised Q-learning(SQN) and Self-Supervised Actor-Critic(SAC)
  arXiv  Detail & Related papers  (2020-06-10T11:18:57Z)
• Hyperbolic Manifold Regression [33.40757136529844]
  We consider the problem of performing manifold-valued regression onto an hyperbolic space as an intermediate component for a number of relevant machine learning applications. We propose a novel perspective on two challenging tasks: 1) hierarchical classification via label embeddings and 2) taxonomy extension of hyperbolic representations. Our experiments show that the strategy of leveraging the hyperbolic geometry is promising.
  arXiv  Detail & Related papers  (2020-05-28T10:16:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.