Core-KAN: Continuous Vision Kernels with Kolmogorov-Arnold Networks

• URL: http://arxiv.org/abs/2608.19817v1
• Date: Thu, 20 Aug 2026 09:12:42 GMT
• Title: Core-KAN: Continuous Vision Kernels with Kolmogorov-Arnold Networks
• Abstract summary: Continuous Relative-scale KAN (Core-KAN) is a relative-scale-conditioned continuous convolution operator.<n>A KAN-based generator represents depth-wise kernel bases as continuous coordinate functions.<n>It constructs a compact bank of scale-conditioned kernel responses and interpolates them according to the predicted local scale map.
• Score: 7.056931885879462
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conventional convolutional kernels are typically defined on fixed discrete grids, limiting their ability to accommodate heterogeneous local structures. Existing adaptive operators improve flexibility but often couple geometric scale variation with content-dependent filtering, while incurring high computational cost from per-location kernel generation. To decouple geometric scale adaptation from content-dependent filtering while avoiding expensive per-location kernel generation, we propose Continuous Relative-scale KAN (Core-KAN), a relative-scale-conditioned continuous convolution operator. Core-KAN maps input features into a compact latent basis space and uses a lightweight scale controller to predict local scales relative to an exponential moving average reference. A KAN-based generator represents depth-wise kernel bases as continuous coordinate functions, allowing the operator to synthesize spatial filters at arbitrary resolutions rather than being confined to a fixed lattice. Instead of synthesizing independent kernels at every location, it constructs a compact bank of scale-conditioned kernel responses and interpolates them according to the predicted local scale map. An independent mixing controller further combines the interpolated basis responses based on local content, explicitly decoupling geometric scale adaptation from content-dependent filtering. Together with lightweight pointwise projections, this design forms a low-rank dynamic convolution that scales efficiently with kernel size and integrates readily into hierarchical vision backbones. Experiments across three representative vision tasks show Core-KAN consistently outperforms strong convolutional and dynamic-kernel baselines with only marginal parameter and computational overhead, offering an efficient, general framework for continuous, scale-adaptive convolution.

Related papers

• Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control [21.938486689664856]
  We propose a choice of scale to make the spectral complexity of the kernel consistent with the intrinsic complexity of the underlying manifold.<n>We evaluate SSL embeddings from six encoders on CIFAR-100, showing that adaptive bandwidth consistently improves leave-one-out (LOO) classification and label propagation (LP) accuracy.
  arXiv  Detail & Related papers  (2026-09-03T02:57:28Z)
• 3D Skew-Normal Splatting [36.91264690191168]
  3D Gaussian Splatting (3DGS) has emerged as a leading representation for real-time novel view synthesis.<n>We propose Skew-Normal Splatting (SNS), which adopts the Azzalini Skew-Normal distribution as the fundamental primitive.<n>SNS consistently improves reconstruction quality over Gaussian and recent non-Gaussian kernels.
  arXiv  Detail & Related papers  (2026-05-14T16:10:41Z)
• Faster 3D Gaussian Splatting Convergence via Structure-Aware Densification [52.517763621139956]
  3D Gaussian Splatting has emerged as a powerful scene representation for real-time novel-view synthesis.<n>Standard adaptive density control relies on screen-space positional gradients.<n>We present a structure-aware densification framework for 3D Gaussian Splatting.
  arXiv  Detail & Related papers  (2026-04-30T15:37:20Z)
• Partition-of-Unity Gaussian Kolmogorov-Arnold Networks [0.0]
  We introduce the partition-of-unity Gaussian KAN (PU-GKAN) in which the Gaussian basis values on each edge are divided by their local sum over fixed centers.<n>This produces a partition-of-unity feature map with trainable coefficients, while preserving the standard edge-based KAN structure.<n> Numerical experiments show that PU-GKAN reduces sensitivity to (), improves validation accuracy for most smooth and moderately non-smooth targets, and gives more stable training behavior.
  arXiv  Detail & Related papers  (2026-04-26T08:24:03Z)
• PKINet-v2: Towards Powerful and Efficient Poly-Kernel Remote Sensing Object Detection [73.05827565991488]
  PKINet-v2 synergizes anisotropic axial-strip convolutions with isotropic square kernels and builds a multi-scope receptive field.<n>PKINet-v2 achieves state-of-the-art accuracy while delivering a $bf3.9times$ FPS acceleration compared to PKINet-v1.
  arXiv  Detail & Related papers  (2026-03-17T10:17:58Z)
• ReHARK: Refined Hybrid Adaptive RBF Kernels for Robust One-Shot Vision-Language Adaptation [3.8707695363745214]
  ReHARK is a training-free framework that reinterprets few-shot adaptation through global proximal regularization.<n>A new state-of-the-art for one-shot adaptation is established by ReHARK, which achieves an average accuracy of 65.83%.
  arXiv  Detail & Related papers  (2026-03-12T04:59:09Z)
• SGDC: Structurally-Guided Dynamic Convolution for Medical Image Segmentation [12.762805574920629]
  We propose a novel Structure-Guided Dynamic Convolution (SGDC) mechanism.<n>The proposed design effectively prevents the information loss introduced by average pooling.<n>It achieves state-of-the-art performance on ISIC 2016, PH2, ISIC 2018, and CoNIC datasets.
  arXiv  Detail & Related papers  (2026-02-26T20:59:51Z)
• SONIC: Spectral Oriented Neural Invariant Convolutions [0.0]
  Convolutional Neural Networks (CNNs) rely on fixed-size kernels scanning local patches.<n>ViTs provide global connectivity but lack spatial inductive bias, depend on explicit positional encodings, and remain tied to the initial patch size.<n>We introduce SONIC, a continuous spectral parameterisation that models convolutional operators using a small set of shared, orientation-selective components.
  arXiv  Detail & Related papers  (2026-01-27T18:51:11Z)
• Dynamic Kernel-Based Adaptive Spatial Aggregation for Learned Image Compression [63.56922682378755]
  We focus on extending spatial aggregation capability and propose a dynamic kernel-based transform coding. The proposed adaptive aggregation generates kernel offsets to capture valid information in the content-conditioned range to help transform. Experimental results demonstrate that our method achieves superior rate-distortion performance on three benchmarks compared to the state-of-the-art learning-based methods.
  arXiv  Detail & Related papers  (2023-08-17T01:34:51Z)
• Local Sample-weighted Multiple Kernel Clustering with Consensus Discriminative Graph [73.68184322526338]
  Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a set of base kernels. This paper proposes a novel local sample-weighted multiple kernel clustering model. Experimental results demonstrate that our LSWMKC possesses better local manifold representation and outperforms existing kernel or graph-based clustering algo-rithms.
  arXiv  Detail & Related papers  (2022-07-05T05:00:38Z)
• X-volution: On the unification of convolution and self-attention [52.80459687846842]
  We propose a multi-branch elementary module composed of both convolution and self-attention operation. The proposed X-volution achieves highly competitive visual understanding improvements.
  arXiv  Detail & Related papers  (2021-06-04T04:32:02Z)
• Flow-based Kernel Prior with Application to Blind Super-Resolution [143.21527713002354]
  Kernel estimation is generally one of the key problems for blind image super-resolution (SR) This paper proposes a normalizing flow-based kernel prior (FKP) for kernel modeling. Experiments on synthetic and real-world images demonstrate that the proposed FKP can significantly improve the kernel estimation accuracy.
  arXiv  Detail & Related papers  (2021-03-29T22:37:06Z)

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.