OurBigBook.comSite Source code

Growth bound for a single-hidden-layer sign network

A bias-free network with

p

inputs,

m

sign-activated hidden nodes, and a thresholded linear output satisfies

s (H, n) \leq (n + 1)^{(p + 1) m} .

The hidden units contribute

s (G, n)^{m} \leq (n + 1)^{p m}

sample patterns, and the output weights contribute

(n + 1)^{m}

.

 Ancestors (6)

 Incoming links (1)

Solution