67 citations · 358 across the 36 of their papers we have counts for
3 papers · 1 filter
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis
Lorenzo De Stefani, Eli Upfal
While standard statistical inference techniques and machine learning generalization bounds assume that tests are run on data selected independently of the hypotheses, practical dat…
Learning Equilibria of Simulation-Based Games
Enrique Areyan Viqueira, Cyrus Cousins, Eli Upfal +1
We tackle a fundamental problem in empirical game-theoretic analysis (EGTA), that of learning equilibria of simulation-based games. Such games cannot be described in analytical for…
On the Complexity of Anonymous Communication Through Public Networks
Megumi Ando, Anna Lysyanskaya, Eli Upfal
Onion routing is the most widely used approach to anonymous communication online. The idea is that Alice wraps her message to Bob in layers of encryption to form an "onion," and ro…