Optimal, recursive procedures of identification (Q1105556): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: REGRESSION, STRUCTURE AND FUNCTIONAL RELATIONSHIP. PART I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3281479 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic approximation with dependent disturbances. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized laws of large numbers and auxiliary results concerning stochastic approximation with dependent disturbances. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5836401 / rank | |||
Normal rank |
Latest revision as of 18:03, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal, recursive procedures of identification |
scientific article |
Statements
Optimal, recursive procedures of identification (English)
0 references
1988
0 references
The paper concerns the parameter estimation of a stochastic process. We consider recursive estimating procedures based on the idea of stochastic approximation: (1) \(p_{s+1}=p_ s-\mu_ sF_{s+1}(Y_{s+1},p_ s)\), where \(\{\mu_ s\}\) is a sequence of positivd to the other ones when \(\beta\uparrow 1.\) Recently a variant of the discounted multi-armed bandit problem has been described by \textit{P. P. Varaiya, J. C. Walrand} and \textit{C. Buyukkoc} [IEEE Trans. Autom. Control 30, 426-439 (1985; Zbl 0566.90096)]. In this variant the k machines are represented by independent Markov chains. It is motivated by priority scheduling in networks. The relations of this variant with the third formulation given above is described.
0 references
parameter estimation
0 references
stochastic approximation
0 references