567 search results - page 2 / 114 » Learning All Subfunctions of a Function |
ESANN
2003
13 years 6 months ago
2003
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
ESANN
2007
13 years 6 months ago
2007
The cost of maintaining a given level of activity in a neuronal network depends on its size and degree of connectivity. Should a neural function require large-size fully-connected ...
DM
2008
13 years 5 months ago
2008
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
FOCI
2007
IEEE
13 years 11 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...