Sciweavers

33 search results - page 2 / 7
» Autonomous learning algorithm for fully connected recurrent ...
Sort
View
NIPS
2000
13 years 8 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee
IJON
2007
99views more  IJON 2007»
13 years 7 months ago
Criticality of avalanche dynamics in adaptive recurrent networks
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpliï...
Anna Levina, Udo Ernst, J. Michael Herrmann
BC
2002
193views more  BC 2002»
13 years 7 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon
NN
2002
Springer
107views Neural Networks» more  NN 2002»
13 years 7 months ago
Equivariant nonstationary source separation
Most of source separation methods focus on stationary sources, so higher-order statistics is necessary for successful separation, unless sources are temporally correlated. For non...
Seungjin Choi, Andrzej Cichocki, Shun-ichi Amari
ESANN
2003
13 years 8 months ago
On the weight dynamics of recurrent learning
We derive continuous-time batch and online versions of the recently introduced efficient O(N2 ) training algorithm of Atiya and Parlos [2000] for fully recurrent networks. A mathem...
Ulf D. Schiller, Jochen J. Steil