mlsanityData to 7 Oct 2026

Meta-learning for Matrix Factorization without Shared Rows or Columns

arXiv 2106.15133 ↗First posted 29 Jun 2021stat.ML cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose a method that meta-learns a knowledge on matrix factorization from various matrices, and uses the knowledge for factorizing unseen matrices. The proposed method uses a neural network that takes a matrix as input, and generates prior distributions of factorized matrices of the given matrix. The neural network is meta-learned such that the expected imputation error is minimized when the factorized matrices are adapted to each matrix by a maximum a posteriori (MAP) estimation. We use a gradient descent method for the MAP estimation, which enables us to backpropagate the expected imputation error through the gradient descent steps for updating neural network parameters since each gradient descent step is written in a closed form and is differentiable. The proposed method can meta-learn from matrices even when their rows and columns are not shared, and their sizes are different from each other. In our experiments with three user-item rating datasets, we demonstrate that our proposed method can impute the missing values from a limited number of observations in unseen matrices after being trained with different matrices.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 58 references that are in the map. First posted on arXiv 29 Jun 2021.

Builds on

22 of 58 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2017Deep Setscited by 1,394
  6. 2016Learning to learn by gradient descent by gradient descentcited by 616
  7. 2018Meta-Learning with Latent Embedding Optimizationcited by 476
  8. 2019Meta-Learning with Differentiable Convex Optimizationcited by 461
  9. 2018Conditional Neural Processescited by 421
  10. 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
  11. 2019Attentive Neural Processescited by 280
  12. 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
10 more
  1. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
  2. 2016Towards a Neural Statisticiancited by 119
  3. 2018Deep Models of Interactions Across Setscited by 68
  4. 2019Hierarchically Structured Meta-learningcited by 67
  5. 2016One-Shot Generalization in Deep Generative Modelscited by 44
  6. 2019MetaFun: Meta-Learning with Iterative Functional Updatescited by 34
  7. 2017Few-shot Autoregressive Density Estimation: Towards Learning to Learn Distributionscited by 24
  8. 2018The Variational Homoencoder: Learning to learn high capacity generative models from few examplescited by 23
  9. 2017Variational Memory Addressing in Generative Modelscited by 17
  10. 2015Tensor Factorization via Matrix Factorizationcited by 15

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.