Built independently by an author, for readers. Read the story and support ChapterPal

topic

cubic spline (cubic splines)

A cubic spline is a piecewise curve constructed from third-degree polynomial segments that smoothly connects a sequence of data points. At each junction, known as a knot, adjacent segments share the same value, slope, and curvature, maintaining continuous first and second derivatives across the entire curve. In computer science, numerical analysis, and computer graphics, cubic splines are widely used for data interpolation, geometric modeling, computer-aided design, and motion path planning. They provide a computationally efficient and visually smooth representation of complex curves while avoiding the extreme oscillations associated with high-degree single polynomial interpolation.

3 items

Kolmogorov-Arnold Transformer

Kolmogorov-Arnold Transformer

Xingyi Yang, Xinchao Wang

OrganizationsNational University of Singapore

Why you should read this

Introduces the Kolmogorov-Arnold Transformer, which scales Kolmogorov-Arnold Networks within deep learning architectures by using GPU-friendly rational basis functions, group-level parameter sharing, and variance-preserving initialization to outperform standard MLP-based transformers.

Transformers stand as the cornerstone of mordern deep learning. Traditionally, these models rely on multi-layer perceptron (MLP) layers to mix the information between channels. In this paper, we introduce the Kolmogorov-Arnold Transformer (KAT), a novel architecture that replaces MLP layers with Kolmogorov-Arnold Network (KAN) layers to enhance the expressiveness and performance of the model. Integrating KANs into transformers, however, is no easy feat, especially when scaled up. Specifically, we identify three key challenges: (C1) Base function. The standard B-spline function used in KANs is not optimized for parallel computing on modern hardware, resulting in slower inference speeds. (C2) Parameter and Computation Inefficiency. KAN requires a unique function for each input-output pair, making the computation extremely large. (C3) Weight initialization. The initialization of weights in KANs is particularly challenging due to their learnable activation functions, which are critical for achieving convergence in deep neural networks. To overcome the aforementioned challenges, we propose three key solutions: (S1) Rational basis. We replace B-spline functions with rational functions to improve compatibility with modern GPUs. By implementing this in CUDA, we achieve faster computations. (S2) Group KAN. We share the activation weights through a group of neurons, to reduce the computational load without sacrificing performance. (S3) Variance-preserving initialization. We carefully initialize the activation weights to make sure that the activation variance is maintained across layers. With these designs, KAT scales effectively and readily outperforms traditional MLP-based transformers.

Added

2026-09-26