List and certificate complexities in replicable learning
We investigate replicable learning algorithms. Informally a learning algorithm is replicable if
the algorithm outputs the same canonical hypothesis over multiple runs with high probability …
the algorithm outputs the same canonical hypothesis over multiple runs with high probability …
Polynomial-time pseudodeterministic construction of primes
A randomized algorithm for a search problem is pseudodeterministic if it produces a fixed
canonical solution to the search problem with high probability. In their seminal work on the …
canonical solution to the search problem with high probability. In their seminal work on the …
Pseudodeterministic algorithms and the structure of probabilistic time
Z Lu, IC Oliveira, R Santhanam - Proceedings of the 53rd Annual ACM …, 2021 - dl.acm.org
We connect the study of pseudodeterministic algorithms to two major open problems about
the structural complexity of BPTIME: proving hierarchy theorems and showing the existence …
the structural complexity of BPTIME: proving hierarchy theorems and showing the existence …
Tight space lower bound for pseudo-deterministic approximate counting
We investigate one of the most basic problems in streaming algorithms: approximating the
number of elements in the stream. Famously, Mor78 gave a randomized algorithm achieving …
number of elements in the stream. Famously, Mor78 gave a randomized algorithm achieving …
Lower bounds for pseudo-deterministic counting in a stream
Many streaming algorithms provide only a high-probability relative approximation. These
two relaxations, of allowing approximation and randomization, seem necessary--for many …
two relaxations, of allowing approximation and randomization, seem necessary--for many …
Pseudo-deterministic streaming
S Goldwasser, O Grossman, S Mohanty… - arXiv preprint arXiv …, 2019 - arxiv.org
A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple
times on the same input, with high probability outputs the same result on all executions …
times on the same input, with high probability outputs the same result on all executions …
Reproducibility and pseudo-determinism in log-space
O Grossman, YP Liu - Proceedings of the Thirtieth Annual ACM-SIAM …, 2019 - SIAM
A curious property of randomized log-space search algorithms is that their outputs are often
longer than their workspace. This leads to the question: how can we reproduce the results of …
longer than their workspace. This leads to the question: how can we reproduce the results of …
Pseudodeterminism: promises and lowerbounds
A probabilistic algorithm A is pseudodeterministic if, on every input, there exists a canonical
value that is output with high probability. If the algorithm outputs one of k canonical values …
value that is output with high probability. If the algorithm outputs one of k canonical values …
On the pseudo-deterministic query complexity of NP search problems
We study pseudo-deterministic query complexity-randomized query algorithms that are
required to output the same answer with high probability on all inputs. We prove Ω (√ n) …
required to output the same answer with high probability on all inputs. We prove Ω (√ n) …
On pseudodeterministic approximation algorithms
We investigate the notion of pseudodeterminstic approximation algorithms. A randomized
approximation algorithm A for a function f is pseudodeterministic if for every input x there is a …
approximation algorithm A for a function f is pseudodeterministic if for every input x there is a …