On Learning μPerceptron Networks on the Uniform Distribution

 GOLEA Mostefa
 University of Ottawa

 MARCHAND Mario
 University of Ottawa

 HANCOCK Thomas R.
 Siemens Corporate Research
Search this Article
Author(s)

 GOLEA Mostefa
 University of Ottawa

 MARCHAND Mario
 University of Ottawa

 HANCOCK Thomas R.
 Siemens Corporate Research
Journal

 Neural networks : the official journal of the International Neural Network Society

Neural networks : the official journal of the International Neural Network Society 9(1), 6782, 19960101
References: 21

1
 Statistical mechanics of multilayer neural networks

BARKAI E.
Physics Review Letters 65, 2312, 1990
Cited by (1)

2
 Training a 3node neural network is NPcomplete

BLUM A.
proceedings of the 1st Workshop on Computational Learning Theory 9, 1988
Cited by (1)

3
 <no title>

CORMAN T H.
Introduction to algorithms, 1990
Cited by (1)

4
 Exact identification of circuits using fixed points of amplification functions

GOLDMAN S.
Proceedings of the 31st Symposium on Foundations of Computer Science, 1990
Cited by (1)

5
 Probably approximately correct learning

HAUSSLER D.
Proceedings of the 8th National Conference on Artificial Intelligence (AAAI90) 1101, 1990
Cited by (1)

6
 On the complexity of loading shallow neural networks

JUDD S.
Journal of Complexity 4, 177, 1988
Cited by (1)

7
 A new polynomial time algorithm for linear programming

KARMARKAR N.
Combinatorica 4, 373, 1984
Cited by (2)

8
 Cryptographic hardness of distribution specific learning

KHARITONOV M.
Proceedings of the Twenty Fifth Annual ACM Symposium on the Theory of Computation 372, 1993
Cited by (1)

9
 Efficient noisetolerant learning from statistical queries

KEARNS M.
Proceedings of the Twenty Fifth Annual ACM Symposium on the Theory of Computation 392, 1993
Cited by (1)

10
 On the learnability of boolean formulas

KEARNS M.
Proceedings of the 9th Annual ACM Symposium on Theory of Computing 285, 1987
Cited by (1)

11
 Cryptographic limitations on learning Boolean formulae and finite automata

KEARNS M.
Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing 433, 1989
Cited by (1)

12
 On learning simple neural concepts: From halfspace intersections to neural decision lists

MARCHAND M.
Computation in Neural Systems 4, 67, 1983
Cited by (1)

13
 <no title>

PAGALLO G.
A greedy method for learning μ{DNF} functions under the uniform distribution, 1989
Cited by (1)

14
 Computational limitations on learning from examples

PITT L.
Journal of ACM 35, 965, 1988
Cited by (1)

15
 Learning probabilistic readonce formulas on product distributions

SCHAPIRE R. E.
Proceedings of the 4th Annual Workshop on Computational Learning Theory 184, 1991
Cited by (1)

16
 A theory of the learnable

VALIANT L. G.
Communications of the ACM 27, 1134, 1984
Cited by (1)

17
 Some approximations to the binomial distribution function

BAHADUR R.
Ann. Math. Statist. 31, 4353, 1960
DOI Cited by (2)

18
 Learning nonoverlapping perceptron networks from examples and membership queries

HANCOCK T.
Machine Learning 16, 161, 1994
DOI Cited by (1)

19
 Comlexity results on learning by neural nets

LIN J. H.
Machine Learning 6, 211230, 1991
DOI Cited by (3)

20
 Learning decision lists

RIVEST R. L.
Machine Learning 2, 229246, 1987
DOI Cited by (14)

21
 The statistical mechanics of learning a rule

WATKIN T.
Review of Modern Physics 65, 499, 1993
DOI Cited by (1)