Sciweavers

146 search results - page 8 / 30
» Online Gradient Descent Learning Algorithms
Sort
View
FOCM
2006
50views more  FOCM 2006»
13 years 7 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
ECML
2007
Springer
13 years 11 months ago
Ordinal Classification with Decision Rules
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some chara...
Krzysztof Dembczynski, Wojciech Kotlowski, Roman S...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 1 months ago
Dynamic Network Selection using Kernels
—We present a new algorithm for vertical handover and dynamic network selection, based on a combination of multiattribute utility theory, kernel learning and stochastic gradient ...
Eric van den Berg, Praveen Gopalakrishnan, Byungsu...
TNN
2008
138views more  TNN 2008»
13 years 7 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
NIPS
2008
13 years 8 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang