Skip to main content

Why Connectionist Learning Algorithms Need to be More Creative

  • Chapter
Artificial Intelligence and Creativity

Part of the book series: Studies in Cognitive Systems ((COGS,volume 17))

  • 416 Accesses

Abstract

The topic of creativity is an important one in connectionism. In general, connectionist systems are only as powerful as the learning algorithms they employ and these often need to ‘creatively’ construct internal representations. Of course, some researchers find the notion of connectionist representation hard to deal with. They feel that for something to count as a representation there must be an agent who makes explicit use of some system of symbols for the purposes of representing phenomena in a given domain. They see connectionist mechanisms (i.e. neural networks) as conglomerations of activity-storing units and activity-passing connections. They understand how this sort of mechanism might perform certain types of computation but they cannot see how it could possibly have anything legitimately termed a ‘representation’. Such researchers may therefore be upset by the frequency with which connectionists use the term ‘representation’ in relation to connectionist mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Elman, J.: 1989, Representation and structure in connectionist models, CRL Technical Report 8903, Center for Research in Language (UCLA), San Diego.

    Google Scholar 

  • Hecht-Nielsen, R.: 1987, Kolmogorov’s mapping neural network existence theorem theorem, Pro- ceedings of IEEE First International Conference on Neural Networks, Vol. 3, San Diego.

    Google Scholar 

  • Hinton, G.: 1989, Connectionist learning procedures, Artificial Intelligence, 40, 185–234.

    Article  Google Scholar 

  • Hinton, G. and Sejnowski, T.: 1986, Learning and relearning in boltzmann machines, in Rumelhart, D. and McClelland, J. (eds), Parallel Distributed Processing: Explorations in the Microstructures of Cognition, Vols I and II, MIT Press, Cambridge, Mass.

    Google Scholar 

  • Lippmann, R.: 1987, An introduction to computing with neural networks, IEEE ASSP Magazine, 4. Rumelhart, D., Hinton, G. and Williams, R.: 1986, Learning representations by back-propagating errors, Nature, 323, 533–36.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Thornton, C. (1994). Why Connectionist Learning Algorithms Need to be More Creative. In: Dartnall, T. (eds) Artificial Intelligence and Creativity. Studies in Cognitive Systems, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0793-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0793-0_17

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4457-0

  • Online ISBN: 978-94-017-0793-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics