Corpus ID: 233481126

Anytime Decoding by Monte-Carlo Tree Search

@article{Xu2021AnytimeDB,
  title={Anytime Decoding by Monte-Carlo Tree Search},
  author={Aolin Xu},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.00056}
}
  • Aolin Xu
  • Published 30 April 2021
  • Computer Science, Mathematics
  • ArXiv
An anytime decoding algorithm for tree codes using Monte-Carlo tree search is proposed. The meaning of anytime decoding here is twofold: 1) the decoding algorithm is an anytime algorithm, whose decoding performance improves as more computational resource, measured by decoding time, is allowed, and 2) the proposed decoding algorithm can approximate the maximum-likelihood sequence decoding of tree codes, which has the anytime reliability when the code is properly designed. The above anytime… Expand

Figures from this paper

References

SHOWING 1-10 OF 18 REFERENCES
From sequential decoding to channel polarization and back again
TLDR
An account of the original ideas that motivated the development of polar coding is given and some new ideas for exploiting channel polarization more effectively in order to improve the performance of polar codes are discussed. Expand
Mastering the game of Go without human knowledge
TLDR
An algorithm based solely on reinforcement learning is introduced, without human data, guidance or domain knowledge beyond game rules, that achieves superhuman performance, winning 100–0 against the previously published, champion-defeating AlphaGo. Expand
Linear Time-Invariant Anytime Codes for Control Over Noisy Channels
TLDR
An ensemble of random causal linear codes with a time invariant structure and it is shown that they are tree codes with probability one, and novel sufficient conditions on the rate and reliability required of the tree codes to stabilize vector plants are given and are argued to be asymptotically tight. Expand
Mastering the game of Go with deep neural networks and tree search
TLDR
Using this search algorithm, the program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0.5, the first time that a computer program has defeated a human professional player in the full-sized game of Go. Expand
Anytime Reliability of Spatially Coupled Codes
TLDR
This paper designs and investigates an efficient channel coding scheme based on spatially coupled codes for anytime transmission, and investigates its performance over binary erasure channels and binary input additive white Gaussian noise channels. Expand
Decision Making Under Uncertainty: Theory and Application
TLDR
This book provides an introduction to the challenges of decision making under uncertainty from a computational perspective and presents both the theory behind decision making models and algorithms and a collection of example applications that range from speech recognition to aircraft collision avoidance. Expand
Systematic LDPC Convolutional Codes: Asymptotic and Finite-Length Anytime Properties
Here we propose an ensemble of non-terminated systematic LDPC convolutional codes with increasing memory, and show that, over the binary erasure channel (BEC), these codes achieve anytime reliabilityExpand
Coding for noisy channels
TLDR
This chapter begins with a development of the classic fundamental results of Feinstein regarding reliable communication of block codes and the relation of operational channel capacity to Shannon capacity for discrete channels and a technique of Dobrushin is used to extend Feinstein's results for channels with no input memory or anticipation by making codes robust to small changes in the conditional distributions describing channels. Expand
Bandit Based Monte-Carlo Planning
TLDR
A new algorithm is introduced, UCT, that applies bandit ideas to guide Monte-Carlo planning and is shown to be consistent and finite sample bounds are derived on the estimation error due to sampling. Expand
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
  • Rémi Coulom
  • Mathematics, Computer Science
  • Computers and Games
  • 2006
TLDR
A new framework to combine tree search with Monte-Carlo evaluation, that does not separate between a min-max phase and a Monte- carlo phase is presented, that provides finegrained control of the tree growth, at the level of individual simulations, and allows efficient selectivity. Expand
...
1
2
...