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

Trend · papers per month

2795588361,115 · Jun 202019922001200920172026
48 results for multi-way data

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

A new method for analyzing multi-source, multi-way data reduces dimensionality and reveals shared and individual structures.

problem Analyzing multi-source, multi-way data from different high-throughput technologies.
method Multiple Linked Tensor Factorization (MULTIFAC) extending CP decomposition with L2 penalties and EM algorithm for incomplete data.
result MULTIFAC approximates underlying signal, identifies shared and unshared structures, and imputes missing data.

High-dimensional linear classifiers, such as the support vector machine (SVM) and distance weighted discrimination (DWD), are commonly used in biomedical research to distinguish groups of subjects based on a large number of features. However, their use is limited to applications where a single vector of features is mea…

2016-06-26abs ↗pdf ↗

Bayesian model predicts iron deficiency from multi-source multi-way molecular data.

problem Predicting iron deficiency in rhesus monkeys from multi-source multi-way molecular data.
method Developed a Bayesian approach with a linear model incorporating multi-way dependence and varying signal sizes across sources.
result Model accurately classifies iron deficiency in monkeys and outperforms simpler models.

We propose a new method to model multi-way similarities into hypergraphs for clustering.

problem Clustering real-valued data using hypergraphs with multi-way similarities.
method Formulate multi-way similarities using kernel functions, establish connections to hypergraph cut, and develop a fast spectral clustering algorithm.
result Our method outperforms existing graph and heuristic modeling methods in clustering performance.

NeSGD efficiently updates tensor-based features for online model learning in multi-way data.

problem Incremental updates of tensor-based features and model coefficients for evolving data distributions.
method Online NeSGD for CP decomposition of tensor data.
result Proposed NeSGD method significantly improves classification accuracy and adapts to changing data distributions.

We extend multi-way, multivariate ANOVA-type analysis to cases where one covariate is the view, with features of each view coming from different, high-dimensional domains. The different views are assumed to be connected by having paired samples; this is a common setup in recent bioinformatics experiments, of which we a…

2009-12-16abs ↗pdf ↗

Proposes a multi-objective variational autoencoder for smart infrastructure damage detection.

problem Detecting and diagnosing damage in smart infrastructure using multi-way data.
method Multi-objective variational autoencoder (MVA) method for smart infrastructure damage detection and diagnosis.
result The method accurately detects structural damage, estimates severity, and captures damage locations.

Develops a new tensor classification method for high-dimensional data.

problem Efficient learning algorithms exploiting tensorial structure in high-dimensional multi-way arrays.
method Tensor Train Multi-way Multi-level Kernel (TT-MMK) combining Canonical Polyadic decomposition, Dual Structure-preserving Support Vector Machine, and Tensor Train approximation.
result The TT-MMK method provides higher prediction accuracy and is more reliable computationally compared to other techniques.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation for high-dimensional functional MRI and dynamic graph recovery.
method Reformulates imputation as RKHS regression with TT-constrained coefficients and Hadamard overparameterization. Optimizes TT coefficients and kernel matrices on Riemannian manifolds.
result Consistently outperforms state-of-the-art methods in modeling accuracy.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation in high-dimensional spaces.
method Reformulates imputation as RKHS regression with TT-constrained coefficients, optimized on manifold frameworks.
result Consistently outperforms state-of-the-art methods in accuracy.

We present an approach for penalized tensor decomposition (PTD) that estimates smoothly varying latent factors in multi-way data. This generalizes existing work on sparse tensor decomposition and penalized matrix decompositions, in a manner parallel to the generalized lasso for regression and smoothing problems. Our ap…

2015-02-24abs ↗pdf ↗

Develops a tensor network framework to reduce RNN complexity for high-dimensional sequence modeling.

problem Exponential parameter growth in RNNs for large multidimensional data.
method Embeds a multi-linear graph filter in a tensor network architecture to approximate RNN hidden states.
result Demonstrates superior performance and reduced complexity compared to traditional RNNs.

We propose a Bayesian regression method that accounts for multi-way interactions of arbitrary orders among the predictor variables. Our model makes use of a factorization mechanism for representing the regression coefficients of interactions among the predictors, while the interaction selection is guided by a prior dis…

2017-09-27abs ↗pdf ↗

Translating potential disease biomarkers between multi-species 'omics' experiments is a new direction in biomedical research. The existing methods are limited to simple experimental setups such as basic healthy-diseased comparisons. Most of these methods also require an a priori matching of the variables (e.g., genes o…

2010-12-15abs ↗pdf ↗

A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskal-factor analysis (KFA). KFA is nonparametric and can infer both the tensor-rank of each dictionary atom and the number of dictionary atoms. The model …

2016-12-08abs ↗pdf ↗

Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.

problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.

We propose a framework for the linear prediction of a multi-way array (i.e., a tensor) from another multi-way array of arbitrary dimension, using the contracted tensor product. This framework generalizes several existing approaches, including methods to predict a scalar outcome from a tensor, a matrix from a matrix, or…

2017-01-04abs ↗pdf ↗

The PARAFAC2 is a multimodal factor analysis model suitable for analyzing multi-way data when one of the modes has incomparable observation units, for example because of differences in signal sampling or batch sizes. A fully probabilistic treatment of the PARAFAC2 is desirable in order to improve robustness to noise an…

2018-06-21abs ↗pdf ↗

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

SiBBlInGS discovers interpretable building blocks across states in multi-way data.

problem Identifying interpretable units (Building Blocks) in multi-state, multi-way data.
method Graph-based dictionary learning approach for sparse BBs and temporal traces.
result Captures per-trial variability and state-specific vs. state-invariant components.

GRTR framework uses graph regularization to improve financial forecasting.

problem High computational costs and economic domain knowledge loss in tensor models.
method Graph-Regularized Tensor Regression (GRTR) framework incorporating economic domain knowledge.
result Improved performance in multi-way financial forecasting with reduced computational costs.

A new method identifies class-specific covariates in multi-class prediction tasks.

problem Identifying covariates specifically associated with one or more outcome classes in multi-class prediction tasks.
method Introducing multi forests (MuFs) with multi-way and binary splits to measure class-associated discriminatory ability.
result The multi-class VIM specifically ranks class-associated covariates highly, unlike conventional VIMs.

Spectral clustering is a celebrated algorithm that partitions objects based on pairwise similarity information. While this approach has been successfully applied to a variety of domains, it comes with limitations. The reason is that there are many other applications in which only \emph{multi}-way similarity measures ar…

2018-05-23abs ↗pdf ↗

TRNN combines tensor geometry with neural network nonlinearity for HD data.

problem Modeling high-dimensional data with preserved tensor geometry and nonlinear interactions.
method Introduces TRNN that integrates tensor geometry and neural network nonlinearity.
result TRNN preserves tensor geometry while offering nonlinearity.

Low-rank tensor regression, a new model class that learns high-order correlation from data, has recently received considerable attention. At the same time, Gaussian processes (GP) are well-studied machine learning models for structure learning. In this paper, we demonstrate interesting connections between the two, espe…

2017-10-31abs ↗pdf ↗

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.

Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate scalable sampling-based posterior inference by exploitation of the combinatorial…

2018-05-11abs ↗pdf ↗

Paper relaxes independence assumption for non-centered data.

problem Failing to account for dependencies in data leads to model failures.
method Proposes 'Kronecker-sum-structured mean' assumption to relax zero-mean requirement.
result Models with nonconvex but unimodal log-likelihoods can be solved efficiently.

Tensor completion estimates missing components by exploiting the low-rank structure of multi-way data. The recently proposed methods based on tensor train (TT) and tensor ring (TR) show better performance in image recovery than classical ones. Compared with TT and TR, the projected entangled pair state (PEPS), which is…

2019-03-12abs ↗pdf ↗

Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However, these techniques require tensor decomposition which could lead to the loss of infor…

2017-06-25abs ↗pdf ↗

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue of the pp-Laplacian. In the case of the closed eigenvalue problem and the Neuma…

2019-07-08abs ↗pdf ↗