Evènement pour le groupe Séminaire Méthodes Formelles

Date 2017-03-21  11:00-12:00
TitreLearning probability measures 
RésuméSuppose we have a probabilistic algorithm given as a black box and we have access to an output of this algorithm. There are two - related - questions one could ask. (1) Is it possible to make a plausible guess as to which algorithm is in the box? (2) Can we use the output of this algorithm as a random number generator by extracting `pure’ randomness from it? We will look at these questions from the point of view of computability and algorithmic learning theory. [Based on joint work with S. Figueira, B. Monin, and A. Shen] 
OrateurLaurent Bienvenu 
UrlLIRMM Montpellier 

Aucun document lié à cet événement.

Retour à l'index