Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability

Nina Holden; Robin Pemantle; Yuval Peres

Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability

Nina Holden, Robin Pemantle, Yuval Peres

Proceedings of the 31st Conference On Learning Theory, PMLR 75:1799-1840, 2018.

Abstract

The deletion-insertion channel takes as input a bit string

${\bf x}\in \{0,1\}^{n}$ , and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover

$\bf x$ from many independent outputs (called “traces”) of the deletion-insertion channel applied to

$\bf x$ . We show that if

$\bf x$ is chosen uniformly at random, then

$\exp(O(\log^{1/3} n))$ traces suffice to reconstruct

$\bf x$ with high probability. For the deletion channel with deletion probability

$q<1/2$ the earlier upper bound was

$\exp(O(\log^{1/2} n))$ . The case of

$q\geq 1/2$ or the case where insertions are allowed has not been previously analysed, and therefore the earlier upper bound was as for worst-case strings, i.e.,

$\exp(O( n^{1/3}))$ . A key ingredient in our proof is a delicate two-step alignment procedure where we estimate the location in each trace corresponding to a given bit of

$\bf x$ . The alignment is done by viewing the strings as random walks, and comparing the increments in the walk associated with the input string and the trace, respectively.

Cite this Paper

BibTeX


@InProceedings{pmlr-v75-holden18a,
  title = 	 {Subpolynomial trace reconstruction for random strings \\{and} arbitrary deletion probability},
  author =       {Holden, Nina and Pemantle, Robin and Peres, Yuval},
  booktitle = 	 {Proceedings of the 31st  Conference On Learning Theory},
  pages = 	 {1799--1840},
  year = 	 {2018},
  editor = 	 {Bubeck, Sébastien and Perchet, Vianney and Rigollet, Philippe},
  volume = 	 {75},
  series = 	 {Proceedings of Machine Learning Research},
  month = 	 {06--09 Jul},
  publisher =    {PMLR},
  pdf = 	 {http://proceedings.mlr.press/v75/holden18a/holden18a.pdf},
  url = 	 {https://proceedings.mlr.press/v75/holden18a.html},
  abstract = 	 {The deletion-insertion channel takes as input a bit string ${\bf x}\in \{0,1\}^{n}$, and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover $\bf x$ from many independent outputs (called “traces”) of the deletion-insertion channel applied to $\bf x$. We show that if $\bf x$ is chosen uniformly at random, then $\exp(O(\log^{1/3} n))$ traces suffice to reconstruct $\bf x$ with high probability. For the deletion channel with deletion probability $q<1/2$ the earlier upper bound was $\exp(O(\log^{1/2} n))$. The case of $q\geq 1/2$ or the case where insertions are allowed has not been previously analysed, and therefore the earlier upper bound was as for worst-case strings, i.e., $\exp(O( n^{1/3}))$. A key ingredient in our proof is a delicate two-step alignment procedure where we estimate the location in each trace corresponding to a given bit of $\bf x$. The alignment is done by viewing the strings as random walks, and comparing the increments in the walk associated with the input string and the trace, respectively.}
}

Endnote

%0 Conference Paper
%T Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability
%A Nina Holden
%A Robin Pemantle
%A Yuval Peres
%B Proceedings of the 31st  Conference On Learning Theory
%C Proceedings of Machine Learning Research
%D 2018
%E Sébastien Bubeck
%E Vianney Perchet
%E Philippe Rigollet	
%F pmlr-v75-holden18a
%I PMLR
%P 1799--1840
%U https://proceedings.mlr.press/v75/holden18a.html
%V 75
%X The deletion-insertion channel takes as input a bit string ${\bf x}\in \{0,1\}^{n}$, and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover $\bf x$ from many independent outputs (called “traces”) of the deletion-insertion channel applied to $\bf x$. We show that if $\bf x$ is chosen uniformly at random, then $\exp(O(\log^{1/3} n))$ traces suffice to reconstruct $\bf x$ with high probability. For the deletion channel with deletion probability $q<1/2$ the earlier upper bound was $\exp(O(\log^{1/2} n))$. The case of $q\geq 1/2$ or the case where insertions are allowed has not been previously analysed, and therefore the earlier upper bound was as for worst-case strings, i.e., $\exp(O( n^{1/3}))$. A key ingredient in our proof is a delicate two-step alignment procedure where we estimate the location in each trace corresponding to a given bit of $\bf x$. The alignment is done by viewing the strings as random walks, and comparing the increments in the walk associated with the input string and the trace, respectively.

APA


Holden, N., Pemantle, R. & Peres, Y.. (2018). Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability. Proceedings of the 31st  Conference On Learning Theory, in Proceedings of Machine Learning Research 75:1799-1840 Available from https://proceedings.mlr.press/v75/holden18a.html.

Related Material

Download PDF