资源分类
》 资源 》论文》Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms

Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms

2020-03-06 | |  89 |   43 |   0

Abstract

Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks.

上一篇：Scalable Gradient-Based Tuning of Continuous Regularization Hyperparameters

下一篇：A Random Matrix Approach to Echo-State Neural Networks

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...