3607 search results - page 403 / 722 » Learning with structured sparsity |
180
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—In need of interesting material and effective teaching approach in programming learning, students were ely to drop out of the course for the abstract concepts and complex struct...
197
Voted
ML
2010
ACM
15 years 5 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
187
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
This overview article reviews the structure of a fully statistical spoken dialogue system (SDS), using as illustration, various systems and components built at Cambridge over the ...
214
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we propose a novel adaptive step-size approach for policy gradient reinforcement learning. A new metric is defined for policy gradients that measures the effect of ...
227
click to vote
JMLR
2012
13 years 9 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...