About: The Multiagent decision process (MADP) Toolbox is a free C++ software toolbox for scientific research in decision-theoretic planning and learning in multiagent systems.

-Includes freshly written spirit parser for .pomdp files. -Includes new code for pruning POMDP vectors; obviates dependence on Cassandra's code and old LP solve version. -Includes new factor graph solution code -Generalized firefighting CGBG domain added -Simulation class for Factored Dec-POMDPs and TOI Dec-MDPs -Approximate BG clustering methods and kGMAA with clustering.

About: Analytic engine for real-time large-scale streams containing structured and unstructured data.

Initial Announcement on mloss.org.

About: An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet processes, Gaussian latent Dirichlet allocation and more.

New maximum cluster argument for all algorithms. Also no more matlab interface since it seemed no one was using it, and I cannot support it any longer.

About: a tool for marking samples in images for database building, also including algorithm of LBP,HOG,and classifiers of SVM (six kernels), adaboost,BP and convolutional networks, extreme learning machine.

Initial Announcement on mloss.org.

About: BayesOpt is an efficient, C++ implementation of the Bayesian optimization methodology for nonlinear-optimization, experimental design and stochastic bandits. In the literature it is also called Sequential Kriging Optimization (SKO) or Efficient Global Optimization (EGO). There are also interfaces for C, Matlab/Octave and Python.

-Fixed bug in save/restore. -Fixed bug in initial design.

About: APRIL-ANN toolkit (A Pattern Recognizer In Lua with Artificial Neural Networks). This toolkit incorporates ANN algorithms (as dropout, stacked denoising auto-encoders, convolutional neural networks), with other pattern recognition methods as hidden makov models (HMMs) among others.

• Updated home repository link to follow april-org github organization.
• Improved serialize/deserialize functions, reimplemented all the serialization procedure.
• Added exceptions support to LuaPkg and APRIL-ANN, allowing to capture C++ errors into Lua code.
• Added set class.
• Added series class.
• Added data_frame class, similar to Python Pandas DataFrame.
• Serialization and deserilization have been updated with more robust and reusable API, implemented in util.serialize() and util.deserialize() functions.
• Added matrix.ext.broadcast utility (similar to broadcast in numpy).
• Added ProbablisitcMatrixANNComponent, which allow to implement probabilistic mixtures of posteriors and/or likelihoods.
• Added batch normalization ANN component.
• Allowing matrix.join to add new axis.
• Added methods prod(), cumsum() and cumprod() at matrix classes.
• Added methods count_eq() and count_neq() at matrix classes.
• Serializable objects API have been augmented with methods ctor_name() and
  ctor_params() in Lua, refered to luaCtorName() and luaCtorParams() in C++.
• Added cast.to to dynamic cast C++ objects pushed into Lua, allowing to convert base class objects into any of its derived classes.
• Added matrix.sparse as valid values for targets in ann.loss.mse and
  ann.loss.cross_entropy.
• Changed matrix metamethods __index and __newindex, allowing to use
  matrix objects with standard Lua operator[].
• Added matrix.masked_fill and matrix.masked_copy matrix.
• Added matrix.indexed_fill and matrix.indexed_copy matrix.
• Added ann.components.probabilistic_matrix, and its corresponding specializations ann.components.left_probabilistic_matrix and
  ann.components.right_probabilistic_matrix.
• Added operator[] in the right side of matrix operations.
• Added ann.components.transpose.
• Added max_gradients_norm in traianble.supervised_trainer, to avoid gradients exploding.
• Added ann.components.actf.sparse_logistic a logistic activation function with sparsity penalty.
• Simplified math.add, math.sub, ... and other math extensions for reductions, their original behavior can be emulated by using bind function.
• Added bind function to freeze any positional argument of any Lua function.
• Function stats.boot uses multiple_unpack to allow a table of sizes and the generation of multiple index matrices.
• Added multiple_unpack Lua function.
• Added __tostring metamethod to numeric memory blocks in Lua.
• Added dataset.token.sparse_matrix, a dataset which allow to traverse by rows a sparse matrix instance.
• Added matrix.sparse.builders.dok, a builder which uses the Dictionary-of-Keys format to construct a sparse matrix from scratch.
• Added method data to numeric matrix classes.
• Added methods values, indices, first_index to sparse matrix class.
• Fixed bugs when reading bad formed CSV files.
• Fixed bugs at statistical distributions.
• FloatRGB bug solved on equal (+=, -=, ...) operators. This bug affected ImageRGB operations such as resize.
• Solved problems when chaining methods in Lua, some objects end to be garbage collected.
• Improved support of strings in auto-completion (rlcompleter package).
• Solved bug at SparseMatrix<T> when reading it from a file.
• Solved bug in Image<T>::rotate90_cw methods.
• Solved bug in SparseMatrix::toDense() method.

C/C++

• Better LuaTable accessors, using [] operator.
• Implementation of matrix __index, __newindex and __call metamethods in C++.
• Implementation of matProd(), matCumSum() and matCumProd() functions.
• Implementation of matCountEq() and matCountNeq() functions for
  Matrix<T>.
• Updated matrix_ext_operations.h to change API of matrix operations. All functions have been overloaded to accept an in-place operation and another version which receives a destination matrix.
• Adding iterators to language models.
• Added MatrixScalarMap2 which receives as input2 a SparaseMatrix instance. This functions needs to be generalized to work with CPU and CUDA.
• The method SparseMatrix<T>::fromDenseMatrix() uses a DOKBuilder object to build the sparse matrix.
• The conversion of a Matrix<T> into a SparseMatrix<T> has been changed from a constructor overload to the static method
  SparseMatrix<T>::fromDenseMatrix().
• Added support for IPyLua.
• Optimized matrix access for confusion matrix.
• Minor changes in class.lua.
• Improved binding to avoid multiple object copies when pushing C++ objects.
• Added Git commit hash and compilation time.

About: This algorithm is described in Deep Semantic Ranking Based Hashing for Multi-Label Image Retrieval. See https://github.com/zhaofang0627/cuda-convnet-for-hashing

Initial Announcement on mloss.org.

About: Efficient and Flexible Distributed/Mobile Deep Learning Framework, for python, R, Julia and more

This version comes with Distributed and Mobile Examples

About: PCVM library a c++/armadillo implementation of the Probabilistic Classification Vector Machine.

30.10.2015 * code has been revised in some places fixing also some errors different multiclass schemes and hdf5 file support added. Some speed ups and memory savings by better handling of intermediate objects.

27.05.2015: - Matlab binding under Windows available. Added a solution file for VS'2013 express to compile a matlab mex binding. Can not yet confirm that under windows the code is really using multiple cores (under linux it does)

29.04.2015 * added an implementation of the Nystroem based PCVM includes: Nystroem based singular value decomposition (SVD), eigenvalue decomposition (EVD) and pseudo-inverse calculation (PINV)

22.04.2015 * implementation of the PCVM released

About: This code is provided by Jun Wan. It is used in the Chalearn one-shot learning gesture challenge (round 2). This code includes: bag of features, 3D MoSIFT-based features (i.e. 3D MoSIFT, 3D EMoSIFT and 3D SMoSIFT), and the MFSK feature.

Initial Announcement on mloss.org.

About: libnabo is a fast K Nearset Neighbor library for low-dimensional spaces.

• Reset point indices of results with distances exceeding threshold (#23, #24)
• Fine tune the find_package() capability and add uninstall target (#22)
• Fixed compiler warning (#18)
• Added OpenMP support (#20, #21)
• Build type tuning (#19)
• Fix: terminal comma in enum requires C++11
• Fix UBSAN error calculating maxNodeCount (#16, #17)
• Fixed tiny (yet significant) error in the Python doc strings (#15)
• Compile static lib with PIC (#14)
• Added configure scripts for full catkinization
• Catkinization of libnabo (following REP136)
• Update README.md Added Simon as the maintainer.
• [test] use CLOCK_PROF for NetBSD build
• Fixed CppCheck warning. Fix broken install when doxygen is not found
• Fix cmake stylistic issue
• Make python install respect custom CMAKE_INSTALL_PREFIX
• Fix broken install when doxygen is not found

About: A Deep Learning API and server

Initial Announcement on mloss.org.

About: Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, clustering, random projections, random indexing, hashing, bit signatures

Initial Announcement on mloss.org.

About: Incremental (Online) Nonparametric Classifier. You can classify both points (standard) or matrices (multivariate time series). Java and Matlab code already available.

version 2: parameterless system, constant model size, prediction confidence (for active learning).

NEW!! C++ version at: https://github.com/ilaria-gori/ABACOC

About: xgboost: eXtreme Gradient Boosting It is an efficient and scalable implementation of gradient boosting framework. The package includes efficient linear model solver and tree learning algorithm. The package can automatically do parallel computation with OpenMP, and it can be more than 10 times faster than existing gradient boosting packages such as gbm or sklearn.GBM . It supports various objective functions, including regression, classification and ranking. The package is made to be extensible, so that user are also allowed to define there own objectives easily. The newest version of xgboost now supports distributed learning on various platforms such as hadoop, mpi and scales to even larger problems

• Distributed version of xgboost that runs on YARN, scales to billions of examples

• Direct save/load data and model from/to S3 and HDFS

• Feature importance visualization in R module, by Michael Benesty

• Predict leaf index

• Poisson regression for counts data

• Early stopping option in training

• Native save load support in R and python

• xgboost models now can be saved using save/load in R

• xgboost python model is now pickable

• sklearn wrapper is supported in python module

• Experimental External memory version

About: MIPS is a software library for state-of-the-art graph mining algorithms. The library is platform independent, written in C++(03), and aims at implementing generic and efficient graph mining algorithms.

description update

About: A streaming inference and query engine for the Cross-Categorization model of tabular data.

Initial Announcement on mloss.org.

About: Libcmaes is a multithreaded C++11 library (with Python bindings) for high performance blackbox stochastic optimization of difficult, possibly non-linear and non-convex functions, using the CMA-ES algorithm for Covariance Matrix Adaptation Evolution Strategy. Libcmaes is useful to minimize / maximize any function, without information regarding gradient or derivability.

This is a major release, with several novelties, improvements and fixes, among which:

• step-size two-point adaptaion scheme for improved performances in some settings, ref #88

• important bug fixes to the ACM surrogate scheme, ref #57, #106

• simple high-level workflow under Python, ref #116

• improved performances in high dimensions, ref #97

• improved profile likelihood and contour computations, including under geno/pheno transforms, ref #30, #31, #48

• elitist mechanism for forcing best solutions during evolution, ref 103

• new legacy plotting function, ref #110

• optional initial function value, ref #100

• improved C++ API, ref #89

• Python bindings support with Anaconda, ref #111

• configure script now tries to detect numpy when building Python bindings, ref #113

• Python bindings now have embedded documentation, ref #114

• support for Travis continuous integration, ref #122

• lower resolution random seed initialization