RSS Feed - Blog
About: A community detection method based on constrained fractional set programming (CFSP). Changes:Initial Announcement on mloss.org.
|
About: A MATLAB toolkit for performing generalized regression with equality/inequality constraints on the function value/gradient. Changes:Initial Announcement on mloss.org.
|
About: Toeblitz is a MATLAB/Octave package for operations on positive definite Toeplitz matrices. It can solve Toeplitz systems Tx = b in O(n*log(n)) time and O(n) memory, compute matrix inverses T^(-1) (with free log determinant) in O(n^2) time and memory, compute log determinants (without inverses) in O(n^2) time and O(n) memory, and compute traces of products A*T for any matrix A, in minimal O(n^2) time and memory. Changes:Adding a write-up in written/toeblitz.pdf describing the package.
|
About: Caffe aims to provide computer vision scientists with a clean, modifiable implementation of state-of-the-art deep learning algorithms. We believe that Caffe is the fastest available GPU CNN implementation. Caffe also provides seamless switching between CPU and GPU, which allows one to train models with fast GPUs and then deploy them on non-GPU clusters. Even in CPU mode, computing predictions on an image takes only 20 ms (in batch mode). Changes:LOTS of stuff: https://github.com/BVLC/caffe/releases/tag/v0.9999
|
About: This package is an implementation of a linear RankSVM solver with non-convex regularization. Changes:Initial Announcement on mloss.org.
|
About: Efficient implementation of Semi-Stochastic Gradient Descent algorithm (S2GD) for training logistic regression (L2-regularized). Changes:Initial Announcement on mloss.org.
|
|
About: This package implements Ideal PCA in MATLAB. Ideal PCA is a (cross-)kernel based feature extraction algorithm which is (a) a faster alternative to kernel PCA and (b) a method to learn data manifold certifying features. Changes:Initial Announcement on mloss.org.
|
|
About: GradMC is an algorithm for MR motion artifact removal implemented in Matlab Changes:Added support for multi-rigid motion correction.
|
|
About: DAL is an efficient and flexibible MATLAB toolbox for sparse/low-rank learning/reconstruction based on the dual augmented Lagrangian method. Changes:
|
About: BudgetedSVM is an open-source C++ toolbox for scalable non-linear classification. The toolbox can be seen as a missing link between LibLinear and LibSVM, combining the efficiency of linear with the accuracy of kernel SVM. We provide an Application Programming Interface for efficient training and testing of non-linear classifiers, supported by data structures designed for handling data which cannot fit in memory. We also provide command-line and Matlab interfaces, providing users with an efficient, easy-to-use tool for large-scale non-linear classification. Changes:Changed license from LGPL v3 to Modified BSD.
|
About: The package computes the optimal parameters for the Choquet kernel Changes:Initial Announcement on mloss.org.
|
About: "Ordinal Choquistic Regression" model using the maximum likelihood Changes:Initial Announcement on mloss.org.
|
About: Kaiye Wang, Ran He, Wei Wang, Liang Wang, Tiuniu Tan. Learning Coupled Feature Spaces for Cross-modal Matching. In ICCV, 2013. Changes:Initial Announcement on mloss.org.
|
About: minFunc is a Matlab function for unconstrained optimization of differentiable real-valued multivariate functions using line-search methods. It uses an interface very similar to the Matlab Optimization Toolbox function fminunc, and can be called as a replacement for this function. On many problems, minFunc requires fewer function evaluations to converge than fminunc (or minimize.m). Further it can optimize problems with a much larger number of variables (fminunc is restricted to several thousand variables), and uses a line search that is robust to several common function pathologies. Changes:Initial Announcement on mloss.org.
|
About: LIBOL is an open-source library with a family of state-of-the-art online learning algorithms for machine learning and big data analytics research. The current version supports 16 online algorithms for binary classification and 13 online algorithms for multiclass classification. Changes:In contrast to our last version (V0.2.3), the new version (V0.3.0) has made some important changes as follows: • Add a template and guide for adding new algorithms; • Improve parameter settings and make documentation clear; • Improve documentation on data formats and key functions; • Amend the "OGD" function to use different loss types; • Fixed some name inconsistency and other minor bugs.
|
About: Probabilistic performance evaluation for multiclass classification using the posterior balanced accuracy Changes:Added bibtex information.
|
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:added factorial mean field inference as a third algorithm complementing expectation propagation and variational Bayes generalised non-Gaussian potentials so that affine instead of linear functions of the latent variables can be used
|
About: ALgebraic COmbinatorial COmpletion of MAtrices. A collection of algorithms to impute or denoise single entries in an incomplete rank one matrix, to determine for which entries this is possible with any algorithm, and to provide algorithm-independent error estimates. Includes demo scripts. Changes:Initial Announcement on mloss.org.
|
