Iterative algorithms for the post-processing of high-dimensional data
From MaRDI portal
Abstract: Scientific computations or measurements may result in huge volumes of data. Often these can be thought of representing a real-valued function on a high-dimensional domain, and can be conceptually arranged in the format of a tensor of high degree in some truncated or lossy compressed format. We look at some common post-processing tasks which are not obvious in the compressed format, as such huge data sets can not be stored in their entirety, and the value of an element is not readily accessible through simple look-up. The tasks we consider are finding the location of maximum or minimum, or minimum and maximum of a function of the data, or finding the indices of all elements in some interval --- i.e. level sets, the number of elements with a value in such a level set, the probability of an element being in a particular level set, and the mean and variance of the total collection. The algorithms to be described are fixed point iterations of particular functions of the tensor, which will then exhibit the desired result. For this, the data is considered as an element of a high degree tensor space, although in an abstract sense, the algorithms are independent of the representation of the data as a tensor. All that we require is that the data can be considered as an element of an associative, commutative algebra with an inner product. Such an algebra is isomorphic to a commutative sub-algebra of the usual matrix algebra, allowing the use of matrix algorithms to accomplish the mentioned tasks. We allow the actual computational representation to be a lossy compression, and we allow the algebra operations to be performed in an approximate fashion, so as to maintain a high compression level. One such example which we address explicitly is the representation of data as a tensor with compression in the form of a low-rank representation.
Recommendations
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 3580810 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- A continuous analogue of the tensor-train decomposition
- A literature survey of low-rank tensor approximation techniques
- A new scheme for the tensor representation
- A new truncation strategy for the higher-order singular value decomposition
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- A subspace lanczos method for the generalized symmetric eigenproblem
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
- Analysis of parametric models. Linear methods and approximations
- Application of hierarchical matrices for computing the Karhunen-Loève expansion
- Approximate iterations for structured matrices
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Black box approximation of tensors in hierarchical Tucker format
- Black box low tensor-rank approximation using fiber-crosses
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computable error bounds for the generalized symmetric eigenproblem
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Constructive representation of functions in low-rank tensor formats
- Convergence analysis of projected fixed-point iteration on a low-rank matrix manifold.
- Covariance regularity and \(\mathcal {H}\)-matrix approximation for rough random fields
- DMRG approach to fast linear algebra in the TT-format
- Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Functions of Matrices
- Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations
- Hand-waving and interpretive dance: an introductory course on tensor networks
- Hierarchical Singular Value Decomposition of Tensors
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- How to find a good submatrix
- Inverse problems: a Bayesian perspective
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- Kriging and spatial design accelerated by orders of magnitude: combining low-rank covariance approximations with FFT-techniques
- Linear algebra for tensor problems
- Low rank Tucker-type tensor approximation to classical potentials
- Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
- Numerical methods for large eigenvalue problems
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Orthogonal tensor decompositions
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Parallel tensor sampling in the hierarchical Tucker format
- Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
- Recompression of Hadamard Products of Tensors in Tucker Format
- Riemannian optimization for high-dimensional tensor completion
- Separation of variables for function generated high-order tensors
- Simultaneous state-time approximation of the chemical master equation using tensor product formats.
- Solving stochastic systems with low-rank tensor compression
- Spectral tensor-train decomposition
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- Stochastic finite elements: Computational approaches to stochastic partial differential equations
- Superfast Fourier transform using QTT approximation
- TT-cross approximation for multidimensional arrays
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor Spaces and Numerical Tensor Calculus
- Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format
- Tensor network states and geometry
- Tensor numerical methods in quantum chemistry
- Tensor numerical methods in scientific computing
- Tensor-product approximation to operators and functions in high dimensions
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor-train decomposition
- The Matrix Eigenvalue Problem
- The alternating linear scheme for tensor optimization in the tensor train format
- Use of tensor formats in elliptic eigenvalue problems.
- Variational calculus with sums of elementary tensors of fixed rank
- Verification of the cross 3D algorithm on quantum chemistry data
Cited in
(6)- Computing f‐divergences and distances of high‐dimensional probability density functions
- Propagation of uncertainties in density-driven flow
- Efficient probabilistic multi-fidelity calibration of a damage-plastic model for confined concrete
- Non-intrusive tensor reconstruction for high-dimensional random PDEs
- Collocation methods and beyond in non-linear mechanics
- Prospects of tensor-based numerical modeling of the collective electrostatics in many-particle systems
Describes a project that uses
Uses Software
This page was built for publication: Iterative algorithms for the post-processing of high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777570)
