https://github.com/Boris-73-TA/OrthogPolyKANs

Kolmogorov-Arnold Networks (KAN) using orthogonal polynomials instead of B-splines.
https://github.com/Boris-73-TA/OrthogPolyKANs

Last synced: about 1 month ago
JSON representation

Kolmogorov-Arnold Networks (KAN) using orthogonal polynomials instead of B-splines.

• Host: GitHub
• URL: https://github.com/Boris-73-TA/OrthogPolyKANs
• Owner: Boris-73-TA
• Created: 2024-05-09T05:39:42.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-05-15T22:21:54.000Z (8 months ago)
• Last Synced: 2024-05-16T16:07:30.562Z (8 months ago)
• Language: Jupyter Notebook
• Size: 7.27 MB
• Stars: 9
• Watchers: 2
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

• awesome-kan - OrthogPolyKAN - Arnold Networks (KAN) using orthogonal polynomials instead of B-splines. ｜  (Library / Theorem)

README

        
# OrthogPolyKANs

Kolmogorov-Arnold Networks (KAN) using orthogonal polynomials instead of B-splines.

- ! Based heavily on ChebyKAN implementation by SynodicMonth !

  - https://github.com/SynodicMonth/ChebyKAN

- There are many orthogonal polynomials: https://en.wikipedia.org/wiki/Classical_orthogonal_polynomials

  - https://mathworld.wolfram.com/OrthogonalPolynomials.html

- Polynomials: Legendre, generalized Laguerre, Chebyshev 2nd kind, Gegenbauer, Hermite, Fibonacci, Bessel, Lucas, and Jacobi

- Working on:

  - More polynomials: Romanovski, Bernstein, Newton, Bernoulli, Euler, Zernike, Kravchuk, and Lucas Polynomials

  - Alternative to tanh for normalizing to [-1, 1] using MinMax...

  - Optimize by implementing polynomials with explicit formulas instead of recursive definitions...

- NB: This is a very rough implementation, and there is a lot to improve.