Sciweavers

957 search results - page 52 / 192
» From Margin to Sparsity
Sort
View
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
TNN
2010
234views Management» more  TNN 2010»
13 years 2 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
IJCAI
2007
13 years 9 months ago
A Flexible Unsupervised PP-Attachment Method Using Semantic Information
In this paper we revisit the classical NLP problem of prepositional phrase attachment (PPattachment). Given the pattern V −NP1−P −NP2 in the text, where V is verb, NP1 is a ...
Srinivas Medimi, Pushpak Bhattacharyya
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
OPODIS
2010
13 years 5 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...