Not-So-Random Features
2017-10-27ICLR 2018Code Available0· sign in to hype
Brian Bullins, Cyril Zhang, Yi Zhang
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/yz-ignescent/Not-So-Random-FeaturesOfficialIn paperpytorch★ 0
Abstract
We propose a principled method for kernel learning, which relies on a Fourier-analytic characterization of translation-invariant or rotation-invariant kernels. Our method produces a sequence of feature maps, iteratively refining the SVM margin. We provide rigorous guarantees for optimality and generalization, interpreting our algorithm as online equilibrium-finding dynamics in a certain two-player min-max game. Evaluations on synthetic and real-world datasets demonstrate scalability and consistent improvements over related random features-based methods.