Moritz Hardt

According to our database1, Moritz Hardt authored at least 74 papers between 2007 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Gradient Descent Learns Linear Dynamical Systems.
Journal of Machine Learning Research, 2018

Massively Parallel Hyperparameter Tuning.
CoRR, 2018

Sanity Checks for Saliency Maps.
CoRR, 2018

Group calibration is a byproduct of unconstrained learning.
CoRR, 2018

The Social Cost of Strategic Classification.
CoRR, 2018

Model Reconstruction from Model Explanations.
CoRR, 2018

When Recurrent Models Don't Need To Be Recurrent.
CoRR, 2018

Delayed Impact of Fair Machine Learning.
CoRR, 2018

Delayed Impact of Fair Machine Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Avoiding Discrimination through Causal Reasoning.
CoRR, 2017

Climbing a shaky ladder: Better adaptive risk estimation.
CoRR, 2017

Guilt-free data reuse.
Commun. ACM, 2017

Avoiding Discrimination through Causal Reasoning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Private Spectral Analysis.
Encyclopedia of Algorithms, 2016

Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).
SIAM J. Comput., 2016

Understanding deep learning requires rethinking generalization.
CoRR, 2016

Equality of Opportunity in Supervised Learning.
CoRR, 2016

Gradient Descent Learns Linear Dynamical Systems.
CoRR, 2016

Identity Matters in Deep Learning.
CoRR, 2016

Equality of Opportunity in Supervised Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Strategic Classification.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Train faster, generalize better: Stability of stochastic gradient descent.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Train faster, generalize better: Stability of stochastic gradient descent.
CoRR, 2015

Strategic Classification.
CoRR, 2015

Generalization in Adaptive Data Analysis and Holdout Reuse.
CoRR, 2015

The Ladder: A Reliable Leaderboard for Machine Learning Competitions.
CoRR, 2015

Tight Bounds for Learning a Mixture of Two Gaussians.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Preserving Statistical Validity in Adaptive Data Analysis.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Generalization in Adaptive Data Analysis and Holdout Reuse.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Differentially Private Learning of Structured Discrete Distributions.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

The Ladder: A Reliable Leaderboard for Machine Learning Competitions.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Fast matrix completion without the condition number.
CoRR, 2014

Preventing False Discovery in Interactive Data Analysis is Hard.
CoRR, 2014

Sharp bounds for learning a mixture of two gaussians.
CoRR, 2014

Computational Limits for Matrix Completion.
CoRR, 2014

Preserving Statistical Validity in Adaptive Data Analysis.
CoRR, 2014

The Noisy Power Method: A Meta Algorithm with Applications.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Preventing False Discovery in Interactive Data Analysis Is Hard.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Understanding Alternating Minimization for Matrix Completion.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Fast matrix completion without the condition number.
Proceedings of The 27th Conference on Learning Theory, 2014

Computational Limits for Matrix Completion.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Privately Releasing Conjunctions and the Statistical Query Barrier.
SIAM J. Comput., 2013

On the Provable Convergence of Alternating Minimization for Matrix Completion.
CoRR, 2013

Robust Subspace Iteration and Privacy-Preserving Spectral Analysis.
CoRR, 2013

How robust are linear sketches to adaptive inputs?
Proceedings of the Symposium on Theory of Computing Conference, 2013

Beyond worst-case analysis in private singular vector computation.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Multiple Kernel Completion and its application to cardiac disease discrimination.
Proceedings of the 10th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2013

Algorithms and Hardness for Robust Subspace Recovery.
Proceedings of the COLT 2013, 2013

Robust subspace iteration and privacy-preserving spectral analysis.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
How Robust are Linear Sketches to Adaptive Inputs?
CoRR, 2012

Can We Reconcile Robustness and Efficiency in Unsupervised Learning?
CoRR, 2012

Beyond Worst-Case Analysis in Private Singular Vector Computation
CoRR, 2012

Beating randomized response on incoherent matrices.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Private data release via learning thresholds.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Simple and Practical Algorithm for Differentially Private Data Release.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Graph densification.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Fairness through awareness.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Beating Randomized Response on Incoherent Matrices
CoRR, 2011

Private Data Release via Learning Thresholds
CoRR, 2011

Fairness Through Awareness
CoRR, 2011

Privately releasing conjunctions and the statistical query barrier.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Subsampling Mathematical Relaxations and Average-case Complexity.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
A simple and practical algorithm for differentially private data release
CoRR, 2010

Privately Releasing Conjunctions and the Statistical Query Barrier
CoRR, 2010

On the geometry of differential privacy.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
Deterministically testing sparse polynomial identities of unbounded degree.
Inf. Process. Lett., 2009

Subsampling Semidefinite Programs and Max-Cut on the Sphere.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Subsampling Semidefinite Programs and Max-Cut on the Sphere
CoRR, 2009

On the Geometry of Differential Privacy
CoRR, 2009

The uniform hardcore lemma via approximate Bregman projections.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Asymptotically Optimal Hitting Sets Against Polynomials.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Rounding Parallel Repetitions of Unique Games.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic.
Electr. Notes Theor. Comput. Sci., 2007


  Loading...