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,694 papers · 148 categories

Trend · papers per month

244488731975 · Jun 202019922001200920172026
48 results for news tensor

In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a biased random way, only O(n1.5/ε2)O(n^{1.5}/ε^2) of the possible n3n^3 elements while s…

2015-02-17abs ↗pdf ↗

New method tackles non-smooth tensor data for better recovery.

problem Non-smooth changes in tensor data degrade traditional t-SVD methods.
method Learnable tensor nuclear norm, Alternating Proximal Multiplier Method (APMM), multi-objective tensor recovery framework.
result The proposed method effectively recovers tensor data with non-smooth changes.

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.

In all dimensions and arbitrary signature, we demonstrate the existence of a new local potential -- a double (2,3)-form -- for the Weyl curvature tensor, and more generally for all tensors with the symmetry properties of the Weyl curvature tensor. The classical four-dimensional Lanczos potential for a Weyl tensor -- a …

2004-08-20abs ↗pdf ↗

A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although they are not presented this way, can be viewed as spectral methods on matrices bui…

2018-11-02abs ↗pdf ↗

Paper proposes a new method for exact recovery in robust tensor principal component analysis.

problem Exact recovery of low-rank and sparse components in tensors.
method Proposes a new method based on tensor-tensor product and t-SVD to solve a convex optimization problem.
result Exact recovery achieved in a deterministic fashion without randomness assumptions.

Tensor networks improve anomaly detection at LHC for new physics.

problem Identifying new phenomena in proton collision events at LHC.
method Tensor network-based anomaly detection using Matrix Product State with an isometric feature map.
result Tensor networks outperform established quantum methods in identifying new phenomena.

A new tree method for tensor data improves regression accuracy.

problem Efficiently modeling tensor data for regression problems.
method Scalar-output regression tree models for scalar-on-tensor problems, and tensor-on-tensor problems using additive tree ensemble approaches.
result The tensor-input tree (TT) method outperforms tensor-input GP models in efficiency and accuracy.

The present study initially identified the generalized symmetric connections (α,β)(α,β) typed, which can be regarded as more generalised forms of quarter and semi-symmetric connections. The quarter and semi-symmetric connections are obtained respectively particularly when (α,β)=(1,0)(α,β)=(1,0) and (α,β)=(0,1)(α,β)=(0,1) are taken into con…

2018-04-26abs ↗pdf ↗

In Lorentzian manifolds of any dimension the concept of causal tensors is introduced. Causal tensors have positivity properties analogous to the so-called ``dominant energy condition''. Further, it is shown how to build, from ANY given tensor AA, a new tensor quadratic in AA and ``positive'', in the sense that it is …

2002-02-20abs ↗pdf ↗

Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …

2012-04-05abs ↗pdf ↗

A new kernel improves tensor classification accuracy and reduces computation time.

problem Challenges in classifying high-dimensional tensor data.
method Proposes a weighted subspace exponential kernel based on Tucker decomposition.
result The new kernel outperforms existing methods in accuracy and computational efficiency.

New method estimates tensors from noisy data with missing entries.

problem Tensor estimation from noisy observations with missing entries.
method Sign series representation for tensor completion, addressing low- and high-rank signals.
result Excess risk bounds, estimation error rates, and sample complexities established.

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), NonnegativeMatrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (Smo…

2013-05-02abs ↗pdf ↗

New model improves portfolio selection by analyzing tensor data.

problem Improving portfolio selection through better analysis of style returns.
method Introducing a tensor dynamic conditional correlation (TDCC) model with trace-normalization and dimension-normalization.
result The TDCC model enhances portfolio selection across multiple markets.

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 ↗

New algorithm for tensor decomposition and Gaussian mixture models.

problem Efficiently decompose overcomplete order-3 tensors and estimate parameters of Gaussian mixtures.
method Proposes Jennrich's algorithm adapted for tensor decomposition and Gaussian mixture models.
result Efficient algorithm for decomposing symmetric overcomplete order-3 tensors and estimating parameters of Gaussian mixtures.

We extend a classical result by Derdzinski and Shen, on the restrictions imposed on the Riemann tensor by the existence of a nontrivial Codazzi tensor. The new conditions of the theorem include Codazzi tensors (i.e. closed 1-forms) as well as tensors with gauged Codazzi condition (i.e. "recurrent 1-forms"), typical of …

2011-01-21abs ↗pdf ↗

New concentration inequalities for tensors with heavy-tailed coefficients.

problem Developing bounds for Euclidean functions of tensors with sub-Weibull distributions.
method Extending concentration inequalities to sub-Weibull random tensors, using new inequalities for heavy-tailed random variables and martingale analysis.
result Established a phase transition between sub-gaussian and heavy-tailed regimes for Euclidean functions of tensors.

We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed context and, in particular, enriches it with new natural operations. Applications wi…

2006-05-04abs ↗pdf ↗

Unified approach to tensor PCA and related problems using tensor cumulants.

problem Statistical inference on invariant distributions, particularly tensor PCA.
method Definition and analysis of tensor cumulants to unify and extend previous results.
result Unified explanation of hardness and subexponential-time algorithms for tensor PCA.

New framework extracts useful information from tensor data with structural properties.

problem Extract useful information from tensor data with structural properties.
method Proposed an additive tensor decomposition (ATD) framework and an ADMM algorithm to solve the high dimensional optimization problem.
result Versatile and effective framework demonstrated in simulations and real medical image analysis.

Using Hilbert's criterion, we consider the stress-energy tensor associated to the bienergy functional. We show that it derives from a variational problem on metrics and exhibit the peculiarity of dimension four. First, we use this tensor to construct new examples of biharmonic maps, then classify maps with vanishing or…

2006-02-01abs ↗pdf ↗

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 ↗

New method combines Monte Carlo and tensor networks for solving complex equations.

problem Solving high-dimensional partial differential equations efficiently.
method Uses Monte Carlo simulations and tensor train sketching for updates and re-estimations.
result Demonstrates versatility and efficacy in solving specific equations.

Given the Riemann, or the Weyl, or a generalized curvature tensor K, a symmetric tensor bijb_{ij} is named `compatible' with the curvature tensor if bimKjklm+bjmKkilm+bkmKijlm=0b_i{}^m K_{jklm} + b_j{}^m K_{kilm} + b_k{}^m K_{ijlm} = 0. Amongst showing known and new properties, we prove that they form a special Jordan algebra, i.e. the symmetriz…

2019-10-08abs ↗pdf ↗

A second-order differential identity for the Riemann tensor is obtained, on a manifold with symmetric connection. Several old and some new differential identities for the Riemann and Ricci tensors descend from it. Applications to manifolds with Recurrent or Symmetric structures are discussed. The new structure of K-rec…

2008-02-05abs ↗pdf ↗

Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap between statistical guarantee and computational efficiency for existing tensor clust…

2017-08-24abs ↗pdf ↗