695 search results - page 28 / 139 » Convex Learning with Invariances |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...
NIPS
2008
13 years 11 months ago
2008
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...