HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
attractivechaos
kann
C2018–2018
attractivechaos / kann

kann

A lightweight C library for artificial neural networks

2Distinct people
3Mentions
0Explicit recommenders
764GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A lightweight C library for artificial neural networks

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, 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 hour3 dated mentions

Observed mentions: 2018-04-09 12:25:34 UTC to 2018-04-10 01:50:34 UTC.

0122018-04-09 12:00:00 UTC to 2018-04-09 13:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsApr 9, 12:002018-04-09 13:00:00 UTC to 2018-04-09 14:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 14:00:00 UTC to 2018-04-09 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 15:00:00 UTC to 2018-04-09 16:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 16:00:00 UTC to 2018-04-09 17:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 17:00:00 UTC to 2018-04-09 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 18:00:00 UTC to 2018-04-09 19:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsApr 9, 18:002018-04-09 19:00:00 UTC to 2018-04-09 20:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 20:00:00 UTC to 2018-04-09 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 21:00:00 UTC to 2018-04-09 22:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 22:00:00 UTC to 2018-04-09 23:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-09 23:00:00 UTC to 2018-04-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-10 00:00:00 UTC to 2018-04-10 01:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-10 01:00:00 UTC to 2018-04-10 02:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 commentsApr 10, 01:00

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
Apr 9, 12:002018-04-09 12:00:00 UTC2018-04-09 13:00:00 UTC101
Apr 9, 13:002018-04-09 13:00:00 UTC2018-04-09 14:00:00 UTC000
Apr 9, 14:002018-04-09 14:00:00 UTC2018-04-09 15:00:00 UTC000
Apr 9, 15:002018-04-09 15:00:00 UTC2018-04-09 16:00:00 UTC000
Apr 9, 16:002018-04-09 16:00:00 UTC2018-04-09 17:00:00 UTC000
Apr 9, 17:002018-04-09 17:00:00 UTC2018-04-09 18:00:00 UTC000
Apr 9, 18:002018-04-09 18:00:00 UTC2018-04-09 19:00:00 UTC000
Apr 9, 19:002018-04-09 19:00:00 UTC2018-04-09 20:00:00 UTC000
Apr 9, 20:002018-04-09 20:00:00 UTC2018-04-09 21:00:00 UTC000
Apr 9, 21:002018-04-09 21:00:00 UTC2018-04-09 22:00:00 UTC000
Apr 9, 22:002018-04-09 22:00:00 UTC2018-04-09 23:00:00 UTC000
Apr 9, 23:002018-04-09 23:00:00 UTC2018-04-10 00:00:00 UTC000
Apr 10, 00:002018-04-10 00:00:00 UTC2018-04-10 01:00:00 UTC000
Apr 10, 01:002018-04-10 01:00:00 UTC2018-04-10 02:00:00 UTC211

What Hacker News says

3 sources
There have been several posts on tiny/lightweight neural network libraries. They are indeed small, but they only implement the most basic multi-layer perceptrons (MLPs) with little optimization (e.g. they often implement backprop inefficiently). KANN is far beyond MLPs. It implements automatic differentiation on top of generic computational graphs [1], supporting dropout, proper mini-batching, reshape/slice/concat of general n-d arrays, arbitrary weight sharing, 1D/2D convolution/pooling, SGD/RMSprop, RNN/LSTM and graph/weight saving/loading. KANN is like a CPU-only mini-tensorflow. KANN optimizes convolution [2] and matrix multiplication [3] (also optionally calls BLAS' sgemm). It can use SSE and multi-threading when available. On multiple threads, KANN is sometimes faster than CPU-only Theano+Keras. I implemented KANN when I was studyin
Read the rest
g deep learning [4]. I have not touched the code base for a while as I am not really working on ML/DL. Nonetheless, KANN should still work fine. [1]: http://colah.github.io/posts/2015-08-Backprop/ [2]: https://github.com/attractivechaos/kann/blob/master/doc/02de... [3]: https://attractivechaos.wordpress.com/2016/08/28/optimizing-... [4]: https://attractivechaos.wordpress.com/2017/03/04/kann-a-c-li...
In Show HN: KANN – mid-scale deep learning and autodiff in ANSI C (4 files; 4k LOC)

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.