1106 search results - page 78 / 222 » On regularization algorithms in learning theory |
150
click to vote
TNN
1998
15 years 4 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
140
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
119
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper proposes a context-dependent case-based mechanism for selecting negotiation partners with the focus on the adaptation of similarity relations to a specific context. Th...
163
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
167
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...