An optimization approach for dynamical Tucker tensor approximation
From MaRDI portal
Publication:2211045
Abstract: An optimization-based approach for the Tucker tensor approximation of parameter-dependent data tensors and solutions of tensor differential equations with low Tucker rank is presented. The problem of updating the tensor decomposition is reformulated as fitting problem subject to the tangent space without relying on an orthogonality gauge condition. A discrete Euler scheme is established in an alternating least squares framework, where the quadratic subproblems reduce to trace optimization problems, that are shown to be explicitly solvable and accessible using SVD of small size. In the presence of small singular values, instability for larger ranks is reduced, since the method does not need the (pseudo) inverse of matricizations of the core tensor. Regularization of Tikhonov type can be used to compensate for the lack of uniqueness in the tangent space. The method is validated numerically and shown to be stable also for larger ranks in the case of small singular values of the core unfoldings. Higher order explicit integrators of Runge-Kutta type can be composed.
Recommendations
- Dynamical Tensor Approximation
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- Time integration of rank-constrained Tucker tensors
- Dynamical approximation by hierarchical Tucker and tensor-train tensors
- Time integration of tensor trains
Cites work
- A literature survey of low-rank tensor approximation techniques
- A projector-splitting integrator for dynamical low-rank approximation
- Discretized dynamical low-rank approximation in the presence of small singular values
- Dynamical Low‐Rank Approximation
- Dynamical Tensor Approximation
- Dynamical low-rank approximation: Applications and numerical experiments
- Efficient MATLAB Computations with Sparse and Factored Tensors
- FFT-based Kronecker product approximation to micromagnetic long-range interactions
- Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation
- On local convergence of alternating schemes for optimization of convex problems in the tensor train format
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Recompression of Hadamard Products of Tensors in Tucker Format
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- Time integration in the multiconfiguration time-dependent Hartree method of molecular quantum dynamics
- Time integration of rank-constrained Tucker tensors
- Time integration of tensor trains
- Trace optimization and eigenproblems in dimension reduction methods.
Cited in
(3)
This page was built for publication: An optimization approach for dynamical Tucker tensor approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211045)