2 problems

0 votes0 replies1 view
Conjecture on sublinear-time complexity for general discounted MDPs
Consider a discounted Markov decision problem and the sublinear-time complexity result of Proposition 3, which uses prior knowledge of the ratio $\frac{c_2}{c_1}$ . Generalization c…
Conjectureopenmarkov-decision-processes randomized-algorithms sublinear-algorithmsarXiv posted 2 days ago
0 votes0 replies0 views
Mixed-norm extension and removal of the distortion restriction for the sparse-recovery algorithm
The paper considers a deterministic sparse-recovery algorithm in the for-all setting that currently provides a $1$ -norm guarantee under a restriction on the distortion factor…
Conjectureopencoding-theory sparse-recovery sublinear-algorithmsarXiv posted 2 days ago

Conjecture on sublinear-time complexity for general discounted MDPs