The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in recovering a low-Tucker-rank sampled tensor. In this paper, we propose to recover…
In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels of coherence, which allows us to leverage the incoherence of a tensor. In particular, we show that …
SAM improves generalization in overparameterized models, but its behavior in tensorized models is less understood.
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors i…
The paper improves tensor completion bounds using spectral gap.
Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the tensor. We show that this approach can be substantially suboptimal: reliably recov…
The recent proposed Tensor Nuclear Norm (TNN) [Lu et al., 2016; 2018a] is an interesting convex penalty induced by the tensor SVD [Kilmer and Martin, 2011]. It plays a similar role as the matrix nuclear norm which is the convex surrogate of the matrix rank. Considering that the TNN based Tensor Robust PCA [Lu et al., 2…
We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-, order-, tensor where , the best sampling complexity that was achieved is , which is obtained by solving a tensor nuclear-norm minimizatio…
New tensor recovery method improves efficiency under strict complementarity.
Tensor completion and robust principal component analysis have been widely used in machine learning while the key problem relies on the minimization of a tensor rank that is very challenging. A common way to tackle this difficulty is to approximate the tensor rank with the norm of singular values based on its …
Recently, the \textit{Tensor Nuclear Norm~(TNN)} regularization based on t-SVD has been widely used in various low tubal-rank tensor recovery tasks. However, these models usually require smooth change of data along the third dimension to ensure their low rank structures. In this paper, we propose a new definition of da…
New algorithm improves tensor completion performance.
We study stability and local minimizing properties of - norms of Riemannian curvature tensor denoted by by variational methods. We compute the Hessian of at compact rank 1 symmetric spaces and prove that they are stable for for certain values of p > 2. A similar resu…
Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.
New model fills in missing traffic data efficiently.
We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio for recovering a th order rank one tensor of size by recursive unfolding. In this paper, we first improve…
We investigate stability and local minimizing properties of the Riemannian functional defined by the L^p norm of the curvature tensor on the space of Riemannian metrics on a closed manifold. Riemannian metrics with constant curvature and products of such metrics are critical points of this functional. We prove that the…
A new method for traffic data imputation considering spatiotemporal correlations.
Gradient descent promotes low-rank solutions in tensor completion.
Study on tensor nuclear norm's decomposability and subdifferential.
New algorithm solves -norm constrained multilinear logistic regression for tensor data.
In this paper, we consider the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is based on the recently proposed tensor-tensor product (or t-product). Induced by the t-product, we first rigorously deduce the tensor sp…
The paper tackles tensor factorization and completion from noisy data.
A method predicts GNS of transformer layers using normalization layer norms.
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows that the number of samples required to approximately recover an order- tensor…
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that …
We propose a set of convex low rank inducing norms for a coupled matrices and tensors (hereafter coupled tensors), which shares information between matrices and tensors through common modes. More specifically, we propose a mixture of the overlapped trace norm and the latent norms with the matrix trace norm, and then, w…
Proposes GTTN for discovering all low-rank structures in deep multi-task learning.
Paper proposes a new model for noisy tensor completion.
We theoretically and experimentally investigate tensor-based regression and classification. Our focus is regularization with various tensor norms, including the overlapped trace norm, the latent trace norm, and the scaled latent trace norm. We first give dual optimization methods using the alternating direction method …
Let (N,J) be a real 2n-dimensional nilpotent Lie group endowed with an invariant complex structure. A left-invariant Riemannian metric on N compatible with J is said to be minimal, if it minimizes the norm of the invariant part of the Ricci tensor among all compatible metrics on (N,J) with the same scalar curvature. In…
New algorithms solve tensor problems with random components using SDP.
RTC-GTNLN model recovers traffic data from missing values and noise.
We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature on structured sparsity. Based on the properties of the structured Schatten norms,…
New tensor formulation reveals gradient flow's bias in linear neural networks.
We show that the spectral norm of a random tensor (or higher-order array) scales as under some sub-Gaussian assumption on the entries. The proof is based on a covering number argument. Since the spectral norm is dual to the tensor…
The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor spectral norm, tensor nuclear norm [C. Lu, et al., 2018] and many others. The line…
In this paper, a new definition of tensor p-shrinkage nuclear norm (p-TNN) is proposed based on tensor singular value decomposition (t-SVD). In particular, it can be proved that p-TNN is a better approximation of the tensor average rank than the tensor nuclear norm when p < 1. Therefore, by employing the p-shrinkage nu…
The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms have been proposed where statistically optimal estimates of the singular subspaces …
Proves Ricci flow extensibility with integral norms.
Paper proposes LATC for multivariate time series prediction and missing data imputation.
Study rigidity of minimal Legendrian submanifolds in spheres via eigenvalues.
We provide a parametric construction in terms of minimal surfaces of the Euclidean submanifolds of codimension two and arbitrary dimension that attain equality in an inequality due to De Smet, Dillen, Verstraelen and Vrancken. The latter involves the scalar curvature, the norm of the normal curvature tensor and the len…
On four-dimensional closed manifolds we introduce a class of canonical Riemannian metrics, that we call weak harmonic Weyl metrics, defined as critical points in the conformal class of a quadratic functional involving the norm of the divergence of the Weyl tensor. This class includes Einstein and, more in general, harm…
Signals are generally modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging. For fast data acquisition or other inevitable reasons, however, only a small amount of samples may be acquired and thus how to recover the full signal becomes an active research topic. Bu…
In this paper, we show that the complete scalar-flat Kahler metrics constructed by Abreu and the author on strictly unbounded toric 4-dimensional orbifolds have finite norm of the full Riemannian tensor. In particular, this answers a question of Donaldon's on the corresponding Generalized Taub-NUT metric on …
We study the deformation of the three-dimensional conformal structures by the Ricci flow. We drive the evolution equation of Cotton-York tensor and the L1-norm of it under the Ricci flow. In particular, we investigate the behavior of the L1-norm of the Cotton-York tensor under the Ricci flow on three-dimensional simply…