Sciweavers

1516 search results - page 182 / 304
» On the Learnability of Vector Spaces
Sort
View
NIPS
1997
14 years 11 months ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
ICML
2010
IEEE
14 years 11 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
IJON
2006
100views more  IJON 2006»
14 years 10 months ago
Analyzing the robustness of redundant population codes in sensory and feature extraction systems
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...
Christopher J. Rozell, Don H. Johnson
CSDA
2007
105views more  CSDA 2007»
14 years 10 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
JMLR
2006
131views more  JMLR 2006»
14 years 10 months ago
On Representing and Generating Kernels by Fuzzy Equivalence Relations
Kernels are two-placed functions that can be interpreted as inner products in some Hilbert space. It is this property which makes kernels predestinated to carry linear models of l...
Bernhard Moser