2019 IEEE 58th Conference on Decision and Control (CDC) 2019
DOI: 10.1109/cdc40024.2019.9029189
|View full text |Cite
|
Sign up to set email alerts
|

Learning Feature Maps of the Koopman Operator: A Subspace Viewpoint

Abstract: The Koopman operator was recently shown to be a useful method for nonlinear system identification and controller design. However, the scalability of current datadriven approaches is limited by the selection of feature maps. In this paper, we present a new data-driven framework for learning feature maps of the Koopman operator by introducing a novel separation method. The approach provides a flexible interface between diverse machine learning algorithms and well-developed linear subspace identification methods,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 32 publications
0
7
0
Order By: Relevance
“…Thus, for K t f with eigenvalues e λ1t and e λ2t , φ 1 φ 2 is also an eigenfunction of K t f with eigenvalue e (λ1+λ2)t . Definition 3.1 ( [17]): Consider {E p } p∈N to be the eigenpair group of the Koopman operator semigroup K t A of a system ẏ = Ay with its minimal generator G E : (10) where m i ∈ N 0 . Then, the elements of G E are principle eigenvalues with corresponding eigenfunctions of K t A in {E p } p∈N .…”
Section: Modeling Via Equivalence Relationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, for K t f with eigenvalues e λ1t and e λ2t , φ 1 φ 2 is also an eigenfunction of K t f with eigenvalue e (λ1+λ2)t . Definition 3.1 ( [17]): Consider {E p } p∈N to be the eigenpair group of the Koopman operator semigroup K t A of a system ẏ = Ay with its minimal generator G E : (10) where m i ∈ N 0 . Then, the elements of G E are principle eigenvalues with corresponding eigenfunctions of K t A in {E p } p∈N .…”
Section: Modeling Via Equivalence Relationsmentioning
confidence: 99%
“…Then, the elements of G E are principle eigenvalues with corresponding eigenfunctions of K t A in {E p } p∈N . Less formally, principle eigenpairs form the minimal set used to construct arbitrarily many other eigenpairs (10).…”
Section: Modeling Via Equivalence Relationsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, these aforementioned methods mainly consider onestep forward prediction either due to the formulation of the learning problem or due to numerical stability, which results in a relatively inaccurate long-term prediction. A link between the Koopman operator and the subspace identification is observed in [33], which enables a learning scheme of long-term prediction. However, this method still suffers from the lack of scalability and the numerical limitation of the subspace identification [34].…”
Section: Introductionmentioning
confidence: 99%
“…However, presupposing a suitable basis of functions is a very strong assumption for linear time-invariant prediction -leading to only locally accurate models. Other approaches learn the features simultaneously (Li et al, 2017) or in a decoupled manner (Lian and Jones, 2019) leveraging the expressive power of neural networks or kernel methods, but often lack theoretical justification. Instead of arbitrary feature maps, Korda and Mezić (2020) learn the eigenfunctions of the operator for linear prediction -which is a promising proposition.…”
Section: Introductionmentioning
confidence: 99%