ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1411.6757
36
2
v1v2v3v4v5v6v7v8v9 (latest)

Proof about Weakly Universal State Contracting Networks

25 November 2014
N. Mayer
ArXiv (abs)PDFHTML
Abstract

Recurrent networks that have transfer functions that fulfill the Lipschitz continuity with L=1, may be echo state networks if certain limitations on the recurrent connectivity are applied. Initially it has been shown that it is sufficient if the largest singular value of the recurrent connectivity SSS is smaller than 1. Here it is investigated under which conditions it still can be shown that the network is an an echo state network even if S=1.

View on arXiv
Comments on this paper