957 search results - page 1 / 192 » From Margin to Sparsity |
NIPS
2000
13 years 6 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
CVPR
2011
IEEE
12 years 8 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
NIPS
2001
13 years 6 months ago
2001
We report a result of perturbation analysis on decoding error of the belief propagation decoder for Gallager codes. The analysis is based on information geometry, and it shows tha...
ECML
2005
Springer
13 years 10 months ago
2005
Springer
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...