3378 search results - page 165 / 676 » Learning in Friedberg Numberings |
197
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
170
click to vote
NIPS
1996
15 years 7 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
155
click to vote
IJCAI
1989
15 years 7 months ago
1989
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
125
click to vote
SLP
1989
15 years 7 months ago
1989
This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog inter...
213
click to vote
NIPS
1992
15 years 7 months ago
1992
Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...