Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Bentley, Jason W."'
We demonstrate how a target model's generalization gap leads directly to an effective deterministic black box membership inference attack (MIA). This provides an upper bound on how secure a model can be to MIA based on a simple metric. Moreover, this
Externí odkaz:
http://arxiv.org/abs/2009.05669
We present the first fine-grained complexity results on two classic problems on strings. The first one is the k-Median-Edit-Distance problem, where the input is a collection of k strings, each of length at most n, and the task is to find a new string
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45c15f481b0b12b5ac71ff9d0b189502