Sciweavers

13 search results - page 2 / 3
» Bregman distance to L1 regularized logistic regression
Sort
View
ICML
2004
IEEE
16 years 18 days ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
NIPS
2008
15 years 1 months ago
Generative versus discriminative training of RBMs for classification of fMRI images
Neuroimaging datasets often have a very large number of voxels and a very small number of training cases, which means that overfitting of models for this data can become a very se...
Tanya Schmah, Geoffrey E. Hinton, Richard S. Zemel...
JMIV
2006
124views more  JMIV 2006»
14 years 11 months ago
Iterative Total Variation Regularization with Non-Quadratic Fidelity
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
Lin He, Martin Burger, Stanley Osher
CIKM
2010
Springer
14 years 9 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
JMLR
2010
135views more  JMLR 2010»
14 years 10 months ago
Bundle Methods for Regularized Risk Minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...