Pseudo-derandomizing learning and approximation

We continue the study of pseudo-deterministic algorithms initiated by Gat and Goldwasser [Eran Gat and Shafi Goldwasser, 2011]. A pseudo-deterministic algorithm is a probabilistic algorithm which produces a fixed output with high probability. We explore pseudo-determinism in the settings of learning...

Description complète

Détails bibliographiques
Auteurs principaux: Oliveira, I, Santhanam, R
Format: Conference item
Publié: Schloss Dagstuhl 2018