Adaptive Kernel Methods
Tam\'as D\'ozsa, Andrea Angino, Zolt\'an Szab\'o, J\'ozsef Bokor, Matthias Voigt

TL;DR
This paper introduces adaptive kernel methods with learnable parameters that depend on the dataset and loss function, enabling efficient large-scale nonlinear modeling beyond traditional fixed RKHS approaches.
Contribution
It proposes a new class of adaptive kernel methods with parameter-dependent solution spaces, improving efficiency and scalability for large datasets.
Findings
Efficient approximation of kernels for infinite-dimensional RKHSs.
Construction of fixed-dimensional, parameter-dependent solution spaces.
Demonstrated effectiveness through numerical experiments.
Abstract
Kernel methods approximate nonlinear maps in a data-driven manner by projecting the target map onto a finite-dimensional Hilbert space called the solution space. Traditionally, this space is a subspace of a fixed ambient reproducing kernel Hilbert space (RKHS), determined solely by the chosen kernel and the dataset, whose elements identify the basis elements. Consequently, the projection operator underlying the kernel method depends on the loss function, the dataset, and the choice of ambient RKHS. In this study, we consider kernel methods whose solution spaces also depend on learnable parameters that are independent of the dataset. The resulting methods can be viewed as variable projection operators that depend on the loss function, the dataset, and the new learnable parameters instead of a fixed RKHS. This work has two main contributions. First, we propose an efficient approximation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Model Reduction and Neural Networks · Numerical methods in inverse problems
