𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The sample complexity of worst-case identification of FIR linear systems

✍ Scribed by Munther A Dahleh; Theodore V Theodosopoulos; John N Tsitsiklis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
588 KB
Volume
20
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst-case identification of nonlinear f
Worst-case identification of nonlinear fading memory systems
✍ Munther A. Dahleh; Eduardo D. Sontag; David N.C. Tse; John N. Tsitsiklis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 786 KB

In this paper, the problem of asymptotic identification for fading memory systems in the presence of bounded noise is studied. For any experiment, the worst-case error is characterized in terms of the diameter of the worst-case uncertainty set. Optimal inputs that minimize the radius of uncertainty

Worst-case optimality of smoothing algor
Worst-case optimality of smoothing algorithms for parametric system identification
✍ Roberto Tempo πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 439 KB

We study parametric identification of uncertain systems in a deterministic setting. We assume that the problem data and the linearly parameterized system model are given. In the presence of a priori information and norm-bounded noise, we design optimal worst-case algorithms. In particular, we study