A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure
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.
Related
- LoCCA: Localized Chebyshev Cross Approximation for Kernel Matrix Factorization via Nodal Perturbation Stability
- High-order smoothness and high-order collocation approximation for Volterra integral equation with multiscale and nonlinear exponent kernel
- Hermite Spectra and Kernel Factorization for Gaussian-Weighted Tests of Normality
- Mapping for Approximation: A Unified View of Rescaled, Variably Scaled and Rational Kernel Methods
- Uniqueness sets in weighted ℓ2-spaces via simultaneous approximation
BibTeX
@misc{darges2026weighted,
title = {{A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure}},
author = {John E. Darges and Laura Weidensager},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.16606},
eprint = {2609.16606},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.16606},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure
AU - John E. Darges
AU - Laura Weidensager
PY - 2026
DA - 2026/09/25
PB - arXiv
DO - 10.48550/arxiv.2609.16606
UR - https://arxiv.org/abs/2609.16606
AB - 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.
ER -