scholarly journals Variational inference for probabilistic Poisson PCA

2018 ◽  
Vol 12 (4) ◽  
pp. 2674-2698 ◽  
Author(s):  
Julien Chiquet ◽  
Mahendra Mariadassou ◽  
Stéphane Robin
Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5966
Author(s):  
Ke Wang ◽  
Gong Zhang

The challenge of small data has emerged in synthetic aperture radar automatic target recognition (SAR-ATR) problems. Most SAR-ATR methods are data-driven and require a lot of training data that are expensive to collect. To address this challenge, we propose a recognition model that incorporates meta-learning and amortized variational inference (AVI). Specifically, the model consists of global parameters and task-specific parameters. The global parameters, trained by meta-learning, construct a common feature extractor shared between all recognition tasks. The task-specific parameters, modeled by probability distributions, can adapt to new tasks with a small amount of training data. To reduce the computation and storage cost, the task-specific parameters are inferred by AVI implemented with set-to-set functions. Extensive experiments were conducted on a real SAR dataset to evaluate the effectiveness of the model. The results of the proposed approach compared with those of the latest SAR-ATR methods show the superior performance of our model, especially on recognition tasks with limited data.


Author(s):  
Jinjin Chi ◽  
Jihong Ouyang ◽  
Ang Zhang ◽  
Xinhua Wang ◽  
Ximing Li

Author(s):  
Shuangshuang Chen ◽  
Sihao Ding ◽  
L. Srikar Muppirisetty ◽  
Yiannis Karayiannidis ◽  
Marten Bjorkman

2018 ◽  
Vol 63 (12) ◽  
pp. 4172-4187 ◽  
Author(s):  
William R. Jacobs ◽  
Tara Baldacchino ◽  
Tony Dodd ◽  
Sean R. Anderson

2021 ◽  
Author(s):  
Ahmed Hammam ◽  
Seyed Eghbal Ghobadi ◽  
Frank Bonarens ◽  
Christoph Stiller

Author(s):  
David Barber

Finding clusters of well-connected nodes in a graph is a problem common to many domains, including social networks, the Internet and bioinformatics. From a computational viewpoint, finding these clusters or graph communities is a difficult problem. We use a clique matrix decomposition based on a statistical description that encourages clusters to be well connected and few in number. The formal intractability of inferring the clusters is addressed using a variational approximation inspired by mean-field theories in statistical mechanics. Clique matrices also play a natural role in parametrizing positive definite matrices under zero constraints on elements of the matrix. We show that clique matrices can parametrize all positive definite matrices restricted according to a decomposable graph and form a structured factor analysis approximation in the non-decomposable case. Extensions to conjugate Bayesian covariance priors and more general non-Gaussian independence models are briefly discussed.


Sign in / Sign up

Export Citation Format

Share Document