TENSOR TRAIN CONSTRUCTION FROM TENSOR ACTIONS, WITH APPLICATION TO COMPRESSION OF LARGE HIGH ORDER DERIVATIVE TENSORS

被引:11
作者
Alger, Nick [1 ]
Chen, Peng [1 ]
Ghattas, Omar [1 ]
机构
[1] Univ Texas Austin, Oden Inst Computat Engn & Sci, Austin, TX 78712 USA
基金
美国国家科学基金会;
关键词
tensor; tensor train; tensor action; randomized linear algebra; higher order derivative; uncertainty quantification; APPROXIMATION; REDUCTION; ALGORITHMS; OPTIMIZATION; UNCERTAINTY; MATRICES; SYSTEMS; TUCKER; FLOW;
D O I
10.1137/20M131936X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present a method for converting tensors into the tensor train format based on actions of the tensor as a vector-valued multilinear function. Existing methods for constructing tensor trains require access to "array entries" of the tensor and are therefore inefficient or computationally prohibitive if the tensor is accessible only through its action, especially for high order tensors. Our method permits efficient tensor train compression of large high order derivative tensors for nonlinear mappings that are implicitly defined through the solution of a system of equations. Array entries of these derivative tensors are not directly accessible, but actions of these tensors can be computed efficiently via a procedure that we discuss. Such tensors are often amenable to tensor train compression in theory, but until now no efficient algorithm existed to convert them into tensor train format. We demonstrate our method by compressing a Hilbert tensor of size 41 x 42 x 43 x 44 x 45, and by forming high order (up to fifth order derivatives/sixth order tensors) Taylor series surrogates of the noise-whitened parameter-to-output map for a stochastic partial differential equation with boundary output.
引用
收藏
页码:A3516 / A3539
页数:24
相关论文
共 47 条
[21]  
Gelss P, 2017, PhD thesis
[22]  
GRASEDYCK L., 2013, GAMM-Mitteilungen, P53, DOI DOI 10.1002/GAMM.201310004
[23]   Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions [J].
Halko, N. ;
Martinsson, P. G. ;
Tropp, J. A. .
SIAM REVIEW, 2011, 53 (02) :217-288
[24]   Most Tensor Problems Are NP-Hard [J].
Hillar, Christopher J. ;
Lim, Lek-Heng .
JOURNAL OF THE ACM, 2013, 60 (06)
[25]   THE ALTERNATING LINEAR SCHEME FOR TENSOR OPTIMIZATION IN THE TENSOR TRAIN FORMAT [J].
Holtz, Sebastian ;
Rohwedder, Thorsten ;
Schneider, Reinhold .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (02) :A683-A713
[26]   A Randomized Tensor Train Singular Value Decomposition [J].
Huber, Benjamin ;
Schneider, Reinhold ;
Wolf, Sebastian .
COMPRESSED SENSING AND ITS APPLICATIONS, 2017, :261-290
[27]   Scalable and efficient algorithms for the propagation of uncertainty from data through inference to prediction for large-scale problems, with application to flow of the Antarctic ice sheet [J].
Isaac, Tobin ;
Petra, Noemi ;
Stadler, Georg ;
Ghattas, Omar .
JOURNAL OF COMPUTATIONAL PHYSICS, 2015, 296 :348-368
[28]   Direct Solution of the Chemical Master Equation Using Quantized Tensor Trains [J].
Kazeev, Vladimir ;
Khammash, Mustafa ;
Nip, Michael ;
Schwab, Christoph .
PLOS COMPUTATIONAL BIOLOGY, 2014, 10 (03)
[29]   Low-rank tensor structure of linear diffusion operators in the TT and QTT formats [J].
Kazeev, Vladimir ;
Reichmann, Oleg ;
Schwab, Christoph .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 438 (11) :4204-4221
[30]   O(dlog N)-Quantics Approximation of N-d Tensors in High-Dimensional Numerical Modeling [J].
Khoromskij, Boris N. .
CONSTRUCTIVE APPROXIMATION, 2011, 34 (02) :257-280