Bayesian Probabilistic Co-Subspace Addition
For modeling data matrices, this paper introduces Probabilistic Co-Subspace Addition (PCSA) model by simultaneously capturing the dependent structures among both rows and columns. Briefly, PCSA assumes that each entry of a matrix is generated by the additive combination of the linear mappings of two features, which distribute in the row-wise and column-wise latent subspaces. Consequently, it captures the dependencies among entries intricately, and is able to model the non-Gaussian and heteroscedastic density. Variational inference is proposed on PCSA for approximate Bayesian learning, where the updating for posteriors is formulated into the problem of solving Sylvester equations. Furthermore, PCSA is extended to tackling and filling missing values, to adapting its sparseness, and to modelling tensor data. In comparison with several state-of-art approaches, experiments demonstrate the effectiveness and efficiency of Bayesian (sparse) PCSA on modeling matrix (tensor) data and filling missing values.
Code (0)
등록된 구현이 없습니다.
Tasks
Missing ValuesVariational InferenceSimilar Papers 제목 키워드 기반
Probabilistic Low-Rank Subspace Clustering
In this paper, we consider the problem of clustering data points into low-dimensional subspaces in the presence of outliers. We pose the problem using a density estimation formulation with an associated generative model.…
ClusteringDensity EstimationMissing ValuesComposition of kernel and acquisition functions for High Dimensional Bayesian Optimization
Bayesian Optimization has become the reference method for the global optimization of black box, expensive and possibly noisy functions. Bayesian Op-timization learns a probabilistic model about the objective function, us…
Bayesian Optimizationglobal-optimizationVocal Bursts Intensity PredictionAdaptive probabilistic principal component analysis
Using the linear Gaussian latent variable model as a starting point we relax some of the constraints it imposes by deriving a nonparametric latent feature Gaussian variable model. This model introduces additional discret…
Global Solver and Its Efficient Approximation for Variational Bayesian Low-rank Subspace Clustering
When a probabilistic model and its prior are given, Bayesian learning offers inference with automatic parameter tuning. However, Bayesian learning is often obstructed by computational difficulty: the rigorous Bayesian l…
ClusteringComputational EfficiencyA Fully Bayesian Gradient-Free Supervised Dimension Reduction Method using Gaussian Processes
Modern day engineering problems are ubiquitously characterized by sophisticated computer codes that map parameters or inputs to an underlying physical process. In other situations, experimental setups are used to model t…
Dimensionality ReductionGaussian Processes