paper-with-me

홈 › Papers

Probabilistic Simplex Component Analysis by Importance Sampling

2023-02-22 · Nerya Granot, Tzvi Diskin, Nicolas Dobigeon, Ami Wiesel

In this paper we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions to tackle this challenging problem were based on geometrical approaches or computationally intensive variational methods. In contrast, we propose a conventional expectation maximization (EM) algorithm which embeds importance sampling. For this purpose, the proposal distribution is chosen as a simple surrogate distribution of the target posterior that is guaranteed to lie in the simplex. This distribution is based on the Gaussian linear minimum mean squared error (LMMSE) approximation which is accurate at high signal-to-noise ratio. Numerical experiments in different settings demonstrate the advantages of this adaptive surrogate over state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2302.11230

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Probabilistic Simplex Component Analysis

2021-03-18 · Ruiyuan Wu, Wing-Kin Ma, Yuening Li, Anthony Man-Cho So 외

This study presents PRISM, a probabilistic simplex component analysis approach to identifying the vertices of a data-circumscribing simplex from data. The problem has a rich variety of applications, the most notable bein…

Hyperspectral UnmixingVariational Inference

SimpleX: A Simple and Strong Baseline for Collaborative Filtering

2021-09-26 · Kelong Mao, Jieming Zhu, Jinpeng Wang, Quanyu Dai 외

Collaborative filtering (CF) is a widely studied research topic in recommender systems. The learning of a CF model generally depends on three major components, namely interaction encoder, loss function, and negative samp…

Collaborative FilteringRecommendation Systems

Explaining a probabilistic prediction on the simplex with Shapley compositions

2024-08-02 · Paul-Gauthier Noé, Miquel Perelló-Nieto, Jean-François Bonastre, Peter Flach

Originating in game theory, Shapley values are widely used for explaining a machine learning model's prediction by quantifying the contribution of each feature's value to the prediction. This requires a scalar prediction…

Binary ClassificationPrediction

Data-Driven Source Separation Based on Simplex Analysis

2018-02-26

Blind source separation (BSS) is addressed, using a novel data-driven approach, based on a well-established probabilistic model. The proposed method is specifically designed for separation of multichannel audio mixtures.…

blind source separation

Accuracy-Preserving Calibration via Statistical Modeling on Probability Simplex

2024-02-21 · Yasushi Esaki, Akihiro Nakamura, Keisuke Kawano, Ryoko Tokuhisa 외

Classification models based on deep neural networks (DNNs) must be calibrated to measure the reliability of predictions. Some recent calibration methods have employed a probabilistic model on the probability simplex. How…

Classifier calibrationUncertainty Quantification