Learning-Lab-C-Library:

The library uses Posix calls system:

Creating the library for Linux users:

sh create_library.sh

Compiling the tests for Linux users:

sh compile_tests.sh

To create the Library on Windows install first Cygwin with gcc and make

https://www.cygwin.com/

Current Roadmap:

• Fully-connected-layers feed forward (20/11/2018)
• Fully-connected-layers backpropagation (20/11/2018)
• Nesterov momentum (20/11/2018)
• Adam optimization algorithm (20/11/2018)
• Fully-connected layers dropout (20/11/2018)
• Convolutional layers feed forward (20/11/2018)
• Convolutional layers backpropagation (20/11/2018)
• Convolutional 2d max-pooling (20/11/2018)
• Convolutional 2d avarage pooling (20/11/2018)
• Convolutional 2d local response normalization (20/11/2018)
• Convolutional padding (20/11/2018)
• Fully-connected sigmoid activation (20/11/2018)
• Fully-connected relu activation (20/11/2018)
• Fully-connected softmax activation (20/11/2018)
• Fully-connected tanh activation (20/11/2018)
• Mse loss (20/11/2018)
• Cross-entropy loss (20/11/2018)
• Reduced cross-entropy form with softmax (20/11/2018)
• Convolutional sigmoid activation (20/11/2018)
• Convolutional relu activation (20/11/2018)
• Convolutional tanh activation (20/11/2018)
• Residual layers filled with convolutional layers (20/11/2018)
• Residual layers feed-forward (20/11/2018)
• Residual layers backpropagation (20/11/2018)
• Model structure with fully-connected,convolutional,residual layers (20/11/2018)
• Fixed residual issues (22/11/2018)
• Adam algorithm for model_update (22/11/2018)
• Size_of_model(model* m) function (23/11/2018)
• L2 Regularization (27/11/2018)
• Manual Batch normalization feed forward and backpropagation (27/11/2018)
• Fixed residual issues2 (28/11/2018)
• Manual Xavier Initialization (28/11/2018)
• Clipping gradient (29/1/2019)
• Convolutional Layers with only pooling function (30/1/2019)
• Leaky Relu Activation function (30/1/2019)
• Batch Normalization final mean and variance for feed forward output (1/2/2019)
• Decision Tree structure (3/2/2019)
• LSTM feed forward (13/5/2019)
• LSTM back propagation (13/5/2019)
• Recurrent Network (rmodel) with LSTM (13/5/2019)
• Recurrent Network update with nesterov and adam algorithm (13/5/2019)
• Group Normalization for convolutional layers (4/7/2019)
• Residual LSTM cell (18/7/2019)
• Group Normalization for lstm layer (21/7/2019)
• Huber Loss (23/7/2019)
• Variational Auto Encoder for model structures (23/7/2019)
• VAE model feedforward and back propagation (23/7/2019)
• Modified Huber Loss (26/7/2019)
• Focal Loss (18/8/2019)
• Rectified Adam (22/8/2019)
• Confusion matrix and accuracy array (30/9/2019)
• KL Divergence (25/10/2019)
• Client-Server for distributed systems implementation (27/10/2019)
• Precision, Sensitivity, Specificity arrays (2/11/2019)
• NEAT algorithm (17/11/2019)
• HAPPY NEW YEAR FOR LLAB!
• DDPG reinforcement learning algorithm added (29/11/2019)
• Ornstein-Ulhenbeck Process (30/11/2019)
• Edge-Popup training algorithm for fully connected and convolutional layers (14/12/2019)
• 2d Transposed convolution feed forward and back propagation (21/12/2019)
• DiffGrad optimization algorithm for cnn fcl lstm layers (27/12/2019)
• Recurrent Encoder-Decoder with attention mechanism structure (7/3/2020)
• ADAMOD optimization algorithm (9/3/2020)
• Recurrent encoder decoder with global attention mechanism feedforward, back propagation, update (16/03/2020)
• Edge popup for Transposed convolution (23/3/2020)
• Layer normalization for fully connected layers (23/3/2020)
• Fully connected layers only as dropout layers (25/3/2020)
• Filling residual layers also with fully connected layers (should start and end with convolutional ones) (25/3/2020)
• ELU Activation function (6/6/2020)
• Sin - Cos positional encoding (8/12/2020)
• Scaled L2 normalization layer (8/12/2020)
• Self-Attention and Multi-Head-Attention (11/12/2020)
• Transformer encoder (24/12/2020)
• Transformer decoder (1/03/2021)
• Transformer feed-forward, back-propagation, update (3/03/2021)
• Ram optimization for model and rmodel (27/04/2021)
• Local response normalization for fcl (27/04/2021)
• Edge popup for lstm (27/04/2021)
• Adaptive clipping gradient (27/04/2021)
• Transformer with Edge-Popup (03/05/2021)
• Variational 2d loss (02/08/2021)
• Contrastive 2d loss (02/08/2021)
• Learning rate decay (02/01/2022)
• Dueling Categorical DQN with sequential models (01/02/2022)
• Rainbow training (09/03/2022)
  • • double q network
  • • dueling q network
  • • categorical q network
  • • ranked base td buffer priorization
  • • n step reward
  • • diversity driven exploration (better than noisy nets of 2017 rainbow paper)
• Uniform and Reward sampling for rainbow training (17/03/2022)
• Noisy nets for Fully-connected-layers (08/02/2023)
• L1 distance for diversity driven exploration (05/04/2023) [set as default for rainbow dde]
• Inverse Q-Learning (04/05/2023)
• Policy Gradient with Entropy and Dde (04/05/2023)
• QR-DQN-1 for Rainbow (04/05/2023)
• X-SWING Algorithm (29/09/2023)
• EfficientZero Structure & EfficientZero MCTS (29/09/2023)

Python Version

https://github.com/ez-spark/Pyllab

Tests

More tests are availabe at https://github.com/ez-spark/Pyllab

Each test has been trained successfully.

The tests are trained on the CIFAR-10 Dataset that you can find in the data.tar.gz file, to run these tests you have to unpack data.tar.gz

• From test 1 to 6 there are different model* networks with different optimization algorithms, trained on supervised learning.
• Test 7 is a vae model trained on unsupervised learning.
• Test 8 is the test 6 trained on distributed systems client-server. To run it you have to connect 5 clients (IS NOT UP TO DATE WITH NEW VERSION).
• Test 9 is trained with look ahead algorithm
• Test 10 is the Neat algorithm. it has been tested on the xor with the same parameter settings of the original paper: http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf except for the feed forward (output node has a bias of 1) and the bias input node. Another difference is the removal connection rate. It has been set to 0.01 only if no connection has been added. However when a specie is close to the death (specie_rip param close to 15) then there is a change in the mutation behaviour: the add connection rate and removal connection rate are switched, in this case there is an inversion of the trend and the network try to simplify its structure. The test shows close results (even better) with the ones of the original paper. Indeed on 100 running test there is an avarage of 4680 total genomes computed, compared with the 4755 of the paper. But it needs more generations (an avarage of 41, probably due to the offspring generation function) and in the worst case (33276 genomes computed). Pay attention the structure of the genome is different from the structure of the deep learning networks. The test 10 can be taken as neat template, you need only to change the compute fitness function.
• Test 11 is test 6 trained with edge popup algorithm.
• Test 14 is not available at the moment
• Test 15 is the test for the transformer treated as an autoencoder that tries to replicate the input (the digit images), (NEED FURTHER TUNING).
• From test 16 to test 18 there are recurrent networks with normalization, adaptive gradient clipping and also edge popup
• Dueling Categorical DQN and Rainbow have been tested on cartpole v1 in pyllab

Future implementations

• recurrent ram optimization
• recurrent computation optimization
• computational optimization for arrays following numpy tutorial
• Opencl computations
• Fixing the transformers
• Diffusion models