- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Core-KAN, a relative-scale-conditioned continuous convolution operator. In detail, Core-KAN maps input features into a compact latent basis space and uses a lightweight scale controller to predict local scales relative to an operator-specific EMA reference, while a shared KAN-based generator represents depth-wise kernel bases as continuous coordinate functions on a fixed sampling grid. Instead of synthesizing independent kernels at every spatial location, it constructs a compact bank of scale-conditioned kernel responses at M supports and interpolates them according to the predicted local scale map, while an independent mixing controller combines the interpolated basis responses based on local content. Extensive evaluations on ImageNet-1K, COCO, and ADE20K demonstrate that Core-KAN consistently outperforms strong convolutional and dynamic-kernel baselines across classification, object detection, instance segmentation, and semantic segmentation tasks while introducing only marginal parameter overhead.
Critical strengths
-
Efficient Support-and-Interpolate Readout with Exact Local-Kernel Equivalence: Core-KAN constructs a compact bank of scale-conditioned kernel responses at M relative supports and interpolates them according to the predicted local scale map. By linearity in the kernel weights, this readout exactly applies the interpolated local kernel without materializing a separate kernel tensor at every position. Together with lightweight pointwise projections that confine spatially adaptive computation to an N-dimensional low-rank basis space, this design reduces generator coordinate queries.
-
Explicit Decoupling of Geometric Scale Adaptation and Content-Dependent Filtering: Core-KAN decouples spatial adaptation through a dual-control mechanism: a scale controller adapts kernel profiles through relative-scale coordinate queries calibrated by a non-learnable EMA reference, while an independent mixing controller combines basis responses according to local content. Kernel evolution and controller diagnostics demonstrate that the KAN learns smooth, basis-specific PCA trajectories rather than arbitrary discrete lookup tables, with locations closer to ground-truth boundaries exhibiting larger scale offsets and more concentrated basis mixtures.
-
Strong Parameter Efficiency and Consistent Empirical Gains Across Vision Benchmarks: Integrated into ResNet-50 on ImageNet-1K, Core-KAN achieves 81.45% top-1 accuracy with 26.61M parameters, delivering a 3.84% relative improvement over ResNet-50 with a parameter overhead of only 4.11%, and outperforming KernelWarehouse while using 73.92% fewer parameters.
Critical weaknesses
-
Complete Absence of Task-Level Ablations and Unverified Necessity of the 2D KAN Generator: The paper provides no task-level ablation studies to justify its core design choices, such as replacing the KAN generator with a parameter-matched MLP, removing the EMA reference , or varying the number of supports and bases . Furthermore, as acknowledged in Appendix C.4, the reported diagnostics are descriptive and do not isolate the causal contribution of either the scale controller or the mixing controller to task performance. Moreover, although the abstract claims that Core-KAN synthesizes spatial filters at arbitrary resolutions, all experiments fix the sampling grid to with fixed sampling offsets ; consequently, querying only evaluates 1D rays along the scalar scale without altering the physical receptive-field extent, leaving the necessity of a 2D continuous KAN representation unsubstantiated.
-
Omission of Computational Overhead Metrics (FLOPs, Memory, Latency) and Unaligned Baseline Comparisons: While the paper claims computational efficiency and marginal overhead, Tables 1–4 report only parameter counts (Params (M)) and omit FLOPs/MACs, peak GPU memory, and actual inference latency/throughput. And all experiments are restricted to a single backbone (ResNet-50), and Table 1 compares Core-KAN trained with an aggressive 300-epoch recipe against baselines with differing training recipes, which compromises the fairness of the ImageNet-1K comparison.
Questions for authors
-
Component & Generator Ablations: Can you provide task-level ablation results that isolate: (a) the KAN generator versus a parameter-matched MLP generator, (b) the individual causal contributions of the scale controller, the EMA reference, and the mixing controller, and (c) task performance under different support counts and basis dimensions?
-
Computational Cost & Latency: What are the exact FLOPs/MACs, peak GPU memory usage, and actual inference throughput (images/sec or latency in ms on your GPU) of Core-KAN compared with ResNet-50, ODConv, KernelWarehouse, and FDConv across Tables 1~4, including the specific breakdown of the controllers and the -support response bank?
-
Recipe Alignment & Arbitrary-Resolution Generalization: What is the ImageNet-1K validation accuracy of the vanilla ResNet-50 baseline when trained under the exact same recipe specified in Appendix B.3? In addition, since Core-KAN is formulated as a resolution-agnostic continuous kernel operator, how does it perform when synthesizing larger kernels or when integrated into lightweight and modern backbones?