Pith. sign in

REVIEW 1 cited by

Conformalized-KANs: Uncertainty Quantification with Coverage Guarantees for Kolmogorov-Arnold Networks (KANs) in Scientific Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.15240 v1 pith:L5C6M6YW submitted 2025-04-21 cs.LG

classification cs.LG
keywords kanspredictionconformalconformalized-kanscoverageintervalskolmogorov-arnoldlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper explores uncertainty quantification (UQ) methods in the context of Kolmogorov-Arnold Networks (KANs). We apply an ensemble approach to KANs to obtain a heuristic measure of UQ, enhancing interpretability and robustness in modeling complex functions. Building on this, we introduce Conformalized-KANs, which integrate conformal prediction, a distribution-free UQ technique, with KAN ensembles to generate calibrated prediction intervals with guaranteed coverage. Extensive numerical experiments are conducted to evaluate the effectiveness of these methods, focusing particularly on the robustness and accuracy of the prediction intervals under various hyperparameter settings. We show that the conformal KAN predictions can be applied to recent extensions of KANs, including Finite Basis KANs (FBKANs) and multifideilty KANs (MFKANs). The results demonstrate the potential of our approaches to improve the reliability and applicability of KANs in scientific machine learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Exit Kolmogorov-Arnold Networks: enhancing accuracy and parsimony

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Augmenting Kolmogorov-Arnold Networks with prediction exits at each layer improves accuracy and often yields more parsimonious models, and a differentiable learning-to-exit algorithm automates the choice of exit weights.

Pith tools