FOfofoz·May 1, 2024Submission
Fourier Kolmogorov-Arnold Networks
2 points · Open discussionGistNoesis
FourierKAN
Python2024–2024
GistNoesis / FourierKAN
FourierKAN
Discover this repository through its Hacker News conversations.
2Distinct people
2Mentions
0Explicit recommenders
753GitHub stars
What to know before exploring
What it is
A public description has not been verified.
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by hour2 dated mentions
Observed mentions: 2024-05-01 12:25:39 UTC to 2024-05-01 21:22:38 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| May 1, 12:00 | 2024-05-01 12:00:00 UTC | 2024-05-01 13:00:00 UTC | 1 | 0 | 1 |
| May 1, 13:00 | 2024-05-01 13:00:00 UTC | 2024-05-01 14:00:00 UTC | 0 | 0 | 0 |
| May 1, 14:00 | 2024-05-01 14:00:00 UTC | 2024-05-01 15:00:00 UTC | 0 | 0 | 0 |
| May 1, 15:00 | 2024-05-01 15:00:00 UTC | 2024-05-01 16:00:00 UTC | 0 | 0 | 0 |
| May 1, 16:00 | 2024-05-01 16:00:00 UTC | 2024-05-01 17:00:00 UTC | 0 | 0 | 0 |
| May 1, 17:00 | 2024-05-01 17:00:00 UTC | 2024-05-01 18:00:00 UTC | 0 | 0 | 0 |
| May 1, 18:00 | 2024-05-01 18:00:00 UTC | 2024-05-01 19:00:00 UTC | 0 | 0 | 0 |
| May 1, 19:00 | 2024-05-01 19:00:00 UTC | 2024-05-01 20:00:00 UTC | 0 | 0 | 0 |
| May 1, 20:00 | 2024-05-01 20:00:00 UTC | 2024-05-01 21:00:00 UTC | 0 | 0 | 0 |
| May 1, 21:00 | 2024-05-01 21:00:00 UTC | 2024-05-01 22:00:00 UTC | 1 | 1 | 0 |
What Hacker News says
2 sourcesI quickly skimmed the paper, got inspired to simplify it, and created some Pytorch Layer :
https://github.com/GistNoesis/FourierKAN/
The core is really just a few lines.
In the paper they use some spline interpolation to represent 1d function that they sum. Their code seemed aimed at smaller sizes. Instead I chose a different representation, aka fourier coefficients that are used to interpolate the functions of individual coordinates.
It should give an idea of Kolmogorov-Arnold networks representation power, it should probably converge easier than their spline version but spline version have less operations.
Of course, if my code doesn't work, it doesn't mean theirs doesn't.
Feel free to experiment and publish paper if you want.
In Kolmogorov-Arnold Networks