An Efficient Algorithm for Tensor Learning
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912768073924608 |
|---|---|
| author | Schmitz, Leonard |
| author_facet | Schmitz, Leonard |
| contents | We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an order of magnitude. It relies on symbolic multilinear algebra and stabilizers of group actions via matrix-tensor congruence. We apply randomized transformation techniques that avoid the task of solving nonlinear polynomial systems associated to degenerate paths, and accompany our methods with an efficient implementation in the computer algebra system OSCAR. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_14218 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Efficient Algorithm for Tensor Learning Schmitz, Leonard Rings and Algebras We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an order of magnitude. It relies on symbolic multilinear algebra and stabilizers of group actions via matrix-tensor congruence. We apply randomized transformation techniques that avoid the task of solving nonlinear polynomial systems associated to degenerate paths, and accompany our methods with an efficient implementation in the computer algebra system OSCAR. |
| title | An Efficient Algorithm for Tensor Learning |
| topic | Rings and Algebras |
| url | https://arxiv.org/abs/2512.14218 |