Factorization machines with regularization for sparse feature interactions
From MaRDI portal
Recommendations
- Bayesian feature interaction selection for factorization machines
- fastFM: a library for factorization machines
- Feature-aware regularization for sparse online learning
- Algorithms for estimating the parameters of factorisation machines
- Advantages of Using Factorisation Machines as a Statistical Modelling Technique
Cites work
- A coordinate gradient descent method for nonsmooth separable minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Adaptive subgradient methods for online learning and stochastic optimization
- An introduction to support vector machines and other kernel-based learning methods.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Learning to Rank for Information Retrieval
- Lectures on convex optimization
- Matching pursuits with time-frequency dictionaries
- Model Selection and Estimation in Regression with Grouped Variables
- Nonconvex Robust Low-Rank Matrix Recovery
- Optimization methods for large-scale machine learning
- Optimization with sparsity-inducing penalties
This page was built for publication: Factorization machines with regularization for sparse feature interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159426)
