Kernel Methods
Overview
Kernel methods represent data through similarity functions, allowing linear algorithms in feature spaces to model nonlinear patterns without explicitly constructing those spaces. Common approaches include support vector machines and kernel ridge regression for prediction, Gaussian processes for uncertainty, and kernel mean embeddings and maximum mean discrepancy for comparing distributions and testing dependence. Researchers also use kernels to learn dynamical systems and operators, and scale computations with random features, Nyström approximations, and structured kernels. A central tension is balancing expressive, well-chosen kernels and reliable guarantees against the computation and sensitivity to kernel or bandwidth selection that can limit practical use.
Latest papers
253 papers25 papers in the last four weeks, down 22% on the four weeks before. 0.2% of all new papers.
Benign Overfitting with Quantum Kernels
Data-Efficient Kernel Methods for Learning Differential Equations and Their Solution Operators: Algorithms and Error Analysis
A Mechanistic Interpretation of Prescribed-Parameter Convolutional Kernels
Optimal Kernel Learning for Gaussian Process Models with High-Dimensional Input
active variables''. We propose an optimal kernel learning approach to identify these active variables, thereby overcoming GP model limitations and enhancing system understanding. Our method approximates the original GP model's covariance function through a convex combination of kernel functions, each utilizing low-dimensional subsets of input variables. Inspired by the Fedorov-Wynn algorithm from optimal design literature, we develop an optimal kernel learning algorithm to determine this approximation. We incorporate the effect heredity principle, a concept borrowed from the field of design and analysis of experiments'', to facilitate efficient computation. Through several examples, we demonstrate that the proposed method provides competitive prediction and variable selection, with favorable computational performance in the examples considered. It is an effective solution for interpreting the surrogate GP regression and simplifying the complex underlying system.Physics-Informed Support Vector Kernels via Green-Function Analogies and Jackson-Chebyshev Spectral Design
Fixed-Gaussian Spectral Algorithms: Minimax Optimal Rates for Misspecified Learning and Transfer
Conditional Moment Kernels: Joint Modeling of Expected Returns and Covariances in Unbalanced Panels
Which Spaces can be Embedded in -type Reproducing Kernel Banach Space? A Characterization via Metric Entropy
Improved Finite-Particle Convergence Rates for Stein Variational Gradient Descent
negative part' proportional to $N$ times the expected $\mathsf{KSD}^2$ and a smaller positive part'. This observation leads to rates of order , in both continuous and discrete time, providing a near optimal (in the sense of matching the corresponding i.i.d. rates) double exponential improvement over the recent result by Shi and Mackey (2024). Under mild assumptions on the kernel and potential, these bounds also grow polynomially in the dimension . By adding a bilinear component to the kernel, the above approach is used to further obtain Wasserstein-2 convergence in continuous time. For the case of `bilinear + Matérn' kernels, we derive Wasserstein-2 rates that exhibit a curse-of-dimensionality similar to the i.i.d. setting. We also obtain marginal convergence and long-time propagation of chaos results for the time-averaged particle laws.