3607 search results - page 8 / 722 » Learning with structured sparsity |
JMLR
2010
13 years 2 months ago
2010
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these mo...
ECML
2005
Springer
14 years 1 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 ...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
JMLR
2010
13 years 2 months ago
2010
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
TIP
2010
13 years 6 months ago
2010
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...