Reinforcement Learning-Aided Markov Chain Monte Carlo For Lattice Gaussian Sampling

Sampling from the lattice Gaussian distribution has emerged as a key problem in coding, decoding and cryptography. In this paper, the Gibbs sampling from Markov chain Monte Carlo (MCMC) methods is investigated for lattice Gaussian sampling. Firstly, the error function of random scan Gibbs sampling i...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2021 IEEE Information Theory Workshop (ITW) s. 1 - 5
Hlavní autoři:	Wang, Zheng, Xia, Yili, Lyu, Shanxiang, Ling, Cong
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 17.10.2021
Témata:	Gaussian distribution lattice coding and decoding Lattice Gaussian sampling Lattices Markov chain Monte Carlo Markov processes MIMO detection Monte Carlo methods Performance gain Reinforcement learning Simulation
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Sampling from the lattice Gaussian distribution has emerged as a key problem in coding, decoding and cryptography. In this paper, the Gibbs sampling from Markov chain Monte Carlo (MCMC) methods is investigated for lattice Gaussian sampling. Firstly, the error function of random scan Gibbs sampling is derived, and we show that it is partially determined by the selection probabilities over the sampling components. Then, in order to minimize the error function for a better sampling performance, a reinforcement learning mechanism is proposed for random scan Gibbs sampling to adaptively update the selection probabilities by learning from the random samples generated along with the chain. Finally, simulation results based on MIMO detection are presented to confirm the performance gain at the expense of limited complexity cost.
DOI:	10.1109/ITW48936.2021.9611412