Sciweavers

128 search results - page 20 / 26
» Using Random Forests for Handwritten Digit Recognition
Sort
View
92
Voted
JMLR
2010
192views more  JMLR 2010»
14 years 4 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
ALT
2004
Springer
15 years 1 months ago
Applications of Regularized Least Squares to Classification Problems
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
Nicolò Cesa-Bianchi
101
Voted
CVPR
2009
IEEE
1390views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Stacks of Convolutional Restricted Boltzmann Machines for Shift-Invariant Feature Learning
In this paper we present a method for learning classspecific features for recognition. Recently a greedy layerwise procedure was proposed to initialize weights of deep belief ne...
Mohammad Norouzi (Simon Fraser University), Mani R...
71
Voted
CHI
2009
ACM
15 years 10 months ago
QUICKIES: the future of sticky notes
In this paper, we present `QUICKIES', an attempt to bring one of the most useful inventions of the 20th century into the digital age: the ubiquitous sticky notes. `QUICKIES&#...
Pranav Mistry
ICML
2006
IEEE
15 years 10 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis