1106 search results - page 50 / 222 » On regularization algorithms in learning theory |
167
click to vote
JMLR
2010
15 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...
136
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
126
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We present multi-task structure learning for Gaussian graphical models. We discuss uniqueness and boundedness of the optimal solution of the maximization problem. A block coordina...
133
click to vote
TCS
2010
15 years 3 months ago
2010
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
135
click to vote
NIPS
2008
15 years 6 months ago
2008
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...