Sciweavers

33 search results - page 5 / 7
» Structured Sparsity with Group-Graph Regularization
Sort
View
99
Voted
CVPR
2011
IEEE
14 years 6 months ago
Sharing Features Between Objects and Their Attributes
Visual attributes expose human-defined semantics to object recognition models, but existing work largely restricts their influence to mid-level cues during classifier training....
Sung Ju Hwang, Fei Sha, Kristen Grauman
JMLR
2012
13 years 26 days ago
On Sparse, Spectral and Other Parameterizations of Binary Probabilistic Models
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
David Buchman, Mark W. Schmidt, Shakir Mohamed, Da...
CVPR
2012
IEEE
13 years 26 days ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
86
Voted
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
15 years 4 months ago
Latent Dirichlet Conditional Naive-Bayes Models
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...
Arindam Banerjee, Hanhuai Shan
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 5 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...