$FM^2$: Field-matrixed Factorization Machines for Recommender Systems
원문 초록
Click-through rate (CTR) prediction plays a critical role in recommender systems and online advertising. The data used in these applications are multi-field categorical data, where each feature belongs to one field. Field information is proved to be important and there are several works considering fields in their models. In this paper, we proposed a novel approach to model the field information effectively and efficiently. The proposed approach is a direct improvement of FwFM, and is named as Field-matrixed Factorization Machines (FmFM, or $FM^2$). We also proposed a new explanation of FM and FwFM within the FmFM framework, and compared it with the FFM. Besides pruning the cross terms, our model supports field-specific variable dimensions of embedding vectors, which acts as soft pruning. We also proposed an efficient way to minimize the dimension while keeping the model performance. The FmFM model can also be optimized further by caching the intermediate vectors, and it only takes thousands of floating-point operations (FLOPs) to make a prediction. Our experiment results show that it can out-perform the FFM, which is more complex. The FmFM model's performance is also comparable to DNN models which require much more FLOPs in runtime.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MoE-MLoRA for Multi-Domain CTR Prediction: Efficient Adaptation with Expert Specialization
News Popularity Beyond the Click-Through-Rate for Personalized Recommendations
Enhancing Explicit and Implicit Feature Interactions via Information Sharing for Parallel Deep CTR Models
Progressive Layered Extraction (PLE): A Novel Multi-Task Learning (MTL) Model for Personalized Recommendations
TiSASRec: Time Interval Aware Self-Attention for Sequential Recommendation
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.