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
research
05/10/2023

A Near-Optimal Deterministic Distributed Synchronizer

We provide the first deterministic distributed synchronizer with near-op...
research
11/03/2020

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms

We define a search problem on trees that closely captures the backtracki...
research
12/06/2019

Constructive derandomization of query algorithms

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

Near-Optimal Search Time in δ-Optimal Space

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

Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgrou...
research
02/06/2020

Near-optimal Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms for the Non-episodic Setting

We study reinforcement learning in factored Markov decision processes (F...
research
11/09/2020

Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement

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

Please sign up or login with your details

Forgot password? Click here to reset