跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1171新增论文
+938其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 17:46各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 17:52 — 2026-11-19 17:52(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 17:46库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,410 已收录论文22,788 AI 相关8,343 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v2arXiv:2507.14121

Are Kolmogorov-Arnold Networks (KANs) Suitable for Imbalanced Data Classification?

Pankaj Yadav, Vivek Vijay

原文摘要

Kolmogorov-Arnold Networks (KANs) parameterize each connection as a learnable univariate B-spline, offering native feature-level interpretability. Whether this locality helps or hinders under class imbalance, where minority sparsity may leave spline edges without enough local observations to update reliably, remains unexamined. We evaluate KANs against capacity-matched Multilayer Perceptrons (MLPs) and XGBoost across ten imbalanced tabular datasets under three conditions: native class distribution, Focal Loss, and SMOTE-Tomek resampling, within a parameter-parity, two-phase framework. Under the native distribution, KAN spline activations collapse in minority-sparse regions, showing stronger majority-class bias than the matched MLP. Focal Loss yields negligible improvement, as it reweights gradients without providing the localized observations needed for discriminative curvature. Conversely, SMOTE-Tomek resampling lets spline activations recover structured minority-class representations, achieving the best cohort-wide rank and a large, statistically significant gain over unmitigated KANs, though not over resampled baselines. KAN's native spline interpretability directly reveals these dynamics via learned activation profiles, proving representational change rather than threshold recalibration without post-hoc attribution. However, these interpretability gains incur substantially higher training overhead than a parameter-matched MLP across all conditions, with no strategy-dependent latency reduction. Thus, KANs are conditionally suitable for imbalanced tabular classification: effective and interpretable with data-level resampling, yet costly relative to simpler alternatives without it.

cs.LG · cs.AI