A Bayesian Perspective for Determinant Minimization Based Robust Structured Matrix Factorizatio
We introduce a Bayesian perspective for the structured matrix factorization problem. The proposed framework provides a probabilistic interpretation for existing geometric methods based on determinant minimization. We model input data vectors as linear transformations of latent vectors drawn from a distribution uniform over a particular domain reflecting structural assumptions, such as the probability simplex in Nonnegative Matrix Factorization and polytopes in Polytopic Matrix Factorization. We represent the rows of the linear transformation matrix as vectors generated independently from a normal distribution whose covariance matrix is inverse Wishart distributed. We show that the corresponding maximum a posteriori estimation problem boils down to the robust determinant minimization approach for structured matrix factorization, providing insights about parameter selections and potential algorithmic extensions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Bayesian Inference of Log Determinants
The log-determinant of a kernel matrix appears in a variety of machine learning problems, ranging from determinantal point processes and generalized Markov random fields, through to the training of Gaussian processes. Ex…
Bayesian InferenceGaussian ProcessesPoint ProcessesSubspace Constrained Variational Bayesian Inference for Structured Compressive Sensing with a Dynamic Grid
We investigate the problem of recovering a structured sparse signal from a linear observation model with an uncertain dynamic grid in the sensing matrix. The state-of-the-art expectation maximization based compressed sen…
Bayesian Inferencecompressed sensingCompressive SensingScalable Log Determinants for Gaussian Process Kernel Learning
For applications as varied as Bayesian neural networks, determinantal point processes, elliptical graphical models, and kernel learning for Gaussian processes (GPs), one must compute a log determinant of an $n \times n$ …
Gaussian ProcessesPoint ProcessesVBALD - Variational Bayesian Approximation of Log Determinants
Evaluating the log determinant of a positive definite matrix is ubiquitous in machine learning. Applications thereof range from Gaussian processes, minimum-volume ellipsoids, metric learning, kernel learning, Bayesian ne…
BIG-bench Machine LearningGaussian ProcessesMetric LearningPoint ProcessesSuccessive Linear Approximation VBI for Joint Sparse Signal Recovery and Dynamic Grid Parameters Estimation
For many practical applications in wireless communications, we need to recover a structured sparse signal from a linear observation model with dynamic grid parameters in the sensing matrix. Conventional expectation maxim…
Bayesian Inferencecompressed sensing