Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximation

Glimm, J. (1960). ”A Stone–Weierstrass Theorem for C*-algebras”. Annals of Mathematics. Second Series, 72(2), 216–244 [Theorem 1]. doi:10.2307/1970133. JSTOR 1970133

1960

Earlier work this paper cites.

Rivlin, T. J. (1974). Chapter 2, Extremal properties. In The Chebyshev Polynomials. Pure and Applied Mathematics (1st ed.). New York-London-Sydney: Wiley-Interscience [John Wiley Sons]. pp. 56–123. ISBN 978-047172470-4

1974

Earlier work this paper cites.

Karageorghis, A. (1987). A note on the Chebyshev coefficients of the general order derivative of an infinitely differentiable function. Journal of Computational and Applied Mathematics, 21(1), 129-132. https://doi.org/10.1016/0377-0427(88)90396-2

1987

Earlier work this paper cites.

Jin-Tsong Jeng and Tsu-Tian Lee, ”The Chebyshev polynomials based unified model (CPBUM) neural network for the identification and control of nonlinear H/sub /spl infin// problems,” Proceedings of the IECON’97 23rd International Conference on Industrial Electronics, Control, and Instrumentation (Cat. No.97CH36066), New Orleans, LA, USA, 1997, pp. 285-290 vol.1, doi: 10.1109/IECON.1997.671063

1997

Earlier work this paper cites.

Hochreiter, S.; Bengio, Y.; Frasconi, P.; Schmidhuber, J. (2001). ”Gradient flow in recurrent nets: the difficulty of learning long-term dependencies”. In Kremer, S. C.; Kolen, J. F. (eds.). A Field Guide to Dynamical Recurrent Neural Networks. IEEE Press. ISBN 0-7803-5369-2

2001

Earlier work this paper cites.

Goldman, R. (2002). B-Spline Approximation and the de Boor Algorithm. Pyramid Algorithms, 347-443. https://doi.org/10.1016/B978-155860354-7/50008-8

2002

Earlier work this paper cites.

Rossi, F., & Conan-Guez, B. (2005). Functional multi-layer perceptron: a non-linear tool for functional data analysis. Neural Netw, 18(1), 45-60. doi: 10.1016/j.neunet.2004.07.001. PMID: 15649661

2004

Cited alongside, same era.

Dragomir, S. S. (2003), ”A survey on Cauchy–Bunyakovsky–Schwarz type discrete inequalities”, Journal of Inequalities in Pure and Applied Mathematics, 4(3), 142 pages, archived from the original on 2008-07-20

2008

Cited alongside, same era.

Braun, J., Griebel, M. (2009). On a constructive proof of Kolmogorov’s superposition theorem. Constructive Approximation, 30(3), 653–675. doi:10.1007/s00365-009-9054-2

2009

Cited alongside, same era.

Deng, L. (2012). The MNIST Database [ 16 ] of Handwritten Digit Images for Machine Learning Research [Best of the Web]. IEEE Signal Processing Magazine, 29(6), 141-142. https://doi.org/10.1109/MSP.2012.2211477

2012

Cited alongside, same era.

Schmidt-Hieber, J. (2021). The Kolmogorov–Arnold representation theorem revisited. Neural Networks, 137, 119-126. https://doi.org/10.1016/j.neunet.2021.01.020

2021

Later among the works it cites.

Dubey, S. R., Singh, S. K., Chaudhuri, B. B. (2021). Activation Functions in Deep Learning: A Comprehensive Survey and Benchmark. ArXiv. https://arxiv.org/abs/2109.14545

Original

2021

Later among the works it cites.

Narkhede, Meenal V., Prashant P. Bartakke, and Mukul S. Sutaone. ”A review on weight initialization strategies for neural networks.” Artificial intelligence review 55.1 (2022): 291-322

2022

Later among the works it cites.

Liu, Z., Wang, Y., Vaidya, S., Ruehle, F., Halverson, J., Soljačić, M., Hou, T. Y., & Tegmark, M. (2024). KAN: Kolmogorov-Arnold Networks. ArXiv. https://arxiv.org/abs/2404.19756

Original

2024

Closest in time.