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

3.2%6.5%9.7%12.9% · Dec 199619922001200920172026
48 results for Coupled Factorization

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.

New algorithm for low-rank optimal transport with improved interpretability and efficiency.

problem Quadratic scaling of optimal transport coupling matrix for massive datasets.
method Factor Relaxation with Latent Coupling (FRLC) algorithm.
result Superior performance on diverse applications including graph clustering and spatial transcriptomics.

Paper proposes C-STM for multimodal neuroimaging data classification.

problem Multimodal neuroimaging data fusion for better classification.
method Coupled Support Tensor Machine (C-STM) using latent factors from ACMTF.
result C-STM achieves better classification performance than single-mode classifiers.

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.

DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.

problem Learning deep hierarchical representations from data.
method Dual-constrained Deep Semi-Supervised Coupled Factorization Network (DS2CF-Net) with enriched prior.
result DS2CF-Net achieves state-of-the-art performance in representation learning and clustering.

Coupled tensor decomposition reveals the joint data structure by incorporating priori knowledge that come from the latent coupled factors. The tensor ring (TR) decomposition is invariant under the permutation of tensors with different mode properties, which ensures the uniformity of decomposed factors and mode attribut…

2020-01-09abs ↗pdf ↗

We present a general framework, the coupled compound Poisson factorization (CCPF), to capture the missing-data mechanism in extremely sparse data sets by coupling a hierarchical Poisson factorization with an arbitrary data-generating model. We derive a stochastic variational inference algorithm for the resulting model …

2017-01-09abs ↗pdf ↗

C2^2VAE learns disentangled and coupled representations without prior knowledge.

problem Learning disentangled and coupled representations in latent space.
method Introduces C2^2VAE, a self-supervised VAE that factorizes posterior and uses Gaussian copula for dependencies.
result Demonstrates strong effect in enhancing disentangled representation learning.

A network-based approach identifies financial factors from asset interactions, explaining market dynamics.

problem Characterizing joint financial asset behavior through underlying drivers.
method Modeling market as coupled iterated maps, where asset returns depend on past returns and interactions.
result Stable patterns of co-movement (financial factors) emerge from asset interactions, explaining asset variance.

We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We…

2009-08-05abs ↗pdf ↗

We study a class of Poisson tensors on a fibered manifold which are compatible with the fiber bundle structure by the so-called almost coupling condition. In the case of a 55-dimensional orientable fibered manifolds with 22-dimensional bases, we describe a global behavior of almost coupling Poisson tensors and their …

2018-04-16abs ↗pdf ↗

The paper prices a new life insurance policy for couples, considering various contingent benefits.

problem Valuation of life insurance policies for dependent coupled lives.
method Employed the QPQP-rule combining real-world and risk-neutral measures for pricing.
result Explicit pricing expressions for the new insurance policy were derived and analyzed.

Stein's method for measuring convergence to a continuous target distribution relies on an operator characterizing the target and Stein factor bounds on the solutions of an associated differential equation. While such operators and bounds are readily available for a diversity of univariate targets, few multivariate targ…

2016-11-21abs ↗pdf ↗

Paper studies asymmetric matrix sensing, proving gradient descent converges to low-rank solutions.

problem Reconstructing asymmetric low-rank matrices from linear measurements.
method Factorized gradient descent with coupling and regularization properties.
result Gradient descent from small random initialization converges to globally optimal and generalizing solutions.

This paper introduces a novel recurrent model for music composition that is tailored to the structure of polyphonic music. We propose an efficient new conditional probabilistic factorization of musical scores, viewing a score as a collection of concurrent, coupled sequences: i.e. voices. To model the conditional distri…

2018-11-20abs ↗pdf ↗

Joint analysis of data from multiple sources has the potential to improve our understanding of the underlying structures in complex data sets. For instance, in restaurant recommendation systems, recommendations can be based on rating histories of customers. In addition to rating histories, customers' social networks (e…

2011-05-17abs ↗pdf ↗

DeCom predicts post-COVID RSV timing and intensity with NPI consideration.

problem Predicting RSV timing and intensity post-COVID with NPI impact.
method Deep coupled tensor factorization machine (DeCom) leveraging tensor factorization and residual modeling.
result DeCom achieves up to 46% lower RMSE and 49% lower MAE compared to baselines.

How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the C…

2013-02-28abs ↗pdf ↗

We propose an extension of the canonical polyadic (CP) tensor model where one of the latent factors is allowed to vary through data slices in a constrained way. The components of the latent factors, which we want to retrieve from data, can vary from one slice to another up to a diffeomorphism. We suppose that the diffe…

2018-02-09abs ↗pdf ↗

We present a unified invariance framework for supervised neural networks that can induce independence to nuisance factors of data without using any nuisance annotations, but can additionally use labeled information about biasing factors to force their removal from the latent embedding for making fair predictions. Invar…

2019-05-07abs ↗pdf ↗

A new method uncovers discrete and continuous factors in gene expression data.

problem Jointly identifying discrete and continuous factors of variability without supervision.
method cpl-mixVAE framework using multiple interacting networks.
result The method successfully uncovers discrete and continuous factors in gene expression data.

We propose a new method to estimate Wasserstein distances and optimal transport plans between two probability distributions from samples in high dimension. Unlike plug-in rules that simply replace the true distributions by their empirical counterparts, our method promotes couplings with low transport rank, a new struct…

2018-06-19abs ↗pdf ↗

This paper tackles multi-marginal optimal transport problems using DC programming.

problem Multi-marginal optimal transport problems in machine learning.
method Promoting structural information in MMOT leads to a DC programming problem.
result Solutions from DC optimization are as qualitative as current methods.

Data representations that contain all the information about target variables but are invariant to nuisance factors benefit supervised learning algorithms by preventing them from learning associations between these factors and the targets, thus reducing overfitting. We present a novel unsupervised invariance induction f…

2018-09-26abs ↗pdf ↗

A scalable framework selects top factors from CAE latent factors for better portfolio optimization.

problem Limited latent factor dimension in CAE models degrades performance.
method Couple high-dimensional CAE with uncertainty-aware factor selection.
result Pruning strategy delivers substantial gains in risk-adjusted performance.

Computational approaches to transcription factor binding site identification have been actively researched for the past decade. Negative examples have long been utilized in de novo motif discovery and have been shown useful in transcription factor binding site search as well. However, understanding of the roles of nega…

2011-04-07abs ↗pdf ↗

The paper extends statistical estimation techniques under differential privacy.

problem Establishing sample complexity bounds for estimation tasks under differential privacy.
method Proposes analogues of Le Cam's method, Fano's inequality, and Assouad's lemma under central differential privacy.
result Optimal sample complexity bounds for discrete distribution estimation under total variation and 2\ell_2 distances.

Most popular word embedding techniques involve implicit or explicit factorization of a word co-occurrence based matrix into low rank factors. In this paper, we aim to generalize this trend by using numerical methods to factor higher-order word co-occurrence based arrays, or \textit{tensors}. We present four word embedd…

2017-04-10abs ↗pdf ↗

Non-negative matrix factorization models based on a hierarchical Gamma-Poisson structure capture user and item behavior effectively in extremely sparse data sets, making them the ideal choice for collaborative filtering applications. Hierarchical Poisson factorization (HPF) in particular has proved successful for scala…

2016-04-13abs ↗pdf ↗

In this work, an ensemble of economic interacting agents is considered. The agents are arranged in a linear array where only local couplings are allowed. The deterministic dynamics of each agent is given by a map. This map is expressed by two factors. The first one is a linear term that models the expansion of the agen…

2007-12-17abs ↗pdf ↗

Exponential family extensions of principal component analysis (EPCA) have received a considerable amount of attention in recent years, demonstrating the growing need for basic modeling tools that do not assume the squared loss or Gaussian distribution. We extend the EPCA model toolbox by presenting the first exponentia…

2012-03-15abs ↗pdf ↗

Goldbach conjecture is one of the most famous open mathematical problems. It states that every even number, bigger than two, can be presented as a sum of 2 prime numbers. % In this work we present a deep learning based model that predicts the number of Goldbach partitions for a given even number. Surprisingly, our mode…

2018-03-25abs ↗pdf ↗

NCPF model improves traffic data imputation with neural and tensor methods.

problem Pervasive missing data in traffic analysis due to sensor failures and gaps.
method Neural Canonical Polyadic Factorization (NCPF) integrating CP decomposition and deep learning.
result NCPF outperforms state-of-the-art baselines in urban traffic datasets.