Graph Signal Sampling via Reinforcement Learning

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
Date
2019-05-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
3077-3081
Series
ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Abstract
We model the sampling and recovery of clustered graph signals as a reinforcement learning (RL) problem. The signal sampling is carried out by an agent which crawls over the graph and selects the most relevant graph nodes to sample. The goal of the agent is to select signal samples which allow for the most accurate recovery. The sample selection is formulated as a multi-armed bandit (MAB) problem, which lends naturally to learning efficient sampling strategies using the well-known gradient MAB algorithm. In a nutshell, the sampling strategy is represented as a probability distribution over the individual arms of the MAB and optimized using gradient ascent. Some illustrative numerical experiments indicate that the sampling strategies obtained from the gradient MAB algorithm outperform existing sampling methods.
Description
Keywords
machine learning, reinforcement learning, multi-armed bandit, graph signal processing, total variation
Other note
Citation
Abramenko , O & Jung , A 2019 , Graph Signal Sampling via Reinforcement Learning . in 44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019; Brighton; United Kingdom; 12-17 May 2019 : Proceedings . , 8683181 , IEEE International Conference on Acoustics Speech and Signal Processing , IEEE , pp. 3077-3081 , IEEE International Conference on Acoustics, Speech, and Signal Processing , Brighton , United Kingdom , 12/05/2019 . https://doi.org/10.1109/ICASSP.2019.8683181