Hackage :: [Package]

neural: Neural Networks in native Haskell

[ library, machine-learning, mit, program ] [ Propose Tags ] [ Report a vulnerability ]

The goal of neural is to provide a modular and flexible neural network library written in native Haskell.

Features include

  • composability via arrow-like instances and pipes,

  • automatic differentiation for automatic gradient descent/ backpropagation training (using Edward Kmett's fabulous ad library).

The idea is to be able to easily define new components and wire them up in flexible, possibly complicated ways (convolutional deep networks etc.).

Four examples are included as proof of concept:

  • A simple neural network that approximates the sine function on [0,2 pi].

  • Another simple neural network that approximates the sqrt function on [0,4].

  • A slightly more complicated neural network that solves the famous Iris flower problem.

  • A first (still simple) neural network for recognizing handwritten digits from the equally famous MNIST database.

The library is still very much experimental at this point.

[Skip to Readme]

Modules

[Last Documentation]

  • Data
    • Data.FixedSize
      • Data.FixedSize.Class
      • Data.FixedSize.Matrix
      • Data.FixedSize.Vector
      • Data.FixedSize.Volume
    • Data.MyPrelude
    • Data.Utils
      • Data.Utils.Analytic
      • Data.Utils.Arrow
      • Data.Utils.Cache
      • Data.Utils.List
      • Data.Utils.Pipes
      • Data.Utils.Random
      • Data.Utils.Stack
      • Data.Utils.Statistics
      • Data.Utils.Traversable
  • Numeric
    • Numeric.Neural
      • Numeric.Neural.Convolution
      • Numeric.Neural.Layer
      • Numeric.Neural.Model
      • Numeric.Neural.Normalization
      • Numeric.Neural.Pipes

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.1.0, 0.2.0.0, 0.3.0.0, 0.3.0.1
Dependencies ad, ansi-terminal, array, attoparsec, base (>=4.7 && <5), bytestring, containers, deepseq, directory, filepath, ghc-typelits-natnormalise, hspec, JuicyPixels, kan-extensions, lens, monad-par, monad-par-extras, MonadRandom, mtl, neural, parallel, pipes, pipes-bytestring, pipes-safe, pipes-zlib, profunctors, random, reflection, STMonadTrans, text, transformers, typelits-witnesses, vector, vector-sized [details]
Tested with ghc ==7.10.3, ghc ==8.0.1, ghc ==8.0.2
License MIT
Copyright Copyright: (c) 2016 Lars Bruenjes
Author Lars Bruenjes
Maintainer brunjlar@gmail.com
Category Machine Learning
Home page https://github.com/brunjlar/neural
Bug tracker https://github.com/brunjlar/neural/issues
Source repo head: git clone https://github.com/brunjlar/neural.git
this: git clone https://github.com/brunjlar/neural.git(tag 0.3.0.1)
Uploaded by lbrunjes at 2017-07-27T21:39:57Z
Distributions
Executables MNIST, sqrt, sin, iris
Downloads 4670 total (5 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2017-08-20 [all 3 reports]

Readme for neural-0.3.0.1

[back to package description]

neural - Neural Nets in native Haskell

Build Status

Motivation

The goal of this project is to provide a flexible framework for neural networks (and similar parameterized models) in Haskell.

There are already a couple of neural network libraries out there on Hackage, but as far as I can tell, they either

  • are wrappers for an engine written in another language or
  • offer a limitted choice of network architectures, training algorithms or error functions or are not easily extensible.

The goal of this library is to have an implementation in native Haskell (reasonably efficient) which offers maximal flexibility.

Furthermore, gradient descent/backpropagation should work automatically, using automatic differentiation. This means that new and complicated activation functions and/or network architectures can be used without the need to first calculate derivatives by hand.

In order to provide a powerful and flexible API, models are constructed using components which behave as if they implemented the Arrow and ArrowChoice typeclasses. They can therefore easily be combined and transformed.

Once a model has been constructed, it can be hooked up into a customized training algorithm using pipes, so that various aspects of the algorithm (loading data, choosing random samples, reporting intermediate results, stop criterium etc.) can be defined in a modular, decoupled way.

Even though neural networks are the primary motivation for this project, any other kind of model can be defined in the same framework, whenever the model depends on a collection of numerical parameters in a differentiable way. - One simple example for this would be linear regression.

Examples

At the moment, four examples are included:

  • sin models the regression problem of approximating the sine function on the interval [0,2 pi].

  • sqrt models the similar regression problem of approximating the square root function on the interval [0,4].

  • iris solves the famous Iris Flower classification problem.

  • MNIST tackles the equally famous MNIST problem of recognizing handwritten digits.