Sciweavers

3122 search results - page 128 / 625
» A Theory of Network Equivalence
Sort
View
TNN
2008
88views more  TNN 2008»
15 years 6 months ago
A New Approach to Knowledge-Based Design of Recurrent Neural Networks
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
Eyal Kolman, Michael Margaliot
MSS
2010
IEEE
97views Hardware» more  MSS 2010»
15 years 4 months ago
Network formation under mutual consent and costly communication
We consider four different game-theoretic approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider Jackson-Wolins...
Robert P. Gilles, Sudipta Sarangi
ISTCS
1993
Springer
15 years 10 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
UAI
2001
15 years 7 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
ICML
2009
IEEE
16 years 7 months ago
On primal and dual sparsity of Markov networks
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
Jun Zhu, Eric P. Xing