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.

169,051 papers · 148 categories

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920182026
48 results for matrix-variate Gaussian

Transposable data represents interactions among two sets of entities, and are typically represented as a matrix containing the known interaction values. Additional side information may consist of feature vectors specific to entities corresponding to the rows and/or columns of such a matrix. Further information may also…

2014-04-27abs ↗pdf ↗

Differential privacy mechanism design has traditionally been tailored for a scalar-valued query function. Although many mechanisms such as the Laplace and Gaussian mechanisms can be extended to a matrix-valued query function by adding i.i.d. noise to each element of the matrix, this method is often suboptimal as it for…

2018-01-02abs ↗pdf ↗

Over the years data has become increasingly higher dimensional, which has prompted an increased need for dimension reduction techniques. This is perhaps especially true for clustering (unsupervised classification) as well as semi-supervised and supervised classification. Although dimension reduction in the area of clus…

2017-12-22abs ↗pdf ↗

Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance matrices from the matrix variate data. Under sparsity conditions, we show that one…

2012-09-23abs ↗pdf ↗

A distributed framework for reducing high-dimensional matrix-variate time series data.

problem Reducing dimensionality of high-dimensional, heterogeneous matrix-variate time series data.
method Data partitioning, distributed two-dimensional tensor PCA, aggregation, final PCA, factor matrix computation.
result Preserves latent matrix structure, improves computational efficiency and information utilization.

We consider a statistical model for pairs of traded assets, based on a Cointegrated Vector Auto Regression (CVAR) Model. We extend standard CVAR models to incorporate estimation of model parameters in the presence of price series level shifts which are not accurately modeled in the standard Gaussian error correction mo…

2010-08-01abs ↗pdf ↗

Estimates covariance matrices for matrix-variate data via core covariance geometry.

problem Estimating covariance matrices for matrix-variate data with partial isotropy.
method Fixed-rank core covariance geometry, partial-isotropy rank-r core shrinkage estimator.
result The geometry of the space of rank-r cores is a smooth manifold.

This paper proposes robust matrix variate regression models with rank constraints and vector regularization.

problem High dimensional and noisy matrix-valued predictors in regression models.
method Rank constraint, vector regularization, alternating projected gradient descent algorithm.
result The proposed method achieves the minimax rate of estimation errors.

Learning probability distributions on the weights of neural networks (NNs) has recently proven beneficial in many applications. Bayesian methods, such as Stein variational gradient descent (SVGD), offer an elegant framework to reason about NN model uncertainty. However, by assuming independent Gaussian priors for the i…

2017-12-30abs ↗pdf ↗

Paper proposes a deep Gaussian process for predicting formation energy of inorganic compounds.

problem High computational cost of quantum chemistry calculations for material design.
method Develops a deep Gaussian process emulator for quantum calculations using a novel molecular descriptor.
result Demonstrates that the approach can be implemented using a small dataset for prediction of formation energy.

A parsimonious model reduces over-parameterization in skewed matrix variate mixtures.

problem Over-parameterization in skewed matrix variate mixtures.
method Parsimonious family of 256 models using bilinear factor analyzers constrained over clusters, with AECM algorithm for estimation.
result Extensive simulations and real-world datasets (MNIST, Olivetti faces) demonstrate the method's effectiveness.

Paper proposes a method for estimating complex low-rank matrices from phase-only measurements.

problem Estimating complex low-rank matrices from magnitude-only measurements.
method A hierarchical prior model with a Gaussian-Wishart distribution is used to promote low-rankness. A variational EM algorithm is developed to solve the problem.
result The proposed method is less sensitive to initialization and performs well with random initialization.

Variational Bayesian neural nets combine the flexibility of deep learning with Bayesian uncertainty estimation. Unfortunately, there is a tradeoff between cheap but simple variational families (e.g.~fully factorized) or expensive and complicated inference procedures. We show that natural gradient ascent with adaptive w…

2017-12-06abs ↗pdf ↗

A new framework uses matrix flows to unify frequentist and Bayesian approaches for sparse GGMs.

problem Challenges in studying conditional independence among many variables with few observations.
method General framework for variational inference with matrix-variate Normalizing Flow in Gaussian Graphical Models.
result Unified benefits of frequentist and Bayesian frameworks for sparse GGMs.

Cluster analysis is a fundamental tool for pattern discovery of complex heterogeneous data. Prevalent clustering methods mainly focus on vector or matrix-variate data and are not applicable to general-order tensors, which arise frequently in modern scientific and business applications. Moreover, there is a gap between …

2018-03-17abs ↗pdf ↗

Paper explores statistical and computational limits of estimating low-rank Gaussian mixtures.

problem Estimating low-rank matrix-variate observations with optimal statistical and computational limits.
method Low-rank Gaussian mixture model (LrMM) and minimax lower bounds.
result Minimax optimality of maximum likelihood estimator and spectral aggregation method.

MMM model clusters mixed-type longitudinal data efficiently.

problem Challenges in clustering multivariate longitudinal mixed-type data.
method MMM model reorganizes data into a three-way structure, using a mixture of matrix-variate normal distributions.
result MMM model handles various data types (continuous, ordinal, binary, nominal, count) and temporal dependence.

Bayesian approach for learning spatiotemporal systems from noisy data.

problem Efficiently modeling and learning from spatiotemporal dynamical systems with noisy data.
method Hierarchical state-space models with Gaussian process regression for efficient interpolation and training.
result Efficient modeling and learning of spatiotemporal dynamics using Bayesian methods.

Study of zonal spherical functions on partial flag manifolds using Jacobi polynomials.

problem Understanding zonal spherical functions on partial flag manifolds.
method Matrix variate version of Koornwinder's method for constructing orthogonal polynomials, using Hermitian Jacobi polynomials and multivariate Schur polynomials.
result Conjecture that Hermitian Jacobi polynomials are elementary zonal spherical functions.

This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation algorithm. Using the probabilistic model, we derive a matrix factorisation algorithm …

2015-09-07abs ↗pdf ↗

EiGLasso speeds up sparse Kronecker-sum covariance estimation.

problem Sparse Kronecker-sum inverse covariance estimation challenges in scalability and parameter identification.
method Newton's method combined with eigendecomposition of sample and feature graphs, approximating Hessian for speed.
result Two to three orders-of-magnitude speed-up on simulated and real-world data.

Bayesian parametric matrix models provide uncertainty quantification for spectral learning.

problem Uncertainty quantification in spectral learning for safety-critical applications.
method Bayesian parametric matrix models (B-PMMs) that extend PMMs to provide uncertainty estimates.
result B-PMMs achieve exceptional uncertainty calibration (ECE < 0.05) while maintaining favorable scaling.

This paper develops a Bayesian procedure for estimation and forecasting of the volatility of multivariate time series. The foundation of this work is the matrix-variate dynamic linear model, for the volatility of which we adopt a multiplicative stochastic evolution, using Wishart and singular multivariate beta distribu…

2008-02-01abs ↗pdf ↗

MSFA clusters high-dimensional spatial data using spline-based covariance structures.

problem Clustering high-dimensional spatial data with flexible covariance structures.
method Mixture of spatial factor analyzers with spline-based covariance and matrix variate factor analyzers for dimensionality reduction.
result Proposed models accurately infer and differentiate distinct spatial patterns in tensor-variate data.

This paper considers the problem of isolating a small number of exchange traded funds (ETFs) that suffice to capture the fundamental dimensions of variation in U.S. financial markets. First, the data is fit to a vector-valued Bayesian regression model, which is a matrix-variate generalization of the well known stochast…

2015-10-12abs ↗pdf ↗

Enhances traffic forecasting with dynamic regression incorporating error modeling.

problem Improving accuracy of traffic forecasts using deep spatiotemporal models.
method Integrates matrix-variate autoregressive (AR) model into loss function for error series of base model.
result Improved traffic forecasting performance on SOTA models with interpretable AR coefficients.

Paper proposes a deep learning method for better covariance matrix forecasting.

problem Suboptimal predictive performance in traditional matrix volatility forecasting.
method Riemannian-geometry-aware deep learning framework for symmetric positive definite matrices.
result Our method outperforms traditional approaches in predictive accuracy.