Sensing Radio Maps via Bayesian Tensor Learning

Spatial-spectral radio map estimation (RME) from sparsely deployed sensors can be viewed as a tensor learning problem. Among tensor models, the block-term decomposition (BTD) model is especially effective for RME, enabling accurate recovery of the radio map as well as emitter-level spatial loss field (SLF) and power spectral density (PSD). However, selecting the appropriate tensor and block-term ranks in the BTD model is crucial yet challenging, as the ranks indicate the number and properties of emitters, which are typically unknown in practice. Inappropriate settings of these ranks leads to overfitting and underfitting of the model. Existing optimization-based BTD learning methods either unrealistically assume that these ranks are known or require parameter tuning. To address these issues, we propose a Bayesian BTD model that incorporates sparsitypromoting priors on the factor matrices for rank learning, eliminating the need for parameter tuning while learning all other parameters. Extensive numerical experiments showcase the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161174
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sensing Radio Maps via Bayesian Tensor Learning

Zhongtao Chen, Yik‐Chung Wu, Lei Cheng
Speech and Audio Processing
article

Sensing Radio Maps via Bayesian Tensor Learning

Zhongtao Chen, Yik‐Chung Wu, Lei Cheng
article en

Abstract

Spatial-spectral radio map estimation (RME) from sparsely deployed sensors can be viewed as a tensor learning problem. Among tensor models, the block-term decomposition (BTD) model is especially effective for RME, enabling accurate recovery of the radio map as well as emitter-level spatial loss field (SLF) and power spectral density (PSD). However, selecting the appropriate tensor and block-term ranks in the BTD model is crucial yet challenging, as the ranks indicate the number and properties of emitters, which are typically unknown in practice. Inappropriate settings of these ranks leads to overfitting and underfitting of the model. Existing optimization-based BTD learning methods either unrealistically assume that these ranks are known or require parameter tuning. To address these issues, we propose a Bayesian BTD model that incorporates sparsitypromoting priors on the factor matrices for rank learning, eliminating the need for parameter tuning while learning all other parameters. Extensive numerical experiments showcase the effectiveness of the proposed method.

Zhejiang University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 67%
Speech and Audio Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.