Jonathan Ullman

Interactive fingerprinting codes and the hardness of preventing false discovery

2016

We show an essentially tight bound on the number of adaptively chosen statistical queries that a computationally efficient algorithm can answer accurately given n samples from an unknown distribution. A statistical query asks for the …

Robust Mediators in Large Games

2015 · arXiv (Cornell University)

A mediator is a mechanism that can only suggest actions to players, as a function of all agents' reported types, in a given game of incomplete information. We study what is achievable by two kinds …

An Antifolk Theorem for Large Repeated Games

2016 · ACM Transactions on Economics and Computation

In this article, we study infinitely repeated games in settings of imperfect monitoring. We first prove a family of theorems showing that when the signals observed by the players satisfy a condition known as (ϵ, …

Differentially Private Algorithms for Learning Mixtures of Separated\n Gaussians

2019 · arXiv (Cornell University)

Learning the parameters of Gaussian mixture models is a fundamental and\nwidely studied problem with numerous applications. In this work, we give new\nalgorithms for learning the parameters of a high-dimensional, well separated,\nGaussian mixture model subject to …