Cargando…
Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors †
Evaluating the performance of Bayesian classification in a high-dimensional random tensor is a fundamental problem, usually difficult and under-studied. In this work, we consider two Signal to Noise Ratio (SNR)-based binary classification problems of interest. Under the alternative hypothesis, i.e.,...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7512719/ https://www.ncbi.nlm.nih.gov/pubmed/33265294 http://dx.doi.org/10.3390/e20030203 |
_version_ | 1783586222802731008 |
---|---|
author | Pham, Gia-Thuy Boyer, Rémy Nielsen, Frank |
author_facet | Pham, Gia-Thuy Boyer, Rémy Nielsen, Frank |
author_sort | Pham, Gia-Thuy |
collection | PubMed |
description | Evaluating the performance of Bayesian classification in a high-dimensional random tensor is a fundamental problem, usually difficult and under-studied. In this work, we consider two Signal to Noise Ratio (SNR)-based binary classification problems of interest. Under the alternative hypothesis, i.e., for a non-zero SNR, the observed signals are either a noisy rank-R tensor admitting a Q-order Canonical Polyadic Decomposition (CPD) with large factors of size [Formula: see text] , i.e., for [Formula: see text] , where [Formula: see text] with [Formula: see text] converge towards a finite constant or a noisy tensor admitting TucKer Decomposition (TKD) of multilinear [Formula: see text]-rank with large factors of size [Formula: see text] , i.e., for [Formula: see text] , where [Formula: see text] with [Formula: see text] converge towards a finite constant. The classification of the random entries (coefficients) of the core tensor in the CPD/TKD is hard to study since the exact derivation of the minimal Bayes’ error probability is mathematically intractable. To circumvent this difficulty, the Chernoff Upper Bound (CUB) for larger SNR and the Fisher information at low SNR are derived and studied, based on information geometry theory. The tightest CUB is reached for the value minimizing the error exponent, denoted by [Formula: see text]. In general, due to the asymmetry of the s-divergence, the Bhattacharyya Upper Bound (BUB) (that is, the Chernoff Information calculated at [Formula: see text]) cannot solve this problem effectively. As a consequence, we rely on a costly numerical optimization strategy to find [Formula: see text]. However, thanks to powerful random matrix theory tools, a simple analytical expression of [Formula: see text] is provided with respect to the Signal to Noise Ratio (SNR) in the two schemes considered. This work shows that the BUB is the tightest bound at low SNRs. However, for higher SNRs, the latest property is no longer true. |
format | Online Article Text |
id | pubmed-7512719 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-75127192020-11-09 Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † Pham, Gia-Thuy Boyer, Rémy Nielsen, Frank Entropy (Basel) Article Evaluating the performance of Bayesian classification in a high-dimensional random tensor is a fundamental problem, usually difficult and under-studied. In this work, we consider two Signal to Noise Ratio (SNR)-based binary classification problems of interest. Under the alternative hypothesis, i.e., for a non-zero SNR, the observed signals are either a noisy rank-R tensor admitting a Q-order Canonical Polyadic Decomposition (CPD) with large factors of size [Formula: see text] , i.e., for [Formula: see text] , where [Formula: see text] with [Formula: see text] converge towards a finite constant or a noisy tensor admitting TucKer Decomposition (TKD) of multilinear [Formula: see text]-rank with large factors of size [Formula: see text] , i.e., for [Formula: see text] , where [Formula: see text] with [Formula: see text] converge towards a finite constant. The classification of the random entries (coefficients) of the core tensor in the CPD/TKD is hard to study since the exact derivation of the minimal Bayes’ error probability is mathematically intractable. To circumvent this difficulty, the Chernoff Upper Bound (CUB) for larger SNR and the Fisher information at low SNR are derived and studied, based on information geometry theory. The tightest CUB is reached for the value minimizing the error exponent, denoted by [Formula: see text]. In general, due to the asymmetry of the s-divergence, the Bhattacharyya Upper Bound (BUB) (that is, the Chernoff Information calculated at [Formula: see text]) cannot solve this problem effectively. As a consequence, we rely on a costly numerical optimization strategy to find [Formula: see text]. However, thanks to powerful random matrix theory tools, a simple analytical expression of [Formula: see text] is provided with respect to the Signal to Noise Ratio (SNR) in the two schemes considered. This work shows that the BUB is the tightest bound at low SNRs. However, for higher SNRs, the latest property is no longer true. MDPI 2018-03-17 /pmc/articles/PMC7512719/ /pubmed/33265294 http://dx.doi.org/10.3390/e20030203 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Pham, Gia-Thuy Boyer, Rémy Nielsen, Frank Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title | Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title_full | Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title_fullStr | Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title_full_unstemmed | Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title_short | Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors † |
title_sort | computational information geometry for binary classification of high-dimensional random tensors † |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7512719/ https://www.ncbi.nlm.nih.gov/pubmed/33265294 http://dx.doi.org/10.3390/e20030203 |
work_keys_str_mv | AT phamgiathuy computationalinformationgeometryforbinaryclassificationofhighdimensionalrandomtensors AT boyerremy computationalinformationgeometryforbinaryclassificationofhighdimensionalrandomtensors AT nielsenfrank computationalinformationgeometryforbinaryclassificationofhighdimensionalrandomtensors |