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

176352527703 · Jun 202019922001200920172026
48 results for latent factor analysis

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…

2012-07-11abs ↗pdf ↗

Sparse GFA identifies disease factors in FTD subgroups.

problem Heterogeneity in neurological disorders hinders understanding and treatment.
method Sparse Group Factor Analysis (GFA) with regularised horseshoe priors.
result Identified latent disease factors differentially expressed in FTD subgroups.

Method for factor analysis in short panels without assuming sphericity or Gaussianity.

problem Factor analysis in short panels without assuming sphericity or Gaussianity.
method Pseudo maximum likelihood method and asymptotically uniformly most powerful invariant test.
result Systematic risk explains a large part of cross-sectional total variance in bear markets but is not spanned by observed factors.

An ADRC-incorporated SGD algorithm improves latent factor analysis speed and accuracy.

problem Slow convergence in standard SGD for HDI matrix analysis.
method Incorporates ADRC principles to refine historical and future learning error states.
result Empirically outperforms state-of-the-art LFA models in HDI matrix prediction.

Survey of factor analysis, PCA, variational inference, and VAE.

problem Dimensionality reduction and generative modeling of data.
method Variational inference, factor analysis, probabilistic PCA, and VAE.
result Derivation and explanation of ELBO, EM, and closed-form solutions.

Method evaluates disentanglement in DLVMs, including those not aligned with latent axes.

problem Evaluate disentanglement in DLVMs, especially those not aligned with latent axes.
method Proposes a statistical method to discover generative factors of a dataset.
result Empirically demonstrates the advantage of the method on two datasets.

A gamma process dynamic Poisson factor analysis model is proposed to factorize a dynamic count matrix, whose columns are sequentially observed count vectors. The model builds a novel Markov chain that sends the latent gamma random variables at time (t1)(t-1) as the shape parameters of those at time tt, which are linked …

2015-12-30abs ↗pdf ↗

GLFA improves latent factor analysis by incorporating graph structures for HiDS matrices.

problem Accurate representation learning on high-dimensional and sparse matrices.
method GLFA incorporates a graph to identify hidden high-order interactions and uses a recurrent LFA structure to improve representation learning.
result GLFA outperforms state-of-the-art models in predicting missing data of HiDS matrices.

New method explains high-dimensional sphere data with latent factors.

problem Understanding intricate dependence structure in high-dimensional sphere data.
method Exploratory factor analysis of the projected normal distribution with a fast alternating expectation profile conditional maximization algorithm.
result Uniformly excellent results on various data types, including tweets, brain imaging, and cancer gene expression.

Neuroscience is experiencing a data revolution in which many hundreds or thousands of neurons are recorded simultaneously. Currently, there is little consensus on how such data should be analyzed. Here we introduce LFADS (Latent Factor Analysis via Dynamical Systems), a method to infer latent dynamics from simultaneous…

2016-08-22abs ↗pdf ↗

Proposes a flexible feature allocation model for sparse factor analysis.

problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.

We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…

2015-11-10abs ↗pdf ↗

This study analyzes prediction risk for PCR method in latent factor regression models.

problem Prediction risk analysis in latent factor regression models.
method Adaptive PCR method with risk bounds established under factor regression model.
result Unified framework for analyzing various linear prediction methods under factor regression.

In this paper we address the problem of modeling relational data, which appear in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models but disregarding local structure in the network, or focus exclusively on capturing loc…

2012-04-11abs ↗pdf ↗

Latent factor models are the canonical statistical tool for exploratory analyses of low-dimensional linear structure for an observation matrix with p features across n samples. We develop a structured Bayesian group factor analysis model that extends the factor model to multiple coupled observation matrices; in the cas…

2014-11-11abs ↗pdf ↗

Extract common latent factors from graphs for better representation learning.

problem Graph-level representation learning challenges due to limited labeled data and poor negative sample selection.
method Graph-wise Common Latent Factor Extraction (GCFX) using deepGCFX model.
result Improved graph-level and node-level tasks performance compared to state-of-the-art methods.

DGA and DVGA learn disentangled graph representations to improve graph analysis.

problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.

Enhances time-series regression trees with latent factors for robust financial analysis.

problem Handling predictors with measurement error, trends, seasonality, and missing data.
method Integrates latent stationary factors extracted via state-space methods into time-series regression trees.
result Factor-augmented trees provide a reliable approach for macro-finance problems, exemplified by the lead-lag effect between equity volatility and the business cycle.

The paper reviews identifiability in linear and nonlinear models, from Gaussian to non-Gaussian.

problem Identifiability issues in latent-variable and structural-equation models, especially in nonlinear cases.
method Review of identifiability theory for linear and nonlinear models, including factor analysis and structural equation models.
result Even nonparametric nonlinear models can be estimated with additional assumptions.

New model extracts shared brain activity patterns from fMRI data.

problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.

The paper develops a new model for high-dimensional spatial arbitrage pricing.

problem Estimating spatial interactions in high-dimensional asset pricing.
method Integrates spatial interactions with multi-factor analysis using generalized shrinkage Yule-Walker (SYW) estimation.
result Established asymptotic properties for high-dimensional spatial arbitrage pricing models.

New algorithm speeds up fitting GLLVMs to large datasets.

problem Efficiently fitting GLLVMs to large datasets with thousands of observations.
method Approximate model using penalized quasi-likelihood, then use Newton method and Fisher scoring.
result Significantly faster and more stable than previous methods, enabling fits to larger matrices.

This paper proposes an alternating back-propagation algorithm for learning the generator network model. The model is a non-linear generalization of factor analysis. In this model, the mapping from the continuous latent factors to the observed signal is parametrized by a convolutional neural network. The alternating bac…

2016-06-28abs ↗pdf ↗

TraLFM models human mobility patterns from traffic trajectories.

problem Understanding human mobility patterns from traffic data.
method Latent factor modeling of sequential, personal, and temporal factors.
result TraLFM significantly outperforms state-of-the-art methods in latent factor analysis and next location prediction.

In many applications, observed data are influenced by some combination of latent causes. For example, suppose sensors are placed inside a building to record responses such as temperature, humidity, power consumption and noise levels. These random, observed responses are typically affected by many unobserved, latent fac…

2019-04-18abs ↗pdf ↗

Improved IFA with Generative Adversarial Networks for high-dimensional latent variables.

problem Limited expressiveness of traditional VAEs in high-dimensional latent variable modeling.
method Introducing Adversarial Variational Bayes (AVB) and Importance-weighted Adversarial Variational Bayes (IWAVB) algorithms.
result IWAVB demonstrated superior expressiveness and higher likelihood compared to IWAE.

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.

Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each group represents either a set of related variables or a data set. The model also na…

2014-11-21abs ↗pdf ↗

Proposes MD-LiNA for multi-domain latent factor causal discovery.

problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.