Statistical learning theory and randomized algorithms for control
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The topic of the present article is the use of randomized algorithms to solve some problems in control system designs that are perceived to be "difficult". A brief introduction is given to the notions of computational complexity that are pertinent to the present discussion, and then some problems in control system analysis and synthesis that are difficult in a complexity-theoretic sense are described. Some of the elements of statistical learning theory, which forms the basis of the randomized approach, are briefly described. Finally, these two sets of ideas are brought together to show that it is possible to construct efficient randomized algorithms for each of the difficult problems discussed by using the ideas of statistical learning theory. A real-life design example of synthesizing a first-order controller for the longitudinal stabilization of an unstable fighter aircraft is then presented to show that the randomized approach can be quite successful in tackling a practical problem.
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Cited by
Stability of Time-Delay Systems
Gu, K., Kharitonov, V. L., & Chen, J. (2003) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0039-0 · Cited by 5,575
Metadata
- Venue
- IEEE Control Systems
- Published
- 1998-12
- Volume
- 18
- Issue
- 6
- Pages
- 69-85
- ISSN
- 1066-033X (ISSN-L)
- 1941-000X
- OpenAlex
- W2056629325
- Cited by
- 163
- References
- 2
- FWCI
- 11.98
- 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.