Sciweavers

9 search results - page 1 / 2
» Increasing Feature Selection Accuracy for L1 Regularized Lin...
Sort
View
JMLR
2010
104views more  JMLR 2010»
12 years 11 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
MCS
2009
Springer
13 years 9 months ago
Regularized Linear Models in Stacked Generalization
Abstract. Stacked generalization is a flexible method for multiple classifier combination; however, it tends to overfit unless the combiner function is sufficiently smooth. Prev...
Samuel Robert Reid, Gregory Z. Grudic
ICML
2010
IEEE
13 years 6 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
EMNLP
2011
12 years 4 months ago
Structured Sparsity in Structured Prediction
Linear models have enjoyed great success in structured prediction in NLP. While a lot of progress has been made on efficient training with several loss functions, the problem of ...
André F. T. Martins, Noah A. Smith, M&aacut...
ICCV
2009
IEEE
13 years 2 months ago
Robust facial feature tracking using selected multi-resolution linear predictors
This paper proposes a learnt data-driven approach for accurate, real-time tracking of facial features using only intensity information. Constraints such as a-priori shape models o...
Eng-Jon Ong, Yuxuan Lan, Barry Theobald, Richard H...