Draining Fictitious Knots: Restoring Distance-Awareness Guarantees for High-Dimensional Spline Networks

• URL: http://arxiv.org/abs/2609.15274v1
• Date: Mon, 14 Sep 2026 09:34:31 GMT
• Title: Draining Fictitious Knots: Restoring Distance-Awareness Guarantees for High-Dimensional Spline Networks
• Abstract summary: Distance-Aware Error for Kolmogorov Networks (DAREK) introduces a computationally efficient bottom-up approach to uncertainty quantification.<n>In high-dimensional settings, the theoretical guarantees can be weakened by the emergence of fictitious knots.<n>We propose a drainage uncertainty mechanism that restores distance-awareness by constructing a monotonically decreasing uncertainty path from any fictitious knot region toward the nearest real knot.
• Score: 3.460138063155115
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Kolmogorov-Arnold Networks (KANs) with spline activations have recently shown promise for interpretable function approximation. Distance-Aware Error for Kolmogorov Networks (DAREK) introduces a computationally efficient bottom-up approach to uncertainty quantification by equipping KANs with distance-aware error bounds; yet, in high-dimensional settings, the theoretical guarantees can be weakened by the emergence of fictitious knots. Inspired by the Kolmogorov-Arnold representation theorem, DAREK adopts a componentwise formulation in which each input dimension is treated separately; as a result, induced knot locations may appear in the combined input space without corresponding to actual training data. These fictitious knots mislead the DAREK uncertainty estimator into reporting low uncertainty far from any real observation, violating the distance-awareness guarantee. We identify this failure mode precisely, characterize its geometric structure, and propose a drainage uncertainty mechanism that restores distance-awareness by constructing a monotonically decreasing uncertainty path from any fictitious knot region toward the nearest real knot. The proposed drainage method provides a practical heuristic correction that mitigates the fictitious-knot failure mode while restoring theoretical distance-awareness in high-dimensional settings. Experiments on a 2D synthetic benchmark and a 100-dimensional face dataset show that drainage raises sampled distance-awareness (SDA) from 85% to 98-99%, matching Gaussian processes at lower computational cost.

Related papers

• Robust conditional dimension reduction for dissimilarity data [2.361342322155422]
  Conditional MultidimensionalScaling (cMDS) is a cDR technique that works directly with dissimilarity data.<n>We proposed Robust Multidimensional Scaling (rcMDS) by replacing the squared-stress criterion with a Fair M-estimation objective.<n>We developed a reweighted conditional SMACOF algorithm to optimize this objective.
  arXiv  Detail & Related papers  (2026-09-05T22:36:29Z)
• Semi-Supervised Conditional Generative Learning through Stochastic Interpolation and Sufficient Representations [12.299177496689621]
  We propose a semi-supervised framework combining conditional intrinsic with low-dimensional latent representations.<n>RepG decomposes generation into two stages: label-dependent latent sampling and high-dimensional reconstruction.
  arXiv  Detail & Related papers  (2026-07-18T09:21:53Z)
• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Trajectory-Anchor Optimization for Overconfident Thermal Visual Place Recognition: Zero-Leakage OOD Auditing and Kidnapped-Robot Recovery [3.9929096403817255]
  Trajectory-Anchor Optimization (TAO) is an efficient fail-safe filter at a macro-scale.<n>Within a 5m radius, hallucinations often possess a locally consistent geometry that deceives rigid alignment.<n>TAO establishes a distinct convergence basin (10m) where multi-view consistency reliably isolates catastrophic topological breaks.
  arXiv  Detail & Related papers  (2026-07-06T07:31:37Z)
• Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations [13.626248090879235]
  This paper establishes a theoretical framework for the uniform convergence of smoothly activated deep neural network (DNN) estimators.<n>We prove that smooth DNNs can mitigate the curse of dimensionality in uniform convergence by adaptively exploiting the low-dimensional hierarchical composition structure of the target function.
  arXiv  Detail & Related papers  (2026-06-04T02:24:50Z)
• On the Equivalence of Random Network Distillation, Deep Ensembles, and Bayesian Inference [7.0479705178500085]
  Random network distillation is a technique that measures novelty via prediction errors against a fixed random target.<n>While empirically effective, it has remained unclear what uncertainties RND measures and how its estimates relate to other approaches.<n>This paper establishes these missing theoretical connections by analyzing RND within the neural tangent kernel framework in the limit of infinite network width.
  arXiv  Detail & Related papers  (2026-02-23T15:28:27Z)
• Enabling Uncertainty Estimation in Iterative Neural Networks [49.56171792062104]
  We develop an approach to uncertainty estimation that provides state-of-the-art estimates at a much lower computational cost than techniques like Ensembles.<n>We demonstrate its practical value by embedding it in two application domains: road detection in aerial images and the estimation of aerodynamic properties of 2D and 3D shapes.
  arXiv  Detail & Related papers  (2024-03-25T13:06:31Z)
• NUQ: Nonparametric Uncertainty Quantification for Deterministic Neural Networks [151.03112356092575]
  We show the principled way to measure the uncertainty of predictions for a classifier based on Nadaraya-Watson's nonparametric estimate of the conditional label distribution. We demonstrate the strong performance of the method in uncertainty estimation tasks on a variety of real-world image datasets.
  arXiv  Detail & Related papers  (2022-02-07T12:30:45Z)
• Robust Estimation for Nonparametric Families via Generative Adversarial Networks [92.64483100338724]
  We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
  arXiv  Detail & Related papers  (2022-02-02T20:11:33Z)
• On the Minimal Adversarial Perturbation for Deep Neural Networks with Provable Estimation Error [65.51757376525798]
  The existence of adversarial perturbations has opened an interesting research line on provable robustness. No provable results have been presented to estimate and bound the error committed. This paper proposes two lightweight strategies to find the minimal adversarial perturbation. The obtained results show that the proposed strategies approximate the theoretical distance and robustness for samples close to the classification, leading to provable guarantees against any adversarial attacks.
  arXiv  Detail & Related papers  (2022-01-04T16:40:03Z)
• Uncertainty-Aware Deep Calibrated Salient Object Detection [74.58153220370527]
  Existing deep neural network based salient object detection (SOD) methods mainly focus on pursuing high network accuracy. These methods overlook the gap between network accuracy and prediction confidence, known as the confidence uncalibration problem. We introduce an uncertaintyaware deep SOD network, and propose two strategies to prevent deep SOD networks from being overconfident.
  arXiv  Detail & Related papers  (2020-12-10T23:28:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.