Covariance Prediction via Convex Optimization

01/29/2021
by   Shane Barratt, et al.
16

We consider the problem of predicting the covariance of a zero mean Gaussian vector, based on another feature vector. We describe a covariance predictor that has the form of a generalized linear model, i.e., an affine function of the features followed by an inverse link function that maps vectors to symmetric positive definite matrices. The log-likelihood is a concave function of the predictor parameters, so fitting the predictor involves convex optimization. Such predictors can be combined with others, or recursively applied to improve performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2020

Likelihood Geometry of Correlation Models

Correlation matrices are standardized covariance matrices. They form an ...
research
08/05/2014

L0 Sparse Inverse Covariance Estimation

Recently, there has been focus on penalized log-likelihood covariance es...
research
09/08/2017

Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets

We use available measurements to estimate the unknown parameters (varian...
research
05/18/2020

Necessary and sufficient conditions for asymptotically optimal linear prediction of random fields on compact metric spaces

Optimal linear prediction (also known as kriging) of a random field {Z(x...
research
03/19/2019

Shrinking the Sample Covariance Matrix using Convex Penalties on the Matrix-Log Transformation

For q-dimensional data, penalized versions of the sample covariance matr...
research
01/11/2011

Bayesian Nonparametric Covariance Regression

Although there is a rich literature on methods for allowing the variance...
research
02/04/2019

Constructing the Matrix Multilayer Perceptron and its Application to the VAE

Like most learning algorithms, the multilayer perceptrons (MLP) is desig...

Please sign up or login with your details

Forgot password? Click here to reset