RSS Feed - Blog
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. Changes:-Fixed bugs. -Improved and extended documentation. -Extended and simplified API accross platforms. -Extended functionality (new surrogate functions, new priors, new kernels, new criteria). -Improved modularity of the optimization process to allow plotting and debugging of intermediate steps. -Added more demos and examples.
|
About: ITE (Information Theoretical Estimators) is capable of estimating many different variants of entropy, mutual information, divergence, association measures and cross quantities. Thanks to its highly modular design, ITE supports additionally (i) the combinations of the estimation techniques, (ii) the easy construction and embedding of novel information theoretical estimators, and (iii) their immediate application in information theoretical optimization problems. Changes:
|
About: The GPstuff toolbox is a versatile collection of Gaussian process models and computational tools required for inference. The tools include, among others, various inference methods, sparse approximations and model assessment methods. Changes:2013-04-24 Version 4.1 New features:
Improvements
New files
|
About: The aim is to embed a given data relationship matrix into a low-dimensional Euclidean space such that the point distances / distance ranks correlate best with the original input relationships. Input relationships may be given as (asymmetric) distances, dissimilarities, or (negative) scores. Input-output relations are modelled as row-conditioned. (Weighted) Pearson and soft Spearman rank correlation, and unweighted soft Kendall correlation are supported correlation measures for input/output object neighborhood relationships. Changes:
|
About: The GPML toolbox is a flexible and generic Octave 3.2.x and Matlab 7.x implementation of inference and prediction in Gaussian Process (GP) models. Changes:We now support inference on large datasets using the FITC approximation for non-Gaussian likelihoods for EP and Laplace's approximation. New likelihood functions: mixture likelihood, Poisson likelihood, label noise. We added two MCMC samplers.
|
About: LIBOL is an open-source library that consists of a family of state-of-the-art online learning algorithms for machine learning and data mining research. Changes:Initial Announcement on mloss.org.
|
About: Stochastic neighbor embedding aims at the reconstruction of given distance, dissimilarity, or score neighborhood relations in a low-dimensional Euclidean space. This can be regarded as general approach to multi-dimensional scaling, but the reconstruction is based on the definition of input (and output) neighborhood probability alone. Probability of score exceedance is used for neighborhood probability estimation, which is connected to soft-rank optimization. The present implementation makes use of quasi 2nd order gradient-based (l-)BFGS optimization. Changes:
|
About: libDAI provides free & open source implementations of various (approximate) inference methods for graphical models with discrete variables, including Bayesian networks and Markov Random Fields. Changes:Release 0.3.1 fixes various bugs. The issues on 64-bit Windows platforms have been fixed and libDAI now offers full 64-bit support on all supported platforms (Linux, Mac OSX, Windows).
|
About: The package provides a Lagrangian approach to the posterior regularization of given linear mappings. This is important in two cases, (a) when systems are under-determined and (b) when the external model for calculating the mapping is invariant to properties such as scaling. The software may be applied in cases when the external model does not provide its own regularization strategy. In addition, the package allows to rank attributes according to their distortion potential to a given linear mapping. Changes:Version 1.1 (May 23, 2012) memory and time optimizations distderivrel.m now supports assessing the relevance of attribute pairs Version 1.0 (Nov 9, 2011) * Initial Announcement on mloss.org.
|
About: Message passing for topic modeling Changes:
|
About: This local and parallel computation toolbox is the Octave and Matlab implementation of several localized Gaussian process regression methods: the domain decomposition method (Park et al., 2011, DDM), partial independent conditional (Snelson and Ghahramani, 2007, PIC), localized probabilistic regression (Urtasun and Darrell, 2008, LPR), and bagging for Gaussian process regression (Chen and Ren, 2009, BGP). Most of the localized regression methods can be applied for general machine learning problems although DDM is only applicable for spatial datasets. In addition, the GPLP provides two parallel computation versions of the domain decomposition method. The easiness of being parallelized is one of the advantages of the localized regression, and the two parallel implementations will provide a good guidance about how to materialize this advantage as software. Changes:Initial Announcement on mloss.org.
|
About: A mutual information library for C and Mex bindings for MATLAB. Aimed at feature selection, and provides simple methods to calculate mutual information, conditional mutual information, entropy, conditional entropy, and Renyi entropy/mutual information. Works with discrete distributions, and expects column vectors of features. Changes:Updated documentation & link to JMLR publication.
|
About: NaN-toolbox is a statistics and machine learning toolbox for handling data with and without missing values. Changes:Changes in v.2.5.2 - faster version of quantile if multiple quantiles are requested - removes the dependency on ZLIB and thus - fixes "pkg install nan" for Octave on Windows - a number of minor improvements For details see the CHANGELOG at http://pub.ist.ac.at/~schloegl/matlab/NaN/CHANGELOG
|
About: Locally Weighted Projection Regression (LWPR) is a recent algorithm that achieves nonlinear function approximation in high dimensional spaces with redundant and irrelevant input dimensions. At its [...] Changes:Version 1.2.4
|
About: The glm-ie toolbox contains scalable estimation routines for GLMs (generalised linear models) and SLMs (sparse linear models) as well as an implementation of a scalable convex variational Bayesian inference relaxation. We designed the glm-ie package to be simple, generic and easily expansible. Most of the code is written in Matlab including some MEX files. The code is fully compatible to both Matlab 7.x and GNU Octave 3.2.x. Probabilistic classification, sparse linear modelling and logistic regression are covered in a common algorithmical framework allowing for both MAP estimation and approximate Bayesian inference. Changes:contributed by George Papandreou:
gfortran support to pls/lbfgsb/Makefile (thanks to Ernst Kloppenburg) slight modification to mat/@matFFTN/mvm.m to make it more consistent simple gradient solver using Barzilai-Borwein step size pls/plsBB.m
|
About: Multi-class vector classification based on cost function-driven learning vector quantization , minimizing misclassification. Changes:Initial Announcement on mloss.org.
|
About: Bayesian Reasoning and Machine Learning toolbox Changes:Fixed some small bugs and updated some demos.
|
About: Correlative Matrix Mapping (CMM) provides a supervised linear data mapping into a Euclidean subspace of given dimension. Applications include denoising, visualization, label-specific data preprocessing, and assessment of data attribute pairs relevant for the supervised mapping. Solving auto-association problems yields linear multidimensional scaling, similar to PCA, but usually with more faithful low-dimensional mappings. Changes:Tue Jul 5 14:40:03 CEST 2011 - Bugfixes and cleanups
|
About: This software is an implementation of Hidden Markov Support Vector Machines (HMSVMs). Changes:Initial Announcement on mloss.org.
|
About: This toolbox provides functions for maximizing and minimizing submodular set functions, with applications to Bayesian experimental design, inference in Markov Random Fields, clustering and others. Changes:
|