MonoKAN: Certified Monotonic Kolmogorov-Arnold Network
Not on the map. Why?
Abstract (arXiv)
Artificial Neural Networks (ANNs) have significantly advanced various fields by effectively recognizing patterns and solving complex problems. Despite these advancements, their interpretability remains a critical challenge, especially in applications where transparency and accountability are essential. To address this, explainable AI (XAI) has made progress in demystifying ANNs, yet interpretability alone is often insufficient. In certain applications, model predictions must align with expert-imposed requirements, sometimes exemplified by partial monotonicity constraints. While monotonic approaches are found in the literature for traditional Multi-layer Perceptrons (MLPs), they still face difficulties in achieving both interpretability and certified partial monotonicity. Recently, the Kolmogorov-Arnold Network (KAN) architecture, based on learnable activation functions parametrized as splines, has been proposed as a more interpretable alternative to MLPs. Building on this, we introduce a novel ANN architecture called MonoKAN, which is based on the KAN architecture and achieves certified partial monotonicity while enhancing interpretability. To achieve this, we employ cubic Hermite splines, which guarantee monotonicity through a set of straightforward conditions. Additionally, by using positive weights in the linear combinations of these splines, we ensure that the network preserves the monotonic relationships between input and output. Our experiments demonstrate that MonoKAN not only enhances interpretability but also improves predictive performance across the majority of benchmarks, outperforming state-of-the-art monotonic MLP approaches.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 13 of its 42 references that are in the map. First posted on arXiv 17 Sep 2024.
Builds on
13 of 42 references.
References · 13
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2014Convex Optimization: Algorithms and Complexitycited by 569
- 2019A Survey on Explainable Artificial Intelligence (XAI): Towards Medical XAIcited by 403
- 2020A Survey on Neural Network Interpretabilitycited by 291
- 2024Kolmogorov-Arnold Networks for Time Series: Bridging Predictive Power and Interpretabilitycited by 69
- 2017Deep Lattice Networks and Partial Monotonic Functionscited by 62
- 2024KANQAS: Kolmogorov-Arnold Network for Quantum Architecture Searchcited by 36
- 2020Counterexample-Guided Learning of Monotonic Neural Networkscited by 34
- 2024Exploring the Limitations of Kolmogorov-Arnold Networks in Classification: Insights to Software Training and Hardware Implementationcited by 22
- 2019How to Incorporate Monotonicity in Deep Networks While Preserving Flexibility?cited by 21
- 2020Deontological Ethics By Monotonicity Shape Constraintscited by 16
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Inelastic Constitutive Kolmogorov-Arnold Networks: A generalized framework for automated discovery of interpretable inelastic material modelscited by 5
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Biascited by 1
- 2026Optimized Piecewise Affine Abstractions of Neural Networks with Learnable Activation Functionscited by 0
- 2026Fitting scattered data with optional monotonicity constraints on GPU: LipFit packagecited by 0
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias16 Jun 2026
- 2026Fitting scattered data with optional monotonicity constraints on GPU: LipFit package3 Jun 2026
- 2026Inelastic Constitutive Kolmogorov-Arnold Networks: A generalized framework for automated discovery of interpretable inelastic material models19 Feb 2026
- 2026Optimized Piecewise Affine Abstractions of Neural Networks with Learnable Activation Functions6 Feb 2026