Moritz Hardt
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| scientific article; zbMATH DE number 7589641 (Why is no real title available?) | 2022-09-21 | Paper |
| Generalization in Overparameterized Models | 2022-02-04 | Paper |
| Private data release via learning thresholds (available as arXiv preprint) | 2019-05-10 | Paper |
| Private data release via learning thresholds | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7051290 (Why is no real title available?) | 2019-05-06 | Paper |
| Gradient descent learns linear dynamical systems | 2018-11-21 | Paper |
| Gradient descent learns linear dynamical systems (available as arXiv preprint) | 2018-11-21 | Paper |
| Comment Journal of the American Statistical Association | 2018-10-23 | Paper |
| Subsampling mathematical relaxations and average-case complexity | 2017-09-29 | Paper |
| The reusable holdout: preserving validity in adaptive data analysis Science | 2017-02-15 | Paper |
| Fairness through awareness Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| Graph densification Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| Strategic classification Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
| Preserving statistical validity in adaptive data analysis (extended abstract) Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Tight bounds for learning a mixture of two Gaussians (extended abstract) Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| On the geometry of differential privacy Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
| How robust are linear sketches to adaptive inputs? Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| Beyond worst-case analysis in private singular vector computation Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| Privately releasing conjunctions and the statistical query barrier Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Beating randomized response on incoherent matrices Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| Higher-order syntax and saturation algorithms for hybrid logic Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
| Privately releasing conjunctions and the statistical query barrier SIAM Journal on Computing | 2013-11-14 | Paper |
| Deterministically testing sparse polynomial identities of unbounded degree Information Processing Letters | 2010-06-16 | Paper |
| Asymptotically Optimal Hitting Sets Against Polynomials Automata, Languages and Programming | 2008-08-28 | Paper |
Research outcomes over time
This page was built for person: Moritz Hardt
