Kolmogorov-Arnold Classifier Systems as Universal Approximators

arXiv:2609.37958v1 Announce Type: new Abstract: As the input dimension n grows, rule-based machine learning, such as Learning Classifier Systems (LCSs), faces a fundamental scalability bottleneck for function approximation: both rule count and parameter count grow exponentially with n. Traditional LCSs partition the n-dimensional input space directly, requiring O(m^n) rules for adequate coverage, where m is the per-variable resolution. This article breaks from this paradigm by reorganizing rules dimension-wise, guided by the Kolmogorov-Arnold representation theorem: any continuous n-dimensional function can be expressed as a finite superposition of one-dimensional functions. The proposed Kolmogorov-Arnold Classifier System (KACS) decomposes the target function into one-dimensional subproblems and assigns a dedicated ruleset to each, reducing the worst-case rule count from O(m^n) to O(mn^2) and replacing n-dimensional local models with one-dimensional models requiring only two parameters per rule, independent of n. We also provide the first constructive proof that an LCS, namely KACS, is a universal approximator for continuous functions on compact domains. Evaluated against a direct n-dimensional input space partitioning approach under otherwise identical conditions, KACS achieves competitive accuracy in many settings while using only 2% to 40% of the parameters. Our implementation is available at https://github.com/YNU-NakataLab/KACS.

Related

• Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks
• Holomorphic Neural ODEs with Kolmogorov-Arnold Networks for Interpretable Discovery of Complex Dynamics
• Scalability Analysis of Distributed Kolmogorov-Arnold Network Training on High-Performance Computing Systems
• Glass-Box Deep Learning for FDIA Detection in Nonlinear Automatic Generation Control: A Kolmogorov-Arnold Network Approach

Source: arXiv cs.LG | 2026-09-30