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

📅 2026-09-15
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出了一种基于加权ANOVA核的总灵敏度核方法,通过从有限数据中学习和适应多变量结构来改进黑盒函数的输入-输出行为近似。
📝 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.
Problem

Research questions and friction points this paper is trying to address.

multivariable black-box function
limited data
input importance
interactions
Innovation

Methods, ideas, or system contributions that make the work stand out.

Total Sensitivity Kernels
Weighted ANOVA Kernels
Reproducing Kernel Hilbert Space
Minimum Norm Interpolation
J
John E. Darges
Department of Mathematics, Emory University
L
Laura Weidensager
Department of Mathematics, Simon Fraser University