Moritz Hardt - Google Scholar Citations

Cited by

	All	Since 2014
Citations	5881	5456
h-index	31	29
i10-index	42	39

1900

950

475

1425

2009201020112012201320142015201620172018201915 36 45 114 175 217 300 490 941 1593 1880

Co-authors

Benjamin RechtAssociate Professor of EECS, University of California, BerkeleyVerified email at eecs.berkeley.edu
Aaron RothAssociate Professor of Computer Science, University of PennsylvaniaVerified email at cis.upenn.edu
Cynthia DworkMicrosoft ResearchVerified email at microsoft.com
Omer ReingoldStanford UniversityVerified email at stanford.edu
Eric PriceAssistant Professor of Computer Science at the University of Texas at AustinVerified email at cs.utexas.edu
Chiyuan ZhangGoogle BrainVerified email at google.com
Samy BengioResearch Scientist, Google BrainVerified email at google.com
Oriol VinyalsResearch Scientist at Google DeepMindVerified email at google.com
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Guy RothblumWeizmann Institute of ScienceVerified email at alum.mit.edu
Richard ZemelProfessor of Computer Science, University of TorontoVerified email at cs.toronto.edu
Nathan SrebroProfessor, TTIC and University of ChicagoVerified email at ttic.edu
Kunal TalwarGoogle BrainVerified email at kunaltalwar.org
David SteurerETH ZürichVerified email at inf.ethz.ch
Jonathan UllmanAssistant Professor of Computer Science, Northeastern UniversityVerified email at ccs.neu.edu
Mary WoottersStanford UniversityVerified email at stanford.edu
MAX SIMCHOWITZUC BerkeleyVerified email at berkeley.edu
Lydia T. LiuComputer Science, UC BerkeleyVerified email at berkeley.edu
Katrina LigettHebrew UniversityVerified email at mail.huji.ac.il
Frank McSherryMaterialize, Inc.Verified email at materialize.io

Moritz Hardt

University of California, Berkeley

Verified email at berkeley.edu - Homepage

...


Title	Cited by	Year
Understanding deep learning requires rethinking generalization C Zhang, S Bengio, M Hardt, B Recht, O Vinyals ICLR 2017, 2017	1166	2017
Fairness through awareness C Dwork, M Hardt, T Pitassi, O Reingold, R Zemel ITCS 2012, 214-226, 2012	656	2012
Equality of opportunity in supervised learning M Hardt, E Price, N Srebro NIPS 2016, 3315-3323, 2016	584	2016
Train faster, generalize better: Stability of stochastic gradient descent M Hardt, B Recht, Y Singer ICML 2016, 1225-1234, 2015	337	2015
A multiplicative weights mechanism for privacy-preserving data analysis M Hardt, GN Rothblum FOCS 2010, 61-70, 2010	262	2010
A simple and practical algorithm for differentially private data release M Hardt, K Ligett, F McSherry NIPS 2012, 2348-2356, 2012	261	2012
On the geometry of differential privacy M Hardt, K Talwar STOC 2010, 705-714, 2010	248	2010
Understanding alternating minimization for matrix completion M Hardt FOCS 2014, 2014	185*	2014
Preserving statistical validity in adaptive data analysis C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth STOC 2015, 2014	176	2014
The reusable holdout: Preserving validity in adaptive data analysis C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth Science 349 (6248), 636-638, 2015	173	2015
Identity matters in deep learning M Hardt, T Ma ICLR 2017, 2017	163	2017
Avoiding discrimination through causal reasoning N Kilbertus, MR Carulla, G Parascandolo, M Hardt, D Janzing, ... NIPS 2017, 656-666, 2017	127	2017
Privately releasing conjunctions and the statistical query barrier A Gupta, M Hardt, A Roth, J Ullman SIAM Journal on Computing 42 (4), 1494-1520, 2013	114	2013
Generalization in adaptive data analysis and holdout reuse C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth NIPS 2015, 2350-2358, 2015	109	2015
The noisy power method: A meta algorithm with applications M Hardt, E Price NIPS 2014, 2861-2869, 2014	108*	2014
Sanity checks for saliency maps J Adebayo, J Gilmer, M Muelly, I Goodfellow, M Hardt, B Kim NeurIPS 2018, 2018	85	2018
Gradient descent learns linear dynamical systems M Hardt, T Ma, B Recht arXiv preprint arXiv:1609.05191, 2016	82	2016
Fast matrix completion without the condition number M Hardt, M Wootters COLT 2014, 638-678, 2014	78	2014
Beyond worst-case analysis in private singular vector computation M Hardt, A Roth STOC 2013, 331-340, 2013	75	2013
Preventing false discovery in interactive data analysis is hard M Hardt, J Ullman FOCS 2014, 454-463, 2014	71	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors