HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
Blealtan
efficient-kan
Python2024–2024
Blealtan / efficient-kan

efficient-kan

An efficient pure-PyTorch implementation of Kolmogorov-Arnold Network (KAN).

4Distinct people
4Mentions
0Explicit recommenders
4.7KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

An efficient pure-PyTorch implementation of Kolmogorov-Arnold Network (KAN).

GitHub

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, 1:49:46 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 day4 dated mentions

Observed mentions: 2024-05-03 13:02:55 UTC to 2024-05-16 20:43:15 UTC.

0122024-05-03 00:00:00 UTC to 2024-05-04 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsMay 32024-05-04 00:00:00 UTC to 2024-05-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-05 00:00:00 UTC to 2024-05-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-06 00:00:00 UTC to 2024-05-07 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2024-05-07 00:00:00 UTC to 2024-05-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-08 00:00:00 UTC to 2024-05-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-09 00:00:00 UTC to 2024-05-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMay 92024-05-10 00:00:00 UTC to 2024-05-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-11 00:00:00 UTC to 2024-05-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-12 00:00:00 UTC to 2024-05-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-13 00:00:00 UTC to 2024-05-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-14 00:00:00 UTC to 2024-05-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-15 00:00:00 UTC to 2024-05-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-05-16 00:00:00 UTC to 2024-05-17 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMay 16

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 32024-05-03 00:00:00 UTC2024-05-04 00:00:00 UTC202
May 42024-05-04 00:00:00 UTC2024-05-05 00:00:00 UTC000
May 52024-05-05 00:00:00 UTC2024-05-06 00:00:00 UTC000
May 62024-05-06 00:00:00 UTC2024-05-07 00:00:00 UTC110
May 72024-05-07 00:00:00 UTC2024-05-08 00:00:00 UTC000
May 82024-05-08 00:00:00 UTC2024-05-09 00:00:00 UTC000
May 92024-05-09 00:00:00 UTC2024-05-10 00:00:00 UTC000
May 102024-05-10 00:00:00 UTC2024-05-11 00:00:00 UTC000
May 112024-05-11 00:00:00 UTC2024-05-12 00:00:00 UTC000
May 122024-05-12 00:00:00 UTC2024-05-13 00:00:00 UTC000
May 132024-05-13 00:00:00 UTC2024-05-14 00:00:00 UTC000
May 142024-05-14 00:00:00 UTC2024-05-15 00:00:00 UTC000
May 152024-05-15 00:00:00 UTC2024-05-16 00:00:00 UTC000
May 162024-05-16 00:00:00 UTC2024-05-17 00:00:00 UTC101

What Hacker News says

4 sources
Thanks for the link to Conv-KAN!. I had a quick look and I have a few points. Firstly, they use a different implementation compared to the original KAN paper, i.e. they use efficient-kan (https://github.com/Blealtan/efficient-kan) - maybe some of the issues are negated in this alternative implementation? Secondly, it could be that there is something that's a bit different when applying KAN through convolution layers - again, something that negates some of the holes pinpointed in that post. Thirdly, Conv-KAN authors actually claim "At the moment we aren't seeing a significant improvement in the performance of the KAN Convolutional Networks compared to the traditional Convolutional Networks".
In Claims from Kolmogorov-Arnold Networks (KAN) research may be false
Hi Noesis, I just noticed that your implementation, combined with the efficientKAN by Blealtan (https://github.com/Blealtan/efficient-kan), results in a structure very similar to Siren(MLP with Sin activations). efficientKAN first computes the common basis functions for all the edge activations and the output can be calculated with a linear combination of the basis. If the basis functions are fourier, then a KAN layer can be viewed as a linear layer with fixed weights + Sin activation + a linear layer with learnable weights, which is a special form of Siren. I think this may show some connection between KAN and MLP.
In Kolmogorov-Arnold Networks

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.