arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02162cs.LG

通过上下文核回归实现可解释的表格基础模型

Interpretable Tabular Foundation Models via In-Context Kernel Regression

Amazon(亚马逊);AWS AI Labs(AWS人工智能实验室)

Ratmir Miftachov, Bruno Charron, Simon Valentin

AI总结:

KernelICL通过在最终层引入核函数,实现表格基础模型的可解释性,同时保持性能表现。

摘要:

表格基础模型如TabPFN和TabICL通过上下文学习实现了最先进的性能,但其架构仍然本质上是模糊的。我们引入了KernelICL,一种增强表格基础模型的框架,以提供可量化的基于样本的可解释性。基于上下文学习类似于核回归的洞察,我们通过将最终预测层替换为核函数(高斯、点积、kNN)来使这一机制显式化,使得每个预测都是训练标签的透明加权平均。我们引入了一个二维分类法,正式将标准核方法、现代基于邻居的方法和注意力机制统一在一个框架下,并通过训练样本上的权重分布的困惑度来量化可解释性。在55个TALENT基准数据集上,KernelICL实现了与现有表格基础模型相当的性能,证明了在最终层施加显式的核约束能够实现可解释的预测,而不会牺牲性能。

英文摘要:

Tabular foundation models like TabPFN and TabICL achieve state-of-the-art performance through in-context learning, yet their architectures remain fundamentally opaque. We introduce KernelICL, a framework to enhance tabular foundation models with quantifiable sample-based interpretability. Building on the insight that in-context learning is akin to kernel regression, we make this mechanism explicit by replacing the final prediction layer with kernel functions (Gaussian, dot-product, kNN) so that every prediction is a transparent weighted average of training labels. We introduce a two-dimensional taxonomy that formally unifies standard kernel methods, modern neighbor-based approaches, and attention mechanisms under a single framework, and quantify inspectability via the perplexity of the weight distribution over training samples. On 55 TALENT benchmark datasets, KernelICL achieves performance on par with existing tabular foundation models, demonstrating that explicit kernel constraints on the final layer enable inspectable predictions without sacrificing performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑