DeepAI
Log In Sign Up

Peek Search: Near-Optimal Online Markov Decoding

10/16/2018
by   Vikas K. Garg, et al.
0

We resolve the fundamental problem of online decoding with ergodic Markov models. Specifically, we provide deterministic and randomized algorithms that are provably near-optimal under latency constraints with respect to the unconstrained offline optimal algorithm. Our algorithms admit efficient implementation via dynamic programs, and extend to (possibly adversarial) non-stationary or time-varying Markov settings as well. Moreover, we establish lower bounds in both deterministic and randomized settings subject to latency requirements, and prove that no online algorithm can perform significantly better than our algorithms.

READ FULL TEXT
08/04/2021

Singularly Near Optimal Leader Election in Asynchronous Networks

This paper concerns designing distributed algorithms that are singularly...
12/06/2019

Constructive derandomization of query algorithms

We give efficient deterministic algorithms for converting randomized que...
06/01/2022

Near-Optimal Search Time in δ-Optimal Space

Two recent lower bounds on the compressiblity of repetitive sequences, δ...
04/29/2021

Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgrou...
09/22/2022

Canadian Traveller Problem with Predictions

In this work, we consider the k-Canadian Traveller Problem (k-CTP) under...
11/09/2020

Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement

Lower bounds and impossibility results in distributed computing are both...