Residual KANs are claimed to approximate and learn Besov functions at optimal rates, but the proof's width count is invalid in dimension d.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Approximation Rates in Besov Norms and Sample-Complexity of Kolmogorov-Arnold Networks with Residual Connections
Residual KANs are claimed to approximate and learn Besov functions at optimal rates, but the proof's width count is invalid in dimension d.