Sciweavers

862 search results - page 23 / 173
» Regularized Learning with Networks of Features
Sort
View
ACL
2009
14 years 9 months ago
Stochastic Gradient Descent Training for L1-regularized Log-linear Models with Cumulative Penalty
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
Yoshimasa Tsuruoka, Jun-ichi Tsujii, Sophia Anania...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 6 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
COLT
2007
Springer
15 years 6 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
ESANN
2004
15 years 1 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
123
Voted
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
16 years 6 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox