CP-KAN reformulates polynomial degree selection in Chebyshev-based Kolmogorov-Arnold networks as a QUBO optimization problem and shows competitive regression performance with fewer parameters on several benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks
CP-KAN reformulates polynomial degree selection in Chebyshev-based Kolmogorov-Arnold networks as a QUBO optimization problem and shows competitive regression performance with fewer parameters on several benchmarks.