اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRecovering orthogonal tensors under arbitrarily strong, but locally correlated, noise
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by noise vectors with components that are correlated locally, i.e., with nearby components. We show that this deterministic tensor completion problem has the unusual property that it can be solved in polynomial time if the rank of the tensor is sufficiently large. This is the polar opposite of the low-rank assumptions of typical low-rank tensor and matrix completion settings. We show that our problem can be solved through a system of coupled Sylvester-like equations and show how to accelerate their solution by an alternating solver. This enables recovery even with a substantial number of missing entries, for instance for $n$-dimensional tensors of rank $n$ with up to $40%$ missing entries.
قيم البحث
اقرأ أيضاً
We study the problem of finding orthogonal low-rank approximations of symmetric tensors. In the case of matrices, the approximation is a truncated singular value decomposition which is then symmetric. Moreover, for rank-one approximations of tensors
of any dimension, a classical result proven by Banach in 1938 shows that the optimal approximation can always be chosen to be symmetric. In contrast to these results, this article shows that the corresponding statement is no longer true for orthogonal approximations of higher rank. Specifically, for any of the four common notions of tensor orthogonality used in the literature, we show that optimal orthogonal approximations of rank greater than one cannot always be chosen to be symmetric.
The notion of a tensor captures three great ideas: equivariance, multilinearity, separability. But trying to be three things at once makes the notion difficult to understand. We will explain tensors in an accessible and elementary way through the len
s of linear algebra and numerical linear algebra, elucidated with examples from computational and applied mathematics.
We establish a general theory of optimal strong error estimation for numerical approximations of a second-order parabolic stochastic partial differential equation with monotone drift driven by a multiplicative infinite-dimensional Wiener process. The
equation is spatially discretized by Galerkin methods and temporally discretized by drift-implicit Euler and Milstein schemes. By the monotone and Lyapunov assumptions, we use both the variational and semigroup approaches to derive a spatial Sobolev regularity under the $L_omega^p L_t^infty dot H^{1+gamma}$-norm and a temporal Holder regularity under the $L_omega^p L_x^2$-norm for the solution of the proposed equation with an $dot H^{1+gamma}$-valued initial datum for $gammain [0,1]$. Then we make full use of the monotonicity of the equation and tools from stochastic calculus to derive the sharp strong convergence rates $O(h^{1+gamma}+tau^{1/2})$ and $O(h^{1+gamma}+tau^{(1+gamma)/2})$ for the Galerkin-based Euler and Milstein schemes, respectively.
We present a paradigm for developing arbitrarily high order, linear, unconditionally energy stable numerical algorithms for gradient flow models. We apply the energy quadratization (EQ) technique to reformulate the general gradient flow model into an
equivalent gradient flow model with a quadratic free energy and a modified mobility. Given solutions up to $t_n=n Delta t$ with $Delta t$ the time step size, we linearize the EQ-reformulated gradient flow model in $(t_n, t_{n+1}]$ by extrapolation. Then we employ an algebraically stable Runge-Kutta method to discretize the linearized model in $(t_n, t_{n+1}]$. Then we use the Fourier pseudo-spectral method for the spatial discretization to match the order of accuracy in time. The resulting fully discrete scheme is linear, unconditionally energy stable, uniquely solvable, and may reach arbitrarily high order. Furthermore, we present a family of linear schemes based on prediction-correction methods to complement the new linear schemes. Some benchmark numerical examples are given to demonstrate the accuracy and efficiency of the schemes.
A third order real tensor is mapped to a special f-diagonal tensor by going through Discrete Fourier Transform (DFT), standard matrix SVD and inverse DFT. We call such an f-diagonal tensor an s-diagonal tensor. An f-diagonal tensor is an s-diagonal t
ensor if and only if it is mapped to itself in the above process. The third order tensor space is partitioned to orthogonal equivalence classes. Each orthogonal equivalence class has a unique s-diagonal tensor. Two s-diagonal tensors are equal if they are orthogonally equivalent. Third order tensors in an orthogonal equivalence class have the same tensor tubal rank and T-singular values. Four meaningful necessary conditions for s-diagonal tensors are presented. Then we present a set of sufficient and necessary conditions for s-diagonal tensors. Such conditions involve a special complex number. In the cases that the dimension of the third mode of the considered tensor is $2, 3$ and $4$, we present direct sufficient and necessary conditions which do not involve such a complex number.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
