Complexity and non-commutativity of learning operations on graphs
| Abstract | We present results from numerical studies of supervised learning operations in recurrent networks considered as graphs, leading from a given set of input conditions to predetermined outputs. Graphs that have optimized their output for particular inputs with respect to predetermined outputs are asymptotically stable and can be characterized by attractors which form a representation space for an associative multiplicative structure of input operations. As the mapping from a series of inputs onto a series of such attractors generally depends on the sequence of inputs, this structure is generally noncommutative. Moreover, the size of the set of attractors, indicating the complexity of learning, is found to behave non-monotonically as learning proceeds. A tentative relation between this complexity and the notion of pragmatic information is indicated. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesPeter Turney (1989). The Architecture of Complexity: A New Blueprint. Synthese 79 (3):515 - 542.
Pierre Barbaroux & Gilles Enée (2005). Spontaneous Coordination and Evolutionary Learning Processes in an Agent-Based Model. Mind and Society 4 (2):179-195.
Stellan Ohlsson (1997). Old Ideas, New Mistakes: All Learning is Relational. Behavioral and Brain Sciences 20 (1):79-80.
David Makinson & Leendert van der Torre (2000). Input/Output Logics. Journal of Philosophical Logic 29 (4):383-408.
P. N. Johnson-Laird (2002). Peirce, Logic Diagrams, and the Elementary Operations of Reasoning. Thinking and Reasoning 8 (1):69 – 95.
David Makinson & Leendert van der Torre (2001). Constraints for Input/Output Logics. Journal of Philosophical Logic 30 (2):155-185.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,517 of 549,013 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
