๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of learning in PLN networks

โœ Scribed by Bo Zhang; Ling Zhang; Huai Zhang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
591 KB
Volume
8
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A quantitative analysis of the behaviors
A quantitative analysis of the behaviors of the PLN network
โœ Bo Zhang; Ling Zhang; Huai Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 468 KB

In this paper, the main behavior qIPLN networks with./eedbaek connections art, investigated quantitatively b)' using Markm, chains theoo: The main resldts obtained are (a) tile conditions that a PLN network converges, ( b ) the probat~ility that each state in a given net work converges to a stable s

Improved Bounds on the Sample Complexity
Improved Bounds on the Sample Complexity of Learning
โœ Yi Li; Philip M. Long; Aravind Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

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 estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit