10054 search results - page 89 / 2011 » On the Complexity of Function Learning |
148
Voted
JMLR
2010
15 years 1 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...
109
Voted
PERCOM
2006
ACM
16 years 2 months ago
2006
ACM
This paper proposes a distributed platform designed to support pervasive learning and interactivity on a university campus and to ease tasks related to learning and teaching. The ...
121
Voted
MOC
2011
14 years 9 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
137
Voted
ICML
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
141
click to vote
JMLR
2008
15 years 2 months ago
2008
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...