Sciweavers

178 search results - page 12 / 36
» A Simple Algorithm for Nuclear Norm Regularized Problems
Sort
View
ICML
2005
IEEE
14 years 8 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 7 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
TIP
2010
162views more  TIP 2010»
13 years 2 months ago
Super-Resolution With Sparse Mixing Estimators
We introduce a class of inverse problem estimators computed by mixing adaptively a family of linear estimators corresponding to different priors. Sparse mixing weights are calcula...
Stéphane Mallat, Guoshen Yu
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 2 months ago
Convex and Network Flow Optimization for Structured Sparsity
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...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
SIAMJO
2011
13 years 2 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan