Research map / Label-efficient and robust learning / Recognition and long-tail
Factorization Machines with Regularization for Sparse Feature Interactions
Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use TI regularizer instead of L1 or L21 proximal operators | sparse FMs · Proximal operator comparison | sparsity of feature interaction matrix | Improved |
| use TI regularizer (interaction-level sparsity) | sparse FMs · Proximal operator comparison | number of used features: 200 for all lambda in 2^-7 ... 2^7 | Improved |
| use CS regularizer instead of TI or existing regularizers for feature selection | sparse FMs · Proximal operator comparison | number of used features | Improved |
Closest papers by meaning
- fastFM: A Library for Factorization Machines (JMLR 2016 · similarity 0.88)
- Higher-Order Factorization Machines (NeurIPS 2016 · similarity 0.87)
- Accurate and Interpretable Factorization Machines (AAAI 2019 · similarity 0.87)
- Interaction-Aware Factorization Machines for Recommender Systems (AAAI 2019 · similarity 0.86)
- Towards Hybrid-grained Feature Interaction Selection for Deep Sparse Network (NeurIPS 2023 · similarity 0.86)
- Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetries (ICLR 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
