Learning to learn kernels with variational random features

Open Access
Authors
Publication date 2020
Journal Proceedings of Machine Learning Research
Event The 37th International Conference on Machine Learning (ICML 2020)
Volume | Issue number 119
Pages (from-to) 11409-11419
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
We introduce kernels with random Fourier features in the meta-learning framework for few-shot learning. We propose meta variational random features (MetaVRF) to learn adaptive kernels for the base-learner, which is developed in a latent variable model by treating the random feature basis as the latent variable. We formulate the optimization of MetaVRF as a variational inference problem by deriving an evidence lower bound under the meta-learning framework. To incorporate shared knowledge from related tasks, we propose a context inference of the posterior, which is established by an LSTM architecture. The LSTM-based inference network can effectively integrate the context information of previous tasks with task-specific information, generating informative and adaptive features. The learned MetaVRF can produce kernels of high representational power with a relatively low spectral sampling rate and also enables fast adaptation to new tasks. Experimental results on a variety of few-shot regression and classification tasks demonstrate that MetaVRF delivers much better, or at least competitive, performance compared to existing meta-learning alternatives.
Document type Article
Note International Conference on Machine Learning, 13-18 July 2020, Virtual. - With supplementary file.
Language English
Published at https://doi.org/10.48550/arXiv.2006.06707
Published at http://proceedings.mlr.press/v119/zhen20a.html
Other links https://github.com/Yingjun-Du/MetaVRF
Downloads
zhen20a (Final published version)
Supplementary materials
Permalink to this page
Back