Matrix Factorisation with Linear Filters

09/07/2015
by   Ömer Deniz Akyıldız, et al.
0

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 as a recursive linear filter. More precisely, we derive a matrix-variate recursive linear filter in order to perform efficient inference in high dimensions. We also show that it is possible to interpret our algorithm as a nontrivial stochastic gradient algorithm. Demonstrations and comparisons on an image restoration task are given.

READ FULL TEXT
research
10/04/2011

Non-Gaussian Scale Space Filtering with 2 by 2 Matrix of Linear Filters

Construction of a scale space with a convolution filter has been studied...
research
05/23/2019

Recursive blocked algorithms for linear systems with Kronecker product structure

Recursive blocked algorithms have proven to be highly efficient at the n...
research
06/25/2018

Asymptotic Properties of Recursive Maximum Likelihood Estimation in Non-Linear State-Space Models

Using stochastic gradient search and the optimal filter derivative, it i...
research
10/03/2022

Exact Recursive Probabilistic Programming

Recursive calls over recursive data are widely useful for generating pro...
research
05/04/2023

Generalizing Frobenius Inversion to Quaternion Matrices

In this paper we derive and analyze an algorithm for inverting quaternio...
research
03/18/2023

Inverse Cubature and Quadrature Kalman filters

Recent developments in counter-adversarial system research have led to t...

Please sign up or login with your details

Forgot password? Click here to reset