We present a scalable Bayesian model for low-rank factorization of massive tensors with binary observations. The proposed model has the following key properties: (1) in contrast to the models based on the logistic or probit likelihood, using a zero-truncated Poisson likelihood for binary data allows our model to scale …
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “binary tensor”
ENTED efficiently decomposes binary and count tensors using nonparametric Gaussian processes.
problem Handling high-dimensional and sparse binary and count data with traditional tensor decompositions.
method ENTED uses nonparametric Gaussian processes and sparse orthogonal variational inference to handle binary and count tensors.
result ENTED outperforms traditional methods in binary and count tensor completion tasks.
Proposes CMP method for reducing tensor object dimensions in binary classification.
problem Reduction of tensor object dimensions while maintaining class separability.
method Proposes Common Mode Patterns (CMP) method considering class labels.
result CMP method increases inter-class separability compared to MPCA.
This paper presents a tensor multiplication based smoothing algorithm that follows a two step denoising method. Unlike other traditional averaging approaches, our approach uses an element based normal voting tensor to compute smooth surfaces. By introducing a binary optimization on the proposed tensor together with a l…
We consider the problem of decomposing a higher-order tensor with binary entries. Such data problems arise frequently in applications such as neuroimaging, recommendation system, topic modeling, and sensor network localization. We propose a multilinear Bernoulli model, develop a rank-constrained likelihood-based estima…
Proposes a new tensor factorization model for better link prediction in knowledge graphs.
problem Lack of information in treating missing and non-existing relations equally in tensor factorization models.
method Introduces a binary tensor factorization model with probit link to address the issue.
result Shows improved prediction accuracy and interpretability compared to existing models.
MARS automatically selects tensor decomposition ranks, improving performance in neural network tasks.
problem Determining optimal decomposition ranks in tensor decompositions.
method MARS uses binary masks to learn optimal tensor structure during training via relaxed MAP estimation.
result MARS achieves better results than previous methods in various tasks.
TuckER predicts missing facts in knowledge graphs using tensor decomposition.
problem Predicting missing facts in knowledge graphs.
method TuckER uses Tucker decomposition of binary tensor representations.
result TuckER outperforms state-of-the-art models in link prediction.
Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem. In this paper we propose a novel spectral approach to this problem, based on the eigenvectors of both the second order moment matrix and t…
New model analyzes customer churn with tensor completion and binary data.
problem Analyzing the impact of interventions on customer churn.
method Tensorized latent factor block hazard model with 1-bit tensor completion.
result Effective categorization of interventions by similar impacts.
Tensor factorizations have become increasingly popular approaches for various learning tasks on structured data. In this work, we extend the RESCAL tensor factorization, which has shown state-of-the-art results for multi-relational learning, to account for the binary nature of adjacency tensors. We study the improvemen…
Paper detects review abuse using tensor decomposition.
problem Detecting review abuse by sellers and reviewers.
method Semi-supervised binary multi-target tensor decomposition.
result The model achieves higher precision and recall.
Alternative to convolutions using decision trees for neural networks.
problem Replacing complex convolutions with simpler decision-based layers.
method Binary decisions as indices to conditional distributions, trained using backpropagation.
result Performance similar to conventional neural networks, with runtime improvements.
Matrix product states (MPS), a tensor network designed for one-dimensional quantum systems, has been recently proposed for generative modeling of natural data (such as images) in terms of `Born machine'. However, the exponential decay of correlation in MPS restricts its representation power heavily for modeling complex…
Efficiently decomposes large tensors using stochastic gradients.
problem Efficiently decomposing large tensors for multiway data analysis.
method Stochastic gradients computed via MTTKRP kernel for efficient computation.
result Advantages and scalability demonstrated for large-scale problems.
Paper introduces tensor product of quandles for knot classification.
problem Classifying knot invariants of surface-links with 1-handles.
method Introduces tensor product of quandles and applies to surface-links.
result Tensor product of knot quandles/classical quandles can classify surface-link invariants.
According to [8] if the stationary Schroedinger equation on n-dim. Riemann space admits R-separation of variables (i.e. separation of variables with a factor R), then the underlying metric is necessarily isothermic. An important sub-class of isothermic metrics are the so called binary metrics. In this paper we study co…
GETF efficiently decomposes large-scale Boolean tensors.
problem Efficiently factorizing large-scale Boolean tensors.
method Geometric Expansion for all-order Tensor Factorization (GETF).
result GETF significantly improves reconstruction accuracy and efficiency.
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…
New method clusters multiway data from noisy tensors.
problem Identifying multiway block structure from noisy tensors.
method Tensor block model, unified least-square estimation, sparse regularization.
result Achieves partition consistency and outperforms previous methods.
In this paper we present a method for the unsupervised clustering of high-dimensional binary data, with a special focus on electronic healthcare records. We present a robust and efficient heuristic to face this problem using tensor decomposition. We present the reasons why this approach is preferable for tasks such as …
In our previous paper (see this arxiv math.DG/0402171) for generic rank 2 vector distributions on n-dimensional manifold (n greater or equal to 5) we constructed a special differential invariant, the fundamental form. In the case n=5 this differential invariant has the same algebraic nature, as the covariant binary biq…
Paper tackles tensor decomposition for unaligned observations using RKHS and novel loss functions.
problem Tackles tensor decomposition for unaligned observations.
method Uses functions in RKHS to represent mode with unaligned observations, introduces versatile loss function, proposes optimization algorithm and stochastic gradient method.
result Demonstrates improved tensor decomposition efficiency and effectiveness with synthetic and real data.
Develops a tensor decomposition method with side information.
problem Identifying the relationship between a high-dimensional tensor and side information.
method Supervised tensor decomposition incorporating multiple feature matrices.
result Captures effective dimension reduction of the data tensor in feature space.
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…
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, current implementations of CP on standard Knowledge Base Completion benchmarks are lagging behind their…
This paper tackles tensor recovery from noisy and multi-level quantized measurements.
problem Tensors from multi-level quantized measurements.
method Nonconvex optimization problem with alternating proximal gradient descent.
result The recovery error diminishes to zero with increasing tensor dimensions.
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…
Develops SymGCP for tensor decompositions with general symmetry.
problem Handling symmetry in tensor decompositions for better model accuracy.
method Introduces SymGCP, a generalized CP decomposition that accounts for any subset of tensor modes' symmetry.
result SymGCP enables efficient and scalable tensor decomposition with improved model robustness and accuracy.
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.
Unified framework for non-Euclidean CPD under scalable stochastic mirror descent.
problem Handling non-Euclidean losses in tensor decomposition.
method Tensor fiber sampling strategy-based stochastic mirror descent.
result Global convergence to a stationary point under reasonable conditions.
New tensor network models learn continuous data effectively.
problem Tensor network models' limitations in handling continuous data.
method Developed a new family of tensor network generative models for continuous data.
result Models can approximate any reasonably smooth probability density function with arbitrary precision.
We propose gradient adversarial training, an auxiliary deep learning framework applicable to different machine learning problems. In gradient adversarial training, we leverage a prior belief that in many contexts, simultaneous gradient updates should be statistically indistinguishable from each other. We enforce this c…
A method to reduce knowledge graph embedding models by binarizing parameters.
problem Large memory requirements for tensor factorization models in knowledge graph completion.
method Introducing a quantization function to binarize parameters of CP tensor decomposition.
result Successfully reduced model size by more than an order of magnitude while maintaining task performance.
Machine learning predicts Kronecker coefficients with high accuracy.
problem Predicting Kronecker coefficients from tensor products of symmetric group representations.
method Training machine learning models (NN, CNN, GBDT) to classify Kronecker coefficients as zero or non-zero.
result Trained models achieve high accuracy () in classifying Kronecker coefficients.
The paper analyzes GNNs with one hidden layer, proving their generalizability and convergence rate.
problem Theoretical guarantee on generalizability of GNNs with one hidden layer.
method Tensor initialization and accelerated gradient descent.
result The proposed learning algorithm converges to the ground-truth GNN model for regression and to a model close to the ground-truth for binary classification.
We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is equivalent to combinatorial optimization over antipodal-binary variables. ii)…
The paper constructs Yang-Baxter solutions using categorical augmented racks.
problem Solutions to the Yang-Baxter equation in knot theory.
method Interpreting augmented racks in tensor categories and constructing solutions using quantum heaps and Hopf algebra modules.
result Explicit constructions and infinite families of Yang-Baxter solutions are provided.
A Lie-admissible algebra gives by anticommutativity a Lie algebra. In this work we study remarkable classes of Lie-admissible algebras such as Vinberg, PreLie algebras. We compute the corresponding binary quadratic operads and study their Koszul duality. Considering Lie algebras as Lie-admissible algebras we can define…
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on partitioning weighted uniform hypergraphs---a problem often encountered in computer …
Unsupervised Generative Modeling Using Matrix Product Statescond-mat.stat-mech
Generative modeling, which learns joint probability distribution from data and generates samples according to it, is an important task in machine learning and artificial intelligence. Inspired by probabilistic interpretation of quantum physics, we propose a generative model using matrix product states, which is a tenso…
Estimates natural parameters of p-tensor Ising models efficiently.
problem Estimating natural parameters of p-tensor Ising models from a single sample.
method Maximum pseudo-likelihood (MPL) method.
result MPL estimate is sqrt(N)-consistent under various conditions.
The paper constructs new algebraic structures from Lie algebras and ternary Nambu-Lie algebras, leading to Yang-Baxter operators.
problem Constructing new algebraic structures from Lie algebras and ternary Nambu-Lie algebras.
method Using compositions of binary Lie algebras, 3-Lie algebras, and ternary Nambu-Lie algebras, the paper constructs ternary self-distributive objects and Yang-Baxter operators.
result The constructed Yang-Baxter operators are not gauge equivalent to the transposition operator and can be deformed to new solutions.
New methods lift weak supervision to structured prediction, providing robustness guarantees.
problem Applying weak supervision techniques to structured prediction problems.
method Introducing pseudo-Euclidean embeddings, tensor decompositions, and invariants for consistent noise rate estimation.
result Generalization guarantees nearly identical to those for models trained on clean data.
Deterministic Inference across Tensor Parallel Sizes That Eliminates Training-Inference Mismatchcs.LG
New method ensures consistent inference across different tensor parallel sizes for large language models.
problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings …
New integrable matrix PDEs derived from Frölicher-Nijenhuis brackets.
problem Developing integrable systems from tensor field properties.
method Using Frölicher-Nijenhuis brackets to generate bi-differential graded algebras and PDE systems.
result New integrable nonlinear matrix PDEs and systems are derived.
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.