TKAN: Temporal Kolmogorov-Arnold Networks

F. Rosenblatt, “The perceptron: A probabilistic model for information storage and organization in the brain.” Psychological Review , vol. 65, pp. 386–408, 1958

1958

Earlier work this paper cites.

A. N. Kolmogorov, On the representation of continuous functions of several variables by superpositions of continuous functions of a smaller number of variables . American Mathematical Society, 1961

1961

Earlier work this paper cites.

K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural networks , vol. 2, no. 5, pp. 359–366, 1989

1989

Earlier work this paper cites.

G. Cybenko, “Approximation by superpositions of a sigmoidal function,” Mathematics of control, signals and systems , vol. 2, no. 4, pp. 303–314, 1989

1989

Earlier work this paper cites.

R. J. Williams, “A learning algorithm for continually running fully recurrent neural netwokrs,” Neural Computation , vol. 1, pp. 256–263, 1989

1989

Earlier work this paper cites.

P. J. Werbos, “Backpropagation through time: what it does and how to do it,” Proceedings of the IEEE , vol. 78, no. 10, pp. 1550–1560, 1990

1990

Earlier work this paper cites.

Y. Bengio, P. Simard, and P. Frasconi, “Learning long-term dependencies with gradient descent is difficult,” IEEE Transactions on Neural Networks , vol. 5, no. 2, pp. 157–166, 1994

1994

Earlier work this paper cites.

S. Makridakis and M. Hibon, “Arma models and the box–jenkins methodology,” Journal of forecasting , vol. 16, no. 3, pp. 147–163, 1997

1997

Cited alongside, same era.

S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997

1997

Cited alongside, same era.

S. Haykin, Neural networks: a comprehensive foundation . Prentice Hall PTR, 1998

1998

Cited alongside, same era.

S. Hochreiter, “The vanishing gradient problem during learning recurrent neural nets and problem solutions,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 6, no. 02, pp. 107–116, 1998

1998

Cited alongside, same era.

L. R. Medsker, L. Jain et al. , “Recurrent neural networks,” Design and Applications , vol. 5, no. 64-67, p. 2, 2001

2001

Cited alongside, same era.

Q. V. Le, N. Jaitly, and G. E. Hinton, “A simple way to initialize recurrent networks of rectified linear units,” arXiv preprint arXiv:1504.00941 , 2015

Original

2015

Later among the works it cites.

R. C. Staudemeyer and E. R. Morris, “Understanding lstm–a tutorial into long short-term memory recurrent neural networks,” arXiv preprint arXiv:1909.09586 , 2019

Original

2019

Later among the works it cites.

C. Fan, Y. Zhang, Y. Pan, X. Li, C. Zhang, R. Yuan, D. Wu, W. Wang, J. Pei, and H. Huang, “Multi-horizon time series forecasting with temporal attention learning,” in Proceedings of the 25th ACM SIGKDD International conference on knowledge discovery & data mining , 2019, pp. 2527–2535

2019

Later among the works it cites.

O. B. Sezer, M. U. Gudelek, and A. M. Ozbayoglu, “Financial time series forecasting with deep learning: A systematic literature review: 2005–2019,” Applied soft computing , vol. 90, p. 106181, 2020

2020

Later among the works it cites.