Skip to content
Preprint

A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure

Sep 2026 · 0 citations · 52 references
Computer Science Mathematics

TL;DR

This work introduces total sensitivity kernels (TSKs), a method based on families of weighted ANOVA kernels that learn and adapt to this multivariable structure, and establishes consistency of a finite-data formulation based on minimum-norm interpolation.

Abstract

Approximating the input-output behavior of a multivariable black-box function from limited data is challenging when blind to the importance of its inputs and their interactions. We introduce total sensitivity kernels (TSKs), a method based on families of weighted ANOVA kernels that learn and adapt to this multivariable structure. TSKs parameterize the weights on each multivariable component of the target function by factors for each input. We propose learning these factors directly from function evaluations by selecting the reproducing kernel Hilbert space (RKHS) in which the target function has minimum norm. Under suitable conditions, we show that this norm-minimization problem admits a unique solution, and we establish consistency of a finite-data formulation based on minimum-norm interpolation. The learned TSK factors characterize the participation of individual inputs across interactions and main effects, providing a kernel-dependent notion of input sensitivity related to total Sobol indices. Numerical experiments demonstrate that adapting the kernel to learned multivariable structure can substantially improve approximation accuracy over a standard product kernel.

View source

Similar papers

#machine learning Preprint Oct 2026

Bayesian Optimization on Function Spaces via Sparse RKHS Manifolds

Bayesian Optimization (BO) has become an established methodology for minimizing black-box functions of a vector input. Often, however, this parameter vector arises from the discretization of an inherently functional relationship. Several recent articles have considered the Functional Bayesian Optimization (FBO) setting...

Davide Sartor, Meghan E. Huber, Donghyun Kim et al. · 0 citations
Preprint Sep 2026

On the sample complexity of the active subspace method

Active subspaces identify low-dimensional linear structure in high-dimensional parameter-to-output maps by estimating the dominant eigenspace of a gradient covariance operator. In practice this covariance is replaced by a Monte Carlo estimator built from a limited number of gradient evaluations. Classical analyses base...

Fabio Nobile, Matteo Raviola, R. Tempone · 0 citations
#machine learning Preprint Oct 2026

Kernel Singular Value Decomposition with Extension to Multiple Data Sources

Kernel Singular Value Decomposition (KSVD) learns a pair of singular vectors w.r.t. an asymmetric kernel matrix, which can be induced by two data sources, e.g., the queries and keys in self-attention or the rows and columns of a given matrix. In this work, we extend KSVD to multiple data sources, namely eKSVD, which co...

Xin-Jie Zeng, Qing-Hua Tao, Johan A. K. Suykens · 0 citations
#machine learning Preprint Oct 2026

Conditional Kernel Stein Discrepancy

Kernel Stein discrepancies (KSDs) provide a versatile tool for comparing distributions. One of their main applications is in quantifying the goodness-of-fit (GoF) between a data-generating distribution and a prescribed target distribution. In this work, we study the related problem of conditional GoF quantification: gi...

Federico Matteucci, Florian Kalinke · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.