107 search results - page 13 / 22 » Learning to rank using gradient descent |
108
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
108
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
PRIS
2004
15 years 2 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
88
Voted
IJCAI
1997
15 years 2 months ago
1997
Max and min operations have interesting properties that facilitate the exchange of information between the symbolic and real-valued domains. As such, neural networks that employ m...
97
Voted
NIPS
2001
15 years 2 months ago
2001
Reaching movements require the brain to generate motor commands that rely on an internal model of the task's dynamics. Here we consider the errors that subjects make early in...