π kanx
Production-grade Kolmogorov-Arnold Networks
TensorFlow + PyTorch + ONNX β one library, four surfaces.
pip install kanxΒ· A small KAN beats a 10Γ larger MLP on smooth, separable targets β honest, param-matched benchmark below. One library. Two backends. Real ONNX export. Docker + Kubernetes ready. Prometheus metrics, TensorBoard logging, Hub and symbolic extras are now implemented.
β‘ The 30-second magic moment#
import kanx
# Build, train, predict β in one call. No config files. No compile dance.
model = kanx.quickstart() # trains on synthetic 2-D data
model.predict([[0.5, 0.2]]) # β array([[1.04β¦]])
β οΈ Grid calibration β two methods
KANs use B-splines on a fixed input range (default
[-1, 1]). If your inputs fall outside that range, the spline path silently returns zero and you only get the SiLU residual. Fix it one of two ways:Static approach (pre-training):
from kanx import KAN, fit_grid_to_data model = KAN([n_features, 64, 1]) fit_grid_to_data(model, X_train) # one-time grid fit model.fit(X_train, y_train, epochs=30)Adaptive approach (during training β recommended):
model = KAN([n_features, 64, 1]) model.fit(X_train, y_train, epochs=15) model.update_grid_from_samples(X_train) # β refine grid based on data model.fit(X_train, y_train, epochs=15) # continue training
kanx.check_input_range(model, X)will log a warning at inference if input exceeds the grid.
Want more control? Same simplicity, your data:
from kanx import KAN
import numpy as np
X = np.random.uniform(-1, 1, (1024, 2)).astype("float32")
y = np.sin(np.pi * X[:, :1]) + X[:, 1:2] ** 2
model = KAN([2, 64, 1])
model.fit(X, y, epochs=30, verbose=0) # auto-compiles with Adam+MSE
model.predict(X[:3])
π₯ PyTorch? Same API.#
from kanx.torch import KAN
import torch
model = KAN([2, 64, 1])
X = torch.randn(1024, 2); y = torch.sin(torch.pi * X[:, :1])
model.fit(X, y, epochs=30, lr=1e-2) # one-liner, same semantics
model.predict([[0.5, 0.2]])
β‘ GPU-optimized MatrixKAN#
For higher throughput on accelerators, use the vectorized MatrixKAN (replaces recursion with batched GEMM):
from kanx.torch import MatrixKAN
model = MatrixKAN([4, 32, 1]) # same interface as KAN
model.fit(X, y, epochs=30) # ~1.5β2Γ faster on GPU vs standard KAN
π¦ Installation#
pip install kanx # core (TensorFlow)
pip install "kanx[torch]" # +PyTorch backend
pip install "kanx[onnx]" # +tf2onnx + onnxruntime
pip install "kanx[api]" # +FastAPI service
pip install "kanx[hub]" # +HuggingFace Hub integration
pip install "kanx[symbolic]" # +Symbolic regression hooks
pip install "kanx[all]" # everything (api + torch + onnx + hub + symbolic + dev + docs)
Optional extras:
* kanx[api] adds FastAPI serving with /metrics Prometheus scraping.
* kanx[torch] adds the PyTorch backend, MatrixKAN, and symbolic helpers.
* kanx[hub] adds push_to_hub() / from_pretrained() for HuggingFace integration.
* kanx[symbolic] adds SymbolicFitter for post-hoc edge function extraction.
β Open in Colab: Train a KAN in 2 minutes
π Benchmarks (reproducible, fair, multi-baseline)#
Synthetic 2-D regression target y = sin(ΟΒ·xβ) + cos(2ΟΒ·xβ),
100 epochs, Adam(lr=1e-2), batch=128, CPU.
| Model | Params | Train (s) | Infer 4k (ms) | Test MSE |
|---|---|---|---|---|
| KAN[2,16,1] | 432 | 12.50 | 68.64 | 2.14 Γ 10β»β΅ |
| KAN[2,32,1] | 864 | 16.62 | 25.52 | 4.44 Γ 10β»β΄ |
| MLP[2,32,1] | 129 | 5.07 | 6.17 | 4.61 Γ 10β»ΒΉ (undersized) |
| MLP[2,16,16,1] | 337 | 5.46 | 4.08 | 1.60 Γ 10β»Β³ |
| MLP[2,64,64,1] | 4 417 | 6.00 | 5.74 | 5.51 Γ 10β»β΄ |
Honest read. The smallest KAN (432 params) wins on this smooth separable target. The same KAN is ~10β15Γ slower at inference than a same-MSE MLP because each edge does a B-spline evaluation. On non-smooth or high-dimensional targets, this picture often reverses. We do not claim KANs are universally better than MLPs.
Reproduce with python benchmarks/compare_mlp.py (quick, 100 epochs) or
python benchmarks/compare_mlp.py --long (1000 epochs + early-stopping).
π§ How kanx compares to other KAN libraries#
| pykan | efficient-kan | mlx-kan | kanx | |
|---|---|---|---|---|
| Framework | PyTorch | PyTorch | MLX (Apple Silicon) | TF + PyTorch |
| Vectorized B-spline | partial | β | β | β |
| ONNX export | β | β | β | β both backends |
| REST API service | β | β | β | β FastAPI |
| Docker + K8s | β | β | β | β |
| Property-based tests | β | β | β | β Hypothesis |
| Test coverage | research | research | research | 94% |
| PyPI | β | β | β | β |
| CI/CD release pipeline | β | β | β | β PyPI + GHCR + Pages |
kanx is the only KAN library purpose-built for production deployment.
Research-y libs are great for novel experiments; kanx is what you ship.
π REST API#
| Method | Path | Purpose |
|---|---|---|
GET |
/api/health |
Liveness + model load source |
GET |
/api/info |
Version + TF/Torch + model summary |
GET |
/metrics |
Prometheus scrape endpoint |
POST |
/api/predict |
Inference (single or batch) |
POST |
/api/load |
Hot-swap checkpoint |
POST |
/api/reset |
Re-init from KANX_CONFIG |
curl -X POST http://localhost:8000/api/predict \
-H 'content-type: application/json' \
-d '{"x": [[0.1, -0.2], [0.5, 0.7]]}'
The startup contract loads KANX_CHECKPOINT if it exists, otherwise falls
back to a fresh model built from KANX_CONFIG. Boundaries are validated:
wrong feature count β 400, oversized batch β 413, missing checkpoint β 404.
π ONNX export#
# From PyTorch
from kanx.torch import KAN, export_onnx
model = KAN([2, 64, 1])
export_onnx(model, "kan.onnx")
# From TensorFlow
from kanx import KAN, export_onnx_tf
import tensorflow as tf
model = KAN([2, 64, 1]); model(tf.zeros((1, 2)))
export_onnx_tf(model, "kan.onnx")
β Dynamic batch β Verified numerical consistency (1e-5) β Works with ONNX Runtime / TensorRT / OpenVINO
π³ Docker / βΈοΈ Kubernetes#
docker run --rm -p 8000:8000 ghcr.io/mattral/kanx:latest
kubectl apply -f k8s/ # Deployment + Service + Ingress + HPA + PVC
K8s manifests ship with rolling updates, readiness/liveness probes on
/api/health, an HPA (2 β 10 replicas, CPU-target 70%) and a PVC for the
model registry.
π οΈ CLI#
python -m kanx info # versions
python -m kanx train --config configs/default.yaml # train
python -m kanx predict --checkpoint model.keras --input X.json
π Documentation#
β https://mattral.github.io/KANX/ (MkDocs Material)
| Page | What's inside |
|---|---|
| Quickstart | Train your first KAN in 60 seconds |
| Architecture | Package layout, module contracts |
| System Design | Serving topology, scaling, failure modes |
| REST API | Endpoint reference + curl examples |
| Testing | Test pyramid, numerical invariants |
| Deployment | CI/CD, rollout, observability |
| Benchmarks | KAN vs MLP β methodology + numbers |
π Research Paper#
If you use kanx in academic work, please cite both the original paper and the library. Our work is formally documented and available as a preprint:
- π Title: Bridging Theory and Practice with KANX
- π DOI: https://doi.org/10.5281/zenodo.20430883
- π Zenodo: https://zenodo.org/records/20430883
- π Read Paper (preprint)
Citation#
@article{mattral2026kanx,
title={Bridging Theory and Practice with KANX},
author={Myet, Min Htet},
year={2026},
doi={10.5281/zenodo.20430883},
publisher={Zenodo}
}
@article{liu2024kan,
title = {KAN: Kolmogorov-Arnold Networks},
author = {Liu, Ziming and Wang, Yixuan and Vaidya, Sachin and Ruehle,
Fabian and Halverson, James and SoljaΔiΔ, Marin and
Hou, Thomas Y. and Tegmark, Max},
journal = {arXiv preprint arXiv:2404.19756},
year = {2024}
}
References#
- Liu et al., KAN: Kolmogorov-Arnold Networks β arXiv:2404.19756
- The Kolmogorov-Arnold representation theorem (Wikipedia)
- B-splines & de Boor algorithm β Carl de Boor (1972)
π€ Contributing#
PRs welcome! See CONTRIBUTING.md. Good places to start:
- π Good first issues
- πΊοΈ
roadmap.mdβ P0 / P1 / P2 backlog - π¬ Discussions
π License#
Apache 2.0. Use it. Ship it. Tell us when you do β we'd love to hear how kanx is being used in the wild.
β Star the repo if kanx saved you time!