138 search results - page 10 / 28 » Entropy Numbers of Linear Function Classes |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...
ISMVL
2000
IEEE
13 years 12 months ago
2000
IEEE
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
DATAMINE
1999
13 years 7 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
ICML
1995
IEEE
14 years 8 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...