Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

94188282376 · Jun 202019922001200920172026
48 results for minimal norm tensors

The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.

problem Understanding curvature tensors and their minimal norm.
method Analyzing minimal norm tensors for third and fourth covariant tensors, including Riemannian curvature and divergence.
result Weyl tensor and Cotten tensor are identified as minimal norm tensors of Riemannian curvature and divergence tensors, respectively.

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…

2017-07-25abs ↗pdf ↗

SAM improves generalization in overparameterized models, but its behavior in tensorized models is less understood.

problem Understanding the implicit regularization of SAM in tensorized models.
method Scale-invariance analysis and gradient flow analysis to derive Norm Deviation as a measure of core norm imbalance, and propose Deviation-Aware Scaling (DAS).
result DAS achieves competitive or improved performance over SAM, while offering reduced computational overhead.

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…

2014-05-07abs ↗pdf ↗

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…

2013-07-22abs ↗pdf ↗

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…

2018-06-07abs ↗pdf ↗

We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-rr, order-dd, N×N××NN \times N \times \cdots \times N tensor where r=O(1)r=O(1), the best sampling complexity that was achieved is O(Nd2)O(N^{\frac{d}{2}}), which is obtained by solving a tensor nuclear-norm minimizatio…

2017-11-14abs ↗pdf ↗

New tensor recovery method improves efficiency under strict complementarity.

problem Efficiently recovering low-rank tensors using tensor nuclear norm.
method Developed strict complementarity condition for tensor nuclear norm ball and applied to gradient methods.
result Standard gradient methods achieve linear convergence and nearly linear runtime under strict complementarity.

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…

2019-10-26abs ↗pdf ↗

Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.

problem Imputation of corrupted or incomplete traffic data.
method Truncated tensor Schatten p-norm (TSpN) for spatiotemporal traffic data imputation.
result The proposed method outperforms other state-of-the-art tensor-based imputation models in various missing cases.

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 O(nK/2/2)O(n^{\lceil K/2 \rceil /2}) for recovering a KKth order rank one tensor of size n××nn\times \cdots \times n by recursive unfolding. In this paper, we first improve…

2015-03-18abs ↗pdf ↗

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…

2012-01-09abs ↗pdf ↗

A new method for traffic data imputation considering spatiotemporal correlations.

problem Traffic data imputation, especially for high-level missing scenarios.
method Spatiotemporal regularized Tucker decomposition approach.
result The proposed method outperforms existing methods on real-world traffic datasets.

Study on tensor nuclear norm's decomposability and subdifferential.

problem Understanding tensor nuclear norm in higher-order tensors.
method Showed decomposability over specific subspaces, derived subdifferential inclusions, and studied subgradients.
result Established the statistical performance of tensor robust principal component analysis.

New algorithm solves 0\ell_0-norm constrained multilinear logistic regression for tensor data.

problem Non-convex and nonsmooth 0\ell_0-norm constraints in multilinear logistic regression.
method APALM+^+ method for globally convergent optimization.
result APALM+^+ ensures convergence to a first-order critical point.

The paper tackles tensor factorization and completion from noisy data.

problem Sparse nonnegative tensor factorization and completion from partial and noisy observations.
method Minimizes the sum of maximum likelihood estimation and tensor 0\ell_0 norm with nonnegativity constraints.
result Error bounds and minimax lower bounds are established for the proposed model.

A method predicts GNS of transformer layers using normalization layer norms.

problem Estimating gradient noise scale with minimal variance.
method Simultaneously compute per-example gradient norms and parameter gradients.
result Total GNS is predicted well by normalization layer GNS.

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-tt tensor…

2019-10-23abs ↗pdf ↗

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…

2017-05-15abs ↗pdf ↗

Proposes GTTN for discovering all low-rank structures in deep multi-task learning.

problem Discovering all low-rank structures among tasks in deep multi-task models.
method Introduces GTTN, a convex combination of matrix trace norms of all tensor flattenings, to automatically determine the importance of components.
result Demonstrates the effectiveness of GTTN on real-world datasets.

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…

2013-09-13abs ↗pdf ↗

New algorithms solve tensor problems with random components using SDP.

problem Exact tensor nuclear norm, decomposition, and completion for random tensors.
method Degree-4 Sum of Squares (SOS) semidefinite programs.
result Exact solutions for tensor nuclear norm, decomposition, and completion with random asymmetric components.

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,…

2013-03-26abs ↗pdf ↗

New tensor formulation reveals gradient flow's bias in linear neural networks.

problem Understanding implicit bias in linear neural network training.
method Tensor formulation of neural networks, including fully-connected, diagonal, and convolutional networks.
result Gradient flow on linear tensor networks converges to solutions of specific optimization problems.

We show that the spectral norm of a random n1×n2××nKn_1\times n_2\times \cdots \times n_K tensor (or higher-order array) scales as O((k=1Knk)log(K))O\left(\sqrt{(\sum_{k=1}^{K}n_k)\log(K)}\right) 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…

2014-07-07abs ↗pdf ↗

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…

2018-06-17abs ↗pdf ↗

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…

2019-07-09abs ↗pdf ↗

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 …

2017-07-05abs ↗pdf ↗

Paper proposes LATC for multivariate time series prediction and missing data imputation.

problem Large-scale, incomplete, and corrupted multivariate time series data.
method Transforms multivariate time series into a tensor structure, models global and local trends, and uses autoregressive norm.
result Integration of global and local trends improves missing data imputation and rolling prediction.

Study rigidity of minimal Legendrian submanifolds in spheres via eigenvalues.

problem Rigidity of minimal Legendrian submanifolds in unit Euclidean spheres.
method Using Lu's inequality and eigenvalues of fundamental matrices to establish pinching theorems.
result Optimal pinching theorem and rigidity theorem for submanifolds of all dimensions.

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…

2018-10-16abs ↗pdf ↗