All entries.
Showing Items 491-500 of 595 on page 50 of 60: First Previous 45 46 47 48 49 50 51 52 53 54 55 Next Last

Logo Semi Stochastic Gradient Descent 1.0

by konkey - July 9, 2014, 04:28:47 CET [ BibTeX BibTeX for corresponding Paper Download ] 1813 views, 494 downloads, 1 subscription

About: Efficient implementation of Semi-Stochastic Gradient Descent algorithm (S2GD) for training logistic regression (L2-regularized).

Changes:

Initial Announcement on mloss.org.


Logo CMatrix Class 1.0.0

by openpr_nlpr - December 2, 2011, 05:28:41 CET [ Project Homepage BibTeX Download ] 1718 views, 492 downloads, 1 subscription

About: It's a C++ program for symmetric matrix diagonalization, inversion and principal component anlaysis(PCA). The matrix diagonalization function can also be applied to the computation of singular value decomposition (SVD), Fisher linear discriminant analysis (FLDA) and kernel PCA (KPCA) if forming the symmetric matrix appropriately.

Changes:

Initial Announcement on mloss.org.


Logo DiffSharp 0.6.3

by gbaydin - July 18, 2015, 22:04:00 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2372 views, 491 downloads, 3 subscriptions

About: DiffSharp is an automatic differentiation (AD) library providing gradients, Hessians, Jacobians, directional derivatives, and matrix-free Hessian- and Jacobian-vector products. It allows exact and efficient calculation of derivatives, with support for nesting.

Changes:

Fixed: Bug fix in DiffSharp.AD subtraction operation between D and DF


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 1830 views, 485 downloads, 1 subscription

About: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23).

Changes:

Initial Announcement on mloss.org.


Logo Metropolis Hastings algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:43:20 CET [ Project Homepage BibTeX Download ] 1863 views, 483 downloads, 1 subscription

About: Metropolis-Hastings alogrithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult. Thi sequence can be used to approximate the distribution.

Changes:

Initial Announcement on mloss.org.


About: Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explore their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the L1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings.

Changes:

Initial Announcement on mloss.org.


Logo AlCoCoMa 1.0

by kiraly - November 8, 2013, 09:38:07 CET [ BibTeX BibTeX for corresponding Paper Download ] 1780 views, 480 downloads, 1 subscription

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.


Logo Nonparametric Sparse Factor Analysis 1

by davidknowles - July 26, 2013, 01:02:02 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2224 views, 479 downloads, 1 subscription

About: This is the core MCMC sampler for the nonparametric sparse factor analysis model presented in David A. Knowles and Zoubin Ghahramani (2011). Nonparametric Bayesian Sparse Factor Models with application to Gene Expression modelling. Annals of Applied Statistics

Changes:

Initial Announcement on mloss.org.


Logo Calculate Normalized Information Measures 1.0.0

by openpr_nlpr - December 2, 2011, 04:35:32 CET [ Project Homepage BibTeX Download ] 1506 views, 473 downloads, 1 subscription

About: The toolbox is to calculate normalized information measures from a given m by (m+1) confusion matrix for objective evaluations of an abstaining classifier. It includes total 24 normalized information measures based on three groups of definitions, that is, mutual information, information divergence, and cross entropy.

Changes:

Initial Announcement on mloss.org.


Logo HierLearning 1.0

by neville - March 2, 2014, 04:24:37 CET [ BibTeX BibTeX for corresponding Paper Download ] 1644 views, 468 downloads, 1 subscription

About: HierLearning is a C++11 implementation of a general-purpose, multi-agent, hierarchical reinforcement learning system for sequential decision problems.

Changes:

Initial Announcement on mloss.org.


Showing Items 491-500 of 595 on page 50 of 60: First Previous 45 46 47 48 49 50 51 52 53 54 55 Next Last