2018
DOI: 10.1080/00207179.2018.1458158
|View full text |Cite
|
Sign up to set email alerts
|

System identification method inheriting steady-state characteristics of existing model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…In formal methods literature, the model learning problems were studied under different names, like system identification [32], grammatical inference [33], regular inference [34], regular extrapolation [35], model learning [36], or active automata learning [37], etc. We do not distinguish these names, sometimes we use them interchangeably, and here we just use the term model learning or learning model instead.…”
Section: Taxonomy Of Learning Algorithms In Formal Methodsmentioning
confidence: 99%
“…In formal methods literature, the model learning problems were studied under different names, like system identification [32], grammatical inference [33], regular inference [34], regular extrapolation [35], model learning [36], or active automata learning [37], etc. We do not distinguish these names, sometimes we use them interchangeably, and here we just use the term model learning or learning model instead.…”
Section: Taxonomy Of Learning Algorithms In Formal Methodsmentioning
confidence: 99%
“…Problem 2. Given a positive constant γ and data matrices (U k , Y k , Ψ k , Ψ k+1 ), we solve the following optimization problem: min P,A,B,C J(A, B, C) sub to (7), (8).…”
Section: Problem Settingmentioning
confidence: 99%
“…Noting that J(A, B, C) = J(P −1 M, P −1 N, C), the cost function is no more convex in decision variables (P, M, N, C). Therefore, the problem of minimizing J(P −1 M, P −1 N, C) subjected to (7) and ( 13) is still nonconvex. In the following, we address the approximation of the non-convex problem into a convex one.…”
Section: Convex Approximation Of Problemmentioning
confidence: 99%
See 2 more Smart Citations