From bac2110f2cdb1f7f90280efbd4f7643a07c9a8fd Mon Sep 17 00:00:00 2001 From: Dennis Atabay Date: Thu, 21 Jan 2016 18:01:54 +0100 Subject: [PATCH 1/2] Update index.rst --- doc/index.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/index.rst b/doc/index.rst index 601a4ae..91fa5bc 100644 --- a/doc/index.rst +++ b/doc/index.rst @@ -40,7 +40,7 @@ This documentation contains the following pages: Features -------- -* pyrenn allows to create a wide range of (recurrent) neural network topologies +* pyrenn allows to create a wide range of (recurrent) neural network configurations * It is very easy to create, train and use neural networks * It uses the `Levenberg–Marquardt algorithm`_ (a second-order Quasi-Newton optimization method) for training, which is much faster than first-order methods like `gradient descent`_. In the matlab version additionally the `Broyden–Fletcher–Goldfarb–Shanno algorithm`_ is implemented * The python version is written in pure python and numpy and the matlab version in pure matlab (no toolboxes needed) From 2a139166f6a1094686f69426f06d89ba97b9c4e8 Mon Sep 17 00:00:00 2001 From: Dennis Atabay Date: Thu, 21 Jan 2016 18:02:35 +0100 Subject: [PATCH 2/2] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 0d0285c..eebf224 100644 --- a/README.md +++ b/README.md @@ -6,7 +6,7 @@ pyrenn is a [recurrent neural network](https://en.wikipedia.org/wiki/Recurrent_n ## Features - * pyrenn allows to create a wide range of (recurrent) neural network topologies + * pyrenn allows to create a wide range of (recurrent) neural network configurations * It is very easy to create, train and use neural networks * It uses the [Levenberg–Marquardt algorithm](https://en.wikipedia.org/wiki/Levenberg%E2%80%93Marquardt_algorithm) (a second-order Quasi-Newton optimization method) for training, which is much faster than first-order methods like [gradient descent](https://en.wikipedia.org/wiki/Gradient_descent). In the matlab version additionally the [Broyden–Fletcher–Goldfarb–Shanno algorithm](https://en.wikipedia.org/wiki/Broyden%E2%80%93Fletcher%E2%80%93Goldfarb%E2%80%93Shanno_algorithm) is implemented * The python version is written in pure python and numpy and the matlab version in pure matlab (no toolboxes needed)