A mathematical framework for learning and adaption: (generalized) random systems with complete connections.

Ulrich Herkenrath; Radu Theodorescu

Trabajos de Estadística e Investigación Operativa (1981)

  • Volume: 32, Issue: 1, page 116-129
  • ISSN: 0041-0241

Abstract

top
The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.

How to cite

top

Herkenrath, Ulrich, and Theodorescu, Radu. "A mathematical framework for learning and adaption: (generalized) random systems with complete connections.." Trabajos de Estadística e Investigación Operativa 32.1 (1981): 116-129. <http://eudml.org/doc/40641>.

@article{Herkenrath1981,
abstract = {The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.},
author = {Herkenrath, Ulrich, Theodorescu, Radu},
journal = {Trabajos de Estadística e Investigación Operativa},
keywords = {Sistemas aleatorios; random systems with complete connections; random environment; expediency; two-armed bandit problem},
language = {eng},
number = {1},
pages = {116-129},
title = {A mathematical framework for learning and adaption: (generalized) random systems with complete connections.},
url = {http://eudml.org/doc/40641},
volume = {32},
year = {1981},
}

TY - JOUR
AU - Herkenrath, Ulrich
AU - Theodorescu, Radu
TI - A mathematical framework for learning and adaption: (generalized) random systems with complete connections.
JO - Trabajos de Estadística e Investigación Operativa
PY - 1981
VL - 32
IS - 1
SP - 116
EP - 129
AB - The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.
LA - eng
KW - Sistemas aleatorios; random systems with complete connections; random environment; expediency; two-armed bandit problem
UR - http://eudml.org/doc/40641
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.