Moritz Hardt
I'm a Ph.D. student in Theoretical Computer Science at Princeton in my 3rd year. My advisor is Boaz Barak. Previously, I spent a year as a research scholar at Carnegie Mellon University hosted by Steven Rudich while doing my undergrad at Saarland University. My main research interest is in high-dimensional problems in computer science.
Publications
-
6
On the Geometry of Differential Privacywith Kunal Talwar.
Versions: arXiv:0907.3754v1 [cs.CC]
We determine the error complexity of differentially private mechanism in the non-adaptive linear query model using techniques from high-dimensional convex geometry.
-
5
Subsampling Semidefinite Programs and Max-Cut on the Spherewith Boaz Barak, Thomas Holenstein, David Steurer.
Versions: Manuscript
We prove property testing like bounds for semidefinite programming hierarchies and show some applications including a certifying algorithm for Max-Cut on random geometric graphs (aka Feige-Schechtman graphs).
-
4
The Uniform Hard-Core Lemma Via Approximate Bregman Projections
-
3
Deterministically Testing Sparse Polynomial Identities of Unbounded Degree
-
2
Rounding Parallel Repetitions of Unique Games
-
1
Asymptotically Optimal Hitting Sets Against Polynomials
Some Links
- I've been organizing Theory Lunch at Princeton.
The schedule is part of our Theory Calendar. - There is a Theory
students reading group.
Subscribe for announcements (or see calendar above) - Some courses I took (with useful scribe notes and links):
- Mathematical
methods in TCS (Spring 08)
-
Thinking like a theorist (Fall 07)
- Analysis of Boolean functions (Spring 07)
- Mathematical
methods in TCS (Spring 08)
- Some pictures
