Greedy construction of quadratic manifolds for nonlinear dimensionality reduction and nonlinear model reduction
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913608711012352 |
|---|---|
| author | Schwerdtner, Paul Peherstorfer, Benjamin |
| author_facet | Schwerdtner, Paul Peherstorfer, Benjamin |
| contents | Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the training data; however, linear approximations in subspaces spanned by the leading principal components alone can miss information that are necessary for the quadratic correction terms to be efficient. In this work, we propose a greedy method that constructs subspaces from leading as well as later principal components so that the corresponding linear approximations can be corrected most efficiently with quadratic terms.
Properties of the greedily constructed manifolds allow applying linear algebra reformulations so that the greedy method scales to data points with millions of dimensions. Numerical experiments demonstrate that an orders of magnitude higher accuracy is achieved with the greedily constructed quadratic manifolds compared to manifolds that are based on the leading principal components alone. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_06732 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Greedy construction of quadratic manifolds for nonlinear dimensionality reduction and nonlinear model reduction Schwerdtner, Paul Peherstorfer, Benjamin Numerical Analysis 65F55, 62H25, 65F30, 68T09 Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the training data; however, linear approximations in subspaces spanned by the leading principal components alone can miss information that are necessary for the quadratic correction terms to be efficient. In this work, we propose a greedy method that constructs subspaces from leading as well as later principal components so that the corresponding linear approximations can be corrected most efficiently with quadratic terms. Properties of the greedily constructed manifolds allow applying linear algebra reformulations so that the greedy method scales to data points with millions of dimensions. Numerical experiments demonstrate that an orders of magnitude higher accuracy is achieved with the greedily constructed quadratic manifolds compared to manifolds that are based on the leading principal components alone. |
| title | Greedy construction of quadratic manifolds for nonlinear dimensionality reduction and nonlinear model reduction |
| topic | Numerical Analysis 65F55, 62H25, 65F30, 68T09 |
| url | https://arxiv.org/abs/2403.06732 |