4255 search results - page 481 / 851 » On Learning Boolean Functions |
214
click to vote
JMLR
2010
15 years 5 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...
165
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
183
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
169
click to vote
IJRR
2011
15 years 1 months ago
2011
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
202
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study decision making in environments where the reward is only partially observed, but can be modeled as a function of an action and an observed context. This setting, known as...