2 citations · 3 across the 4 of their papers we have counts for
4 papers
Sparsifying Cayley Graphs on Every Group
Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty +2
A classic result in graph theory, due to Batson, Spielman, and Srivastava (STOC 2009) shows that every graph admits a cut (or spectral) sparsifier which prese…
The Fundamental Limits of Recovering Planted Subgraphs
Daniel Lee, Francisco Pernice, Amit Rajaraman +1
Given an arbitrary subgraph and , the planted subgraph model is defined as follows. A statistician observes the union a random copy of , together…
From Pseudorandomness to Multi-Group Fairness and Back
Cynthia Dwork, Daniel Lee, Huijia Lin +1
We identify and explore connections between the recent literature on multi-group fairness for prediction algorithms and the pseudorandomness notions of leakage-resilience and graph…
Online Minimax Multiobjective Optimization: Multicalibeating and Other Applications
Daniel Lee, Georgy Noarov, Mallesh Pai +1
We introduce a simple but general online learning framework in which a learner plays against an adversary in a vector-valued game that changes every round. Even though the learner'…