pith. sign in

arxiv: 0712.4050 · v1 · pith:QCLZJDLCnew · submitted 2007-12-25 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech

Perceptron capacity revisited: classification ability for correlated patterns

classification ❄️ cond-mat.dis-nn cond-mat.stat-mech
keywords patternscorrelateddevelopedperceptronproblemabilityaddressalgorithm
0
0 comments X
read the original abstract

In this paper, we address the problem of how many randomly labeled patterns can be correctly classified by a single-layer perceptron when the patterns are correlated with each other. In order to solve this problem, two analytical schemes are developed based on the replica method and Thouless-Anderson-Palmer (TAP) approach by utilizing an integral formula concerning random rectangular matrices. The validity and relevance of the developed methodologies are shown for one known result and two example problems. A message-passing algorithm to perform the TAP scheme is also presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.