54 search results - page 2 / 11 » Fast Optimization Methods for L1 Regularization: A Comparati... |
ISSAC
2009
Springer
13 years 12 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
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, ...
AAAI
2012
11 years 7 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
PAMI
2010
13 years 2 days ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
CSDA
2007
13 years 5 months ago
2007
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...