The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Analysis of recursive stochastic algorithms
Abstract
Recursive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the observations my depend on previous "outputs" of the algorithm. The considered class of algorithms contains, e.g., stochastic approximation algorithm, recursive identification algorithm, and algorithms for adaptive control of linear systems. It is shown how a deterministic differential equation can be associated with the algorithm. Problems like convergence with probability one, possible convergence points and asymptotic behavior of the algorithm can all be studied in terms of this differential equation. Theorems stating the precise relationships between the differential equation and the algorithm are given as well as examples of applications of the results to problems in identification and adaptive control.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Introduction to Stochastic Control Theory
(1970) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(09)x6015-7 · Cited by 3,220
Hahn, W. (1967) · Springer eBooks · doi:10.1007/978-3-642-50085-5 · Cited by 2,754
Stochastic Estimation of the Maximum of a Regression Function
Kiefer, J., & Wolfowitz, J. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729392 · Cited by 2,133
Åström, K. J., & Wittenmark, B. (1973) · Automatica · doi:10.1016/0005-1098(73)90073-3 · Cited by 1,583
System identification—A survey
Åström, K. J., & Eykhoff, P. (1971) · Automatica · doi:10.1016/0005-1098(71)90059-8 · Cited by 1,495
Finite Dimensional Linear Systems
Brockett, R. W. (2015) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973884 · Cited by 1,157
Stationary and Related Stochastic Processes
Berman, S. M. (1967) · Technometrics · doi:10.1080/00401706.1967.10490523 · Cited by 975
Finite dimensional linear systems
Vidyasagar, M. (1971) · Journal of the Franklin Institute · doi:10.1016/0016-0032(71)90268-7 · Cited by 691
(2005) · Interdisciplinary Mathematical Sciences · doi:10.1142/9789812701039_0003 · Cited by 611
Hale, J. K., Krasovskiĭ, N. N., & Brenner, J. L. (1964) · American Mathematical Monthly · doi:10.2307/2312365 · Cited by 577
Multidimensional Stochastic Approximation Methods
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728659 · Cited by 523
An instrumental variable method for real-time identification of a noisy process
Young, P. C. (1970) · Automatica · doi:10.1016/0005-1098(70)90098-1 · Cited by 412
On positive real transfer functions and the convergence of some recursive schemes
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101552 · Cited by 406
Self-citationUnbiased recursive identification using model reference adaptive techniques
Landau, I. D. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101195 · Cited by 275
Foundations of the Theory of Learning Systems
(1973) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6110-7 · Cited by 196
Strong Convergence of a Stochastic Approximation Algorithm
Lennart Ljung, A. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344212 · Cited by 97
A Comparative Study of Recursive Identification Methods
Söderström, T., Ljung, L., & Gustavsson, I. (1974) · Lund University Publications (Lund University) · Cited by 92
Self-citationKashyap, R. L., Blaydon, C. C., & Fu, K. S. (1970) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(08)60499-3 · Cited by 76
Analysis of a Self-Tuning Regulator for Nonminimum Phase Systems
Åström, K. J., & Wittenmark, B. (1974) · Lund University Publications (Lund University) · Cited by 38
Cited by
Simplified neuron model as a principal component analyzer
Oja, E. (1982) · Journal of Mathematical Biology · doi:10.1007/bf00275687 · Cited by 2,309
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Optimal unsupervised learning in a single-layer linear feedforward neural network
Sanger, T. D. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90044-0 · Cited by 1,509
Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems
Ljung, L. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1101943 · Cited by 1,162
Self-citationNon-linear system identification using neural networks
CHEN, S., BILLINGS, S. A., & GRANT, P. M. (1990) · International Journal of Control · doi:10.1080/00207179008934126 · Cited by 1,043
Metadata
- Authors
- Ljung, L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1977-08
- Volume
- 22
- Issue
- 4
- Pages
- 551-575
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2125812768
- Cited by
- 1,467
- References
- 20
- FWCI
- 60.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.