Convolutional Deep Kernel Machines
Edward Milsom, Ben Anson, Laurence Aitchison
摘要
Standard infinite-width limits of neural networks sacrifice the ability for intermediate layers to learn representations from data. Recent work ("A theory of representation learning gives a deep generalisation of kernel methods", Yang et al. 2023) modified the Neural Network Gaussian Process (NNGP) limit of Bayesian neural networks so that representation learning is retained. Furthermore, they found that applying this modified limit to a deep Gaussian process gives a practical learning algorithm which they dubbed the "deep kernel machine" (DKM). However, they only considered the simplest possible setting: regression in small, fully connected networks with e.g. 10 input features. Here, we introduce convolutional deep kernel machines. This required us to develop a novel inter-domain inducing point approximation, as well as introducing and experimentally assessing a number of techniques not previously seen in DKMs, including analogues to batch normalisation, different likelihoods, and different types of top-layer. The resulting model trains in roughly 77 GPU hours, achieving around 99% test accuracy on MNIST, 72% on CIFAR-100, and 92.7% on CIFAR-10, which is SOTA for kernel methods. Published as a conference paper at ICLR 2024 Convolutional DGPs use inducing patches for scalability (van der Wilk et al., 2017; Blomqvist et al., 2018; Dutordoir et al., 2020) . However, we cannot use their scheme here, as it requires features at each layer, while we work solely with Gram matrices. Therefore we were forced to develop a new scheme. Our DKM inducing point scheme is inter-domain (Lázaro-Gredilla & Figueiras-Vidal, 2009; Hensman et al., 2017; Rudner et al., 2020) , in the sense that the inducing points do not mirror datapoints (images), but instead store information about the function in a different domain. Existing work on inter-domain inducing points does not address the DKM or convolutional settings. An alternative approach to getting a flexible kernel is to take the inputs, transform them through a NN (e.g. 10-40 layer CNN), then to use the outputs of the NN as inputs to a standard kernel. This approach is known as deep kernel learning (DKL;
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- The Empirical Impact of Neural Parameter Symmetries, or Lack ThereofDerek Lim, Theo (Moe) Putterman, Robin Walters, Haggai Maron 等NeurIPS 2024 · 被引用 25 次
- A theory of representation learning gives a deep generalisation of kernel methodsAdam X. Yang, Maxime Robeyns, Edward Milsom, Ben Anson 等ICML 2023 · 被引用 15 次
- Stochastic Kernel Regularisation Improves Generalisation in Deep Kernel MachinesEdward Milsom, Ben Anson, Laurence AitchisonNeurIPS 2024 · 被引用 1 次
它引用的顶会 Paper14
- Finite Versus Infinite Neural Networks: an Empirical StudyJaehoon Lee, Samuel S. Schoenholz, Jeffrey Pennington, Ben Adlam 等NeurIPS 2020 · 被引用 245 次
- Finite Depth and Width Corrections to the Neural Tangent KernelBoris Hanin, Mihai NicaICLR 2020 · 被引用 169 次
- Asymptotics of Wide Networks from Feynman DiagramsEthan Dyer, Guy Gur-AriICLR 2020 · 被引用 127 次
- Neural Kernels Without TangentsVaishaal Shankar, Alex Fang, Wenshuo Guo, Sara Fridovich-Keil 等ICML 2020 · 被引用 93 次
- Why bigger is not always better: on finite and infinite neural networksLaurence AitchisonICML 2020 · 被引用 59 次
相关 Paper
- Deep Kernel ProcessesLaurence Aitchison, Adam X. Yang, Sebastian W. OberICML 2021 · 被引用 44 次
- Fast Neural Kernel Embeddings for General ActivationsInsu Han, Amir Zandieh, Jaehoon Lee, Roman Novak 等NeurIPS 2022 · 被引用 26 次
- Adaptive kernel predictors from feature-learning infinite limits of neural networksClarissa Lauditi, Blake Bordelon, Cengiz PehlevanICML 2025
- A variational approximate posterior for the deep Wishart processSebastian W. Ober, Laurence AitchisonNeurIPS 2021 · 被引用 11 次
- Global inducing point variational posteriors for Bayesian neural networks and deep Gaussian processesSebastian W. Ober, Laurence AitchisonICML 2021 · 被引用 65 次
