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

51102153204 · Jun 202019922001200920172026
48 results for constraint tensor

One has not any conventional energy-momentum conservation law in Lagrangian field theory, but relations involving different stress-energy-momentum tensors associated with different connections. It is not obvious how to choose the true energy-momentum tensor. This problem is solved in the framework of the multimomentum …

1995-03-22abs ↗pdf ↗

Paper predicts multiple types of miRNA-disease associations using tensor decomposition.

problem Predicting miRNA-disease associations, especially multi-type ones.
method Represented miRNA-disease-type triplets as a tensor and used Tensor Decomposition methods.
result Tensor Decomposition methods improve a recent baseline by up to 38% in top-1 F1.

Develops TOFU for tensor bandits with low-rank structure.

problem Linear bandit models fail to capture high-dimensional, low-rank tensor structures.
method Develops TOFU, a tensor bandit algorithm that estimates low-dimensional subspaces and uses norm constraints.
result Improves regret bound by a multiplicative factor that grows exponentially in system order.

Paper proposes an algorithm for PARAFAC2-based CMTF models with various constraints.

problem Jointly analyze matrices and tensors with irregular/ragged data.
method Alternating Optimization (AO) and ADMM for fitting PARAFAC2-based CMTF models with various constraints.
result Accurately recovers underlying patterns using various constraints and linear couplings.

We establish a Penrose-Ward transform yielding a bijection between holomorphic principal 2-bundles over a twistor space and non-Abelian self-dual tensor fields on six-dimensional flat space-time. Extending the twistor space to supertwistor space, we derive sets of manifestly N=(1,0) and N=(2,0) supersymmetric non-Abeli…

2012-05-14abs ↗pdf ↗

New algorithm learns interpretable CP-basis from streaming tensor data under Markovian constraints.

problem Learning interpretable CP-basis from streaming tensor data under Markovian constraints.
method Online Tensor Factorization (OTF) with CANDECOMP/PARAFAC (CP) decomposition, proving convergence to stationary points.
result Algorithm converges almost surely to stationary points of the objective function under Markovian data generation.

Introduces nondecreasing rank for matrices and tensors, developing methods and applications.

problem Finding low-rank approximations for matrices and tensors with monotonic constraints.
method Developed a variant of hierarchical alternating least squares algorithm for finding low ND rank approximations.
result Low ND rank factorizations can be found and interpreted for real-world datasets.

Flexible framework for CMTF with ADMM for various constraints and couplings.

problem Challenges in data fusion from multiple sources with varying characteristics.
method Flexible algorithmic framework using AO and ADMM for various constraints, loss functions, and couplings.
result Accurate and computationally efficient results for various loss functions, including KL divergence.

Principal component analysis (PCA) is an unsupervised method for learning low-dimensional features with orthogonal projections. Multilinear PCA methods extend PCA to deal with multidimensional data (tensors) directly via tensor-to-tensor projection or tensor-to-vector projection (TVP). However, under the TVP setting, i…

2015-04-30abs ↗pdf ↗

Enhances tensor regression for interpretability and performance.

problem Interpreting and modeling multidimensional tensor data with structural heterogeneity.
method Generalized Nonnegative Structured Kruskal Tensor Regression (NS-KTR) with hybrid regularization and nonnegativity constraints.
result NS-KTR outperforms conventional methods in synthetic and real hyperspectral datasets.

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

The paper defines constraints for commuting endomorphisms in generalized tangent bundles.

problem Identifying constraints for commuting endomorphisms in generalized tangent bundles.
method Using Gröbner basis techniques to construct and study tensors forming ideals.
result Explicit construction and study of tensors forming ideals of commuting endomorphisms.

New method uses scalar-based models to approximate spherical tensors efficiently.

problem Efficiently approximating spherical tensors with equivariant functions.
method Expressing equivariant functions as the product of a scalar function and a small tensor basis.
result Approximations are fast, simple to implement, and accurate in practical settings.

GLSKF improves tensor completion by capturing both global and local variations.

problem Tensor completion with missing entries, especially in data with spatial or temporal side information.
method Integrates smoothness-constrained low-rank factorization with a locally correlated residual process.
result GLSKF achieves superior performance and scalability on real-world datasets.

Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlik…

2016-12-12abs ↗pdf ↗

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.

Tensor regression networks achieve high compression rate of neural networks while having slight impact on performances. They do so by imposing low tensor rank structure on the weight matrices of fully connected layers. In recent years, tensor regression networks have been investigated from the perspective of their comp…

2017-12-27abs ↗pdf ↗

Paper uses algebraic signatures to identify probabilistic structures in empirical data.

problem Identifying probabilistic structure from observed binomials in empirical probability tensors.
method Treating vanishing binomials as algebraic signatures, matching signatures to identify models without parameter estimation.
result The method successfully identified rank-one structures in real language data, revealing interpretable sets of words.

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.

New method parameterizes solutions to linearized vacuum constraints on Einstein manifolds.

problem Parameterizing solutions to linearized vacuum constraints on Einstein manifolds.
method Parameterize solutions using unconstrained potentials and shield linearized gravitational fields.
result Showed how to shield linearized gravitational fields without TT gauge for any value of cosmological constant.

Let (gˉ,kˉ)( \bar g, \bar k) be a solution to the maximal constraint equations of general relativity on the unit ball B1B_1 of R3\mathbb{R}^3. We prove that if (gˉ,kˉ)(\bar g,\bar k) is sufficiently close to the initial data for Minkowski space, then there exists an asymptotically flat solution (g,k)(g,k) on R3\mathbb{R}^3 that ext…

2016-09-28abs ↗pdf ↗

The goal of tensor completion is to fill in missing entries of a partially known tensor (possibly including some noise) under a low-rank constraint. This may be formulated as a least-squares problem. The set of tensors of a given multilinear rank is known to admit a Riemannian manifold structure, thus methods of Rieman…

2017-03-29abs ↗pdf ↗

We introduce a new parameterization method for deep learning layers using spectral tensor train decomposition.

problem Efficiency and stability in deep learning models with weight matrix compression.
method Spectral Tensor Train Parameterization (STTP) of weight matrices.
result Improved compression and training stability in neural networks.

Extends RRR to capture nonlinear interactions in multi-response regression.

problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.

PARAFAC2 has demonstrated success in modeling irregular tensors, where the tensor dimensions vary across one of the modes. An example scenario is modeling treatments across a set of patients with the varying number of medical encounters over time. Despite recent improvements on unconstrained PARAFAC2, its model factors…

2018-03-12abs ↗pdf ↗

Learning an encoding of feature vectors in terms of an over-complete dictionary or a information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision. In content based information retrieval using deep-learning classifiers, such encodings are learnt on the flattened la…

2017-03-18abs ↗pdf ↗

Tensor decomposition has been extensively used as a tool for exploratory analysis. Motivated by neuroscience applications, we study tensor decomposition with Boolean factors. The resulting optimization problem is challenging due to the non-convex objective and the combinatorial constraints. We propose Binary Matching P…

2018-10-10abs ↗pdf ↗

Study the rank of Nijenhuis tensor on parallelizable almost complex manifolds.

problem Understanding the rank of Nijenhuis tensor on parallelizable almost complex manifolds.
method Reduction of computations to solving PDEs, explicit solutions on specific manifolds, analysis of curve of almost complex structures, classification of Lie algebras.
result Classification of Lie algebras admitting almost complex structures with specific Nijenhuis tensor ranks.

Study characterizes conformal boundaries of de Sitter spacetimes.

problem Characterize conformal infinity of asymptotically de Sitter spacetimes.
method Derive constraints relating stress-energy tensor to conformal geometric data using higher conformal fundamental forms.
result Constraints on stress-energy tensor relate to conformal geometric data.

SWoTTeD discovers hidden temporal patterns in EHR data.

problem Complex temporal patterns in EHR data.
method Sliding Window for Temporal Tensor Decomposition (SWoTTeD) with constraints and regularizations.
result SWoTTeD achieves at least as accurate reconstruction as state-of-the-art models and extracts meaningful temporal phenotypes.

SimTensor is a multi-platform, open-source software for generating artificial tensor data (either with CP/PARAFAC or Tucker structure) for reproducible research on tensor factorization algorithms. SimTensor is a stand-alone application based on MATALB. It provides a wide range of facilities for generating tensor data w…

2016-12-09abs ↗pdf ↗