3 search results - page 1 / 1 » A scalable modular convex solver for regularized risk minimi... |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
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 different r...
JMLR
2010
13 years 3 months ago
2010
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...
JMLR
2010
13 years 3 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...