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.
This work introduces a general kernel-based encoder-decoder framework for operator learning that separates observation, representation, learning, and reconstruction, and develops this framework for multi-input, multi-output operator learning, where operators map between products of potentially distinct function spaces.
Adrien Weihs, Chun-Yang Liao, Jingmin Sun et al.· 0 citations
This paper derives non-asymptotic quasi-optimality bounds governed by a regularized inverse Christoffel function associated with the gradient field and shows that additional smoothness of the gradient map yields sharper coherence estimates and motivates tractable importance sampling from kernel diagonal measures.
Fabio Nobile, Matteo Raviola, R. Tempone· 0 citations
A principled learned-kernel framework is established that unifies representation learning, kernel alignment, and Bayesian classification, and extends naturally to the multiclass setting.
Synthetic experiments show that FSNM recovers a low-rank density ratio and its leading spectral structure, and that the same learned kernel can answer multiple conditional queries without refitting.
Thiago Ramos, A. Frohlich, Daniela Perazzo et al.· 0 citations
This paper introduces a learning-based Local RBF Neural Network with Adaptively Supported Domain (Local RBF-ASD), which mitigates this sensitivity by adaptively adjusting the effective support domain within a differentiable training loop.
Zhen-Zhou Fan, M. Lei, Rui-Ping Niu et al.· Neural Networks· 0 citations
An amortized framework is proposed that consistently and substantially outperforms Silverman's rule, the Sheather--Jones selector, and least-squares cross-validation, with especially large gains in small and heterogeneous samples.
Junying Liang, Hailiang Du· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 27, 2026
Prabha Jha used her experience with MIT Open Learning’s program for senior executives to develop AI solutions for her employer, Verizon, and to write a book.
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.