default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoritz Hardt
Person information
- affiliation: Max Planck Institute for Intelligent Systems, Germany
- affiliation (former): University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c71]André F. Cruz
, Moritz Hardt:
Unprocessing Seven Years of Algorithmic Fairness. ICLR 2024- [c70]Moritz Hardt, Yu Sun:
Test-Time Training on Nearest Neighbors for Large Language Models. ICLR 2024 - [c69]Gary Cheng, Moritz Hardt, Celestine Mendler-Dünner:
Causal Inference out of Control: Estimating Performativity without Treatment Randomization. ICML 2024 - [c68]Florian E. Dorner, Moritz Hardt:
Don't Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budget. ICML 2024 - [c67]Ali Shirali, Rediet Abebe, Moritz Hardt:
Allocation Requires Prediction Only if Inequality Is Low. ICML 2024 - [c66]Ana-Andreea Stoica, Vivian Y. Nastl, Moritz Hardt:
Causal Inference from Competing Treatments. ICML 2024 - [c65]Guanhua Zhang, Moritz Hardt:
Inherent Trade-Offs between Diversity and Stability in Multi-Task Benchmarks. ICML 2024 - [i77]Florian E. Dorner, Moritz Hardt:
Don't Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budget. CoRR abs/2402.02249 (2024) - [i76]Vivian Y. Nastl, Moritz Hardt:
Predictors from causal features do not generalize better to new domains. CoRR abs/2402.09891 (2024) - [i75]Olawale Salaudeen, Moritz Hardt:
ImageNot: A contrast with ImageNet preserves model rankings. CoRR abs/2404.02112 (2024) - [i74]Guanhua Zhang, Moritz Hardt:
Inherent Trade-Offs between Diversity and Stability in Multi-Task Benchmarks. CoRR abs/2405.01719 (2024) - [i73]Celestine Mendler-Dünner, Gabriele Carovano, Moritz Hardt:
An engine not a camera: Measuring performative power of online search. CoRR abs/2405.19073 (2024) - [i72]Ana-Andreea Stoica, Vivian Y. Nastl, Moritz Hardt:
Causal Inference from Competing Treatments. CoRR abs/2406.03422 (2024) - [i71]Ali Shirali, Rediet Abebe, Moritz Hardt:
Allocation Requires Prediction Only if Inequality Is Low. CoRR abs/2406.13882 (2024) - [i70]Ricardo Dominguez-Olmedo, Florian E. Dorner, Moritz Hardt:
Training on the Test Task Confounds Evaluation and Emergence. CoRR abs/2407.07890 (2024) - [i69]Mina Remeli, Moritz Hardt, Robert C. Williamson:
Limits to Predicting Online Speech Using Large Language Models. CoRR abs/2407.12850 (2024) - [i68]André F. Cruz, Moritz Hardt, Celestine Mendler-Dünner:
Evaluating language models as risk scores. CoRR abs/2407.14614 (2024) - [i67]Ricardo Dominguez-Olmedo, Vedant Nanda, Rediet Abebe, Stefan Bechtold, Christoph Engel, Jens Frankenreiter, Krishna P. Gummadi, Moritz Hardt, Michael Livermore:
Lawma: The Power of Specialization for Legal Tasks. CoRR abs/2407.16615 (2024) - 2023
- [c64]Michael P. Kim, Moritz Hardt:
Is Your Model Predicting the Past? EAAMO 2023: 5:1-5:8 - [c63]Ali Shirali, Rediet Abebe, Moritz Hardt:
A Theory of Dynamic Benchmarks. ICLR 2023 - [c62]Moritz Hardt, Eric Mazumdar, Celestine Mendler-Dünner, Tijana Zrnic:
Algorithmic Collective Action in Machine Learning. ICML 2023: 12570-12586 - [e1]Alice Oh, Tristan Naumann, Amir Globerson, Kate Saenko, Moritz Hardt, Sergey Levine:
Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023. 2023 [contents] - [i66]Moritz Hardt, Eric Mazumdar, Celestine Mendler-Dünner, Tijana Zrnic:
Algorithmic Collective Action in Machine Learning. CoRR abs/2302.04262 (2023) - [i65]Gary Cheng, Moritz Hardt, Celestine Mendler-Dünner:
Causal Inference out of Control: Estimating the Steerability of Consumption. CoRR abs/2302.04989 (2023) - [i64]Juan C. Perdomo, Tolani Britton, Moritz Hardt, Rediet Abebe:
Difficult Lessons on Social Prediction from Wisconsin Public Schools. CoRR abs/2304.06205 (2023) - [i63]Moritz Hardt, Yu Sun:
Test-Time Training on Nearest Neighbors for Large Language Models. CoRR abs/2305.18466 (2023) - [i62]André F. Cruz, Moritz Hardt:
Unprocessing Seven Years of Algorithmic Fairness. CoRR abs/2306.07261 (2023) - [i61]Ricardo Dominguez-Olmedo, Moritz Hardt, Celestine Mendler-Dünner:
Questioning the Survey Responses of Large Language Models. CoRR abs/2306.07951 (2023) - [i60]Ali Shirali, Moritz Hardt:
What Makes ImageNet Look Unlike LAION. CoRR abs/2306.15769 (2023) - [i59]Moritz Hardt, Celestine Mendler-Dünner:
Performative Prediction: Past and Future. CoRR abs/2310.16608 (2023) - 2022
- [j7]Ferenc Huszár, Sofia Ira Ktena, Conor O'Brien, Luca Belli, Andrew Schlaikjer, Moritz Hardt:
Algorithmic amplification of politics on Twitter. Proc. Natl. Acad. Sci. USA 119(1): e2025334119 (2022) - [c61]Smitha Milli, Luca Belli, Moritz Hardt:
Causal Inference Struggles with Agency on Online Platforms. FAccT 2022: 357-365 - [c60]Rediet Abebe, Moritz Hardt, Angela Jin, John Miller, Ludwig Schmidt, Rebecca Wexler:
Adversarial Scrutiny of Evidentiary Statistical Software. FAccT 2022: 1733-1746 - [c59]Moritz Hardt, Meena Jagadeesan, Celestine Mendler-Dünner:
Performative Power. NeurIPS 2022 - [i58]Moritz Hardt, Meena Jagadeesan, Celestine Mendler-Dünner:
Performative Power. CoRR abs/2203.17232 (2022) - [i57]Rediet Abebe, Moritz Hardt, Angela Jin, John Miller, Ludwig Schmidt, Rebecca Wexler:
Adversarial Scrutiny of Evidentiary Statistical Software. CoRR abs/2206.09305 (2022) - [i56]Moritz Hardt, Michael P. Kim:
Backward baselines: Is your model predicting the past? CoRR abs/2206.11673 (2022) - [i55]Ali Shirali, Rediet Abebe, Moritz Hardt:
A Theory of Dynamic Benchmarks. CoRR abs/2210.03165 (2022) - [i54]Luca Belli, Kyra Yee, Uthaipon Tantipongpipat, Aaron Gonzales, Kristian Lum, Moritz Hardt:
County-level Algorithmic Audit of Racial Bias in Twitter's Home Timeline. CoRR abs/2211.08667 (2022) - 2021
- [j6]Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals:
Understanding deep learning (still) requires rethinking generalization. Commun. ACM 64(3): 107-115 (2021) - [c58]Smitha Milli, Luca Belli, Moritz Hardt:
From Optimizing Engagement to Measuring Value. FAccT 2021: 714-722 - [c57]Meena Jagadeesan, Celestine Mendler-Dünner, Moritz Hardt:
Alternative Microfoundations for Strategic Classification. ICML 2021: 4687-4697 - [c56]Frances Ding, Moritz Hardt, John Miller, Ludwig Schmidt:
Retiring Adult: New Datasets for Fair Machine Learning. NeurIPS 2021: 6478-6490 - [i53]Moritz Hardt, Benjamin Recht:
Patterns, predictions, and actions: A story about machine learning. CoRR abs/2102.05242 (2021) - [i52]Meena Jagadeesan, Celestine Mendler-Dünner, Moritz Hardt:
Alternative Microfoundations for Strategic Classification. CoRR abs/2106.12705 (2021) - [i51]Smitha Milli, Luca Belli, Moritz Hardt:
Causal Inference Struggles with Agency on Online Platforms. CoRR abs/2107.08995 (2021) - [i50]Frances Ding, Moritz Hardt, John Miller, Ludwig Schmidt:
Retiring Adult: New Datasets for Fair Machine Learning. CoRR abs/2108.04884 (2021) - [i49]Ferenc Huszár, Sofia Ira Ktena, Conor O'Brien, Luca Belli, Andrew Schlaikjer, Moritz Hardt:
Algorithmic Amplification of Politics on Twitter. CoRR abs/2110.11010 (2021) - 2020
- [c55]Chloe Ching-Yun Hsu, Michaela Hardt, Moritz Hardt:
Linear Dynamics: Clustering without identification. AISTATS 2020: 918-929 - [c54]Michaela Hardt, Alvin Rajkomar, Gerardo Flores, Andrew M. Dai, Michael D. Howell, Greg Corrado, Claire Cui, Moritz Hardt:
Explaining an increase in predicted risk for clinical alerts. CHIL 2020: 80-89 - [c53]Chiyuan Zhang, Samy Bengio, Moritz Hardt, Michael C. Mozer, Yoram Singer:
Identity Crisis: Memorization and Generalization Under Extreme Overparameterization. ICLR 2020 - [c52]John Miller, Smitha Milli, Moritz Hardt:
Strategic Classification is Causal Modeling in Disguise. ICML 2020: 6917-6926 - [c51]Juan C. Perdomo, Tijana Zrnic, Celestine Mendler-Dünner, Moritz Hardt:
Performative Prediction. ICML 2020: 7599-7609 - [c50]Esther Rolf, Max Simchowitz, Sarah Dean, Lydia T. Liu, Daniel Björkegren, Moritz Hardt, Joshua Blumenstock:
Balancing Competing Objectives with Noisy Data: Score-Based Classifiers for Welfare-Aware Machine Learning. ICML 2020: 8158-8168 - [c49]Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei A. Efros, Moritz Hardt:
Test-Time Training with Self-Supervision for Generalization under Distribution Shifts. ICML 2020: 9229-9248 - [c48]Liam Li, Kevin G. Jamieson, Afshin Rostamizadeh, Ekaterina Gonina, Jonathan Ben-tzur, Moritz Hardt, Benjamin Recht, Ameet Talwalkar:
A System for Massively Parallel Hyperparameter Tuning. MLSys 2020 - [c47]Celestine Mendler-Dünner, Juan C. Perdomo, Tijana Zrnic, Moritz Hardt:
Stochastic Optimization for Performative Prediction. NeurIPS 2020 - [p1]Moritz Hardt:
Generalization in Overparameterized Models. Beyond the Worst-Case Analysis of Algorithms 2020: 486-505 - [i48]Juan C. Perdomo, Tijana Zrnic, Celestine Mendler-Dünner, Moritz Hardt:
Performative Prediction. CoRR abs/2002.06673 (2020) - [i47]Esther Rolf, Max Simchowitz, Sarah Dean, Lydia T. Liu, Daniel Björkegren, Moritz Hardt, Joshua Blumenstock:
Balancing Competing Objectives with Noisy Data: Score-Based Classifiers for Welfare-Aware Machine Learning. CoRR abs/2003.06740 (2020) - [i46]Celestine Mendler-Dünner, Juan C. Perdomo, Tijana Zrnic, Moritz Hardt:
Stochastic Optimization for Performative Prediction. CoRR abs/2006.06887 (2020) - [i45]Smitha Milli, Luca Belli, Moritz Hardt:
From Optimizing Engagement to Measuring Value. CoRR abs/2008.12623 (2020) - [i44]Chloe Ching-Yun Hsu, Celestine Mendler-Dünner, Moritz Hardt:
Revisiting Design Choices in Proximal Policy Optimization. CoRR abs/2009.10897 (2020)
2010 – 2019
- 2019
- [c46]Vitaly Feldman, Roy Frostig, Moritz Hardt:
Open Problem: How fast can a multiclass test set be overfit? COLT 2019: 3185-3189 - [c45]Smitha Milli, Ludwig Schmidt, Anca D. Dragan, Moritz Hardt:
Model Reconstruction from Model Explanations. FAT 2019: 1-9 - [c44]Smitha Milli, John Miller, Anca D. Dragan, Moritz Hardt:
The Social Cost of Strategic Classification. FAT 2019: 230-239 - [c43]John Miller, Moritz Hardt:
Stable Recurrent Models. ICLR (Poster) 2019 - [c42]Vitaly Feldman, Roy Frostig, Moritz Hardt:
The advantages of multiple classes for reducing overfitting from test set reuse. ICML 2019: 1892-1900 - [c41]Lydia T. Liu, Max Simchowitz, Moritz Hardt:
The Implicit Fairness Criterion of Unconstrained Learning. ICML 2019: 4051-4060 - [c40]Tijana Zrnic, Moritz Hardt:
Natural Analysts in Adaptive Data Analysis. ICML 2019: 7703-7711 - [c39]Lydia T. Liu, Sarah Dean, Esther Rolf, Max Simchowitz, Moritz Hardt:
Delayed Impact of Fair Machine Learning. IJCAI 2019: 6196-6200 - [c38]Rebecca Roelofs, Vaishaal Shankar, Benjamin Recht, Sara Fridovich-Keil, Moritz Hardt, John Miller, Ludwig Schmidt:
A Meta-Analysis of Overfitting in Machine Learning. NeurIPS 2019: 9175-9185 - [c37]Horia Mania, John Miller, Ludwig Schmidt, Moritz Hardt, Benjamin Recht:
Model Similarity Mitigates Test Set Overuse. NeurIPS 2019: 9993-10002 - [i43]Tijana Zrnic, Moritz Hardt:
Natural Analysts in Adaptive Data Analysis. CoRR abs/1901.11143 (2019) - [i42]Chiyuan Zhang, Samy Bengio, Moritz Hardt, Yoram Singer:
Identity Crisis: Memorization and Generalization under Extreme Overparameterization. CoRR abs/1902.04698 (2019) - [i41]Vitaly Feldman, Roy Frostig, Moritz Hardt:
The advantages of multiple classes for reducing overfitting from test set reuse. CoRR abs/1905.10360 (2019) - [i40]Horia Mania, John Miller, Ludwig Schmidt, Moritz Hardt, Benjamin Recht:
Model Similarity Mitigates Test Set Overuse. CoRR abs/1905.12580 (2019) - [i39]Michaela Hardt, Alvin Rajkomar, Gerardo Flores, Andrew M. Dai, Michael D. Howell, Greg Corrado, Claire Cui, Moritz Hardt:
Explaining an increase in predicted risk for clinical alerts. CoRR abs/1907.04911 (2019) - [i38]Chloe Ching-Yun Hsu, Michaela Hardt, Moritz Hardt:
Linear Dynamics: Clustering without identification. CoRR abs/1908.01039 (2019) - [i37]Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei A. Efros, Moritz Hardt:
Test-Time Training for Out-of-Distribution Generalization. CoRR abs/1909.13231 (2019) - [i36]John Miller, Smitha Milli, Moritz Hardt:
Strategic Adaptation to Classifiers: A Causal Perspective. CoRR abs/1910.10362 (2019) - 2018
- [j5]Moritz Hardt, Tengyu Ma, Benjamin Recht:
Gradient Descent Learns Linear Dynamical Systems. J. Mach. Learn. Res. 19: 29:1-29:44 (2018) - [c36]Lydia T. Liu, Sarah Dean, Esther Rolf, Max Simchowitz, Moritz Hardt:
Delayed Impact of Fair Machine Learning. ICML 2018: 3156-3164 - [c35]Julius Adebayo, Justin Gilmer, Michael Muelly, Ian J. Goodfellow, Moritz Hardt, Been Kim:
Sanity Checks for Saliency Maps. NeurIPS 2018: 9525-9536 - [i35]Lydia T. Liu, Sarah Dean, Esther Rolf, Max Simchowitz, Moritz Hardt:
Delayed Impact of Fair Machine Learning. CoRR abs/1803.04383 (2018) - [i34]John Miller, Moritz Hardt:
When Recurrent Models Don't Need To Be Recurrent. CoRR abs/1805.10369 (2018) - [i33]Smitha Milli, Ludwig Schmidt, Anca D. Dragan, Moritz Hardt:
Model Reconstruction from Model Explanations. CoRR abs/1807.05185 (2018) - [i32]Smitha Milli, John Miller, Anca D. Dragan, Moritz Hardt:
The Social Cost of Strategic Classification. CoRR abs/1808.08460 (2018) - [i31]Lydia T. Liu, Max Simchowitz, Moritz Hardt:
Group calibration is a byproduct of unconstrained learning. CoRR abs/1808.10013 (2018) - [i30]Julius Adebayo, Justin Gilmer, Michael Muelly, Ian J. Goodfellow, Moritz Hardt, Been Kim:
Sanity Checks for Saliency Maps. CoRR abs/1810.03292 (2018) - [i29]Liam Li, Kevin G. Jamieson, Afshin Rostamizadeh, Ekaterina Gonina, Moritz Hardt, Benjamin Recht, Ameet Talwalkar:
Massively Parallel Hyperparameter Tuning. CoRR abs/1810.05934 (2018) - 2017
- [j4]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (2017) - [c34]Moritz Hardt, Tengyu Ma:
Identity Matters in Deep Learning. ICLR (Poster) 2017 - [c33]Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals:
Understanding deep learning requires rethinking generalization. ICLR 2017 - [c32]Niki Kilbertus, Mateo Rojas-Carulla, Giambattista Parascandolo, Moritz Hardt, Dominik Janzing, Bernhard Schölkopf:
Avoiding Discrimination through Causal Reasoning. NIPS 2017: 656-666 - [i28]Moritz Hardt:
Climbing a shaky ladder: Better adaptive risk estimation. CoRR abs/1706.02733 (2017) - [i27]Niki Kilbertus, Mateo Rojas-Carulla, Giambattista Parascandolo, Moritz Hardt, Dominik Janzing, Bernhard Schölkopf:
Avoiding Discrimination through Causal Reasoning. CoRR abs/1706.02744 (2017) - 2016
- [j3]Moritz Hardt, Yuval Ishai, Raghu Meka, Virginia Vassilevska Williams:
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). SIAM J. Comput. 45(3): 881 (2016) - [c31]Moritz Hardt, Ben Recht, Yoram Singer:
Train faster, generalize better: Stability of stochastic gradient descent. ICML 2016: 1225-1234 - [c30]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. ITCS 2016: 111-122 - [c29]Moritz Hardt, Eric Price, Nati Srebro:
Equality of Opportunity in Supervised Learning. NIPS 2016: 3315-3323 - [r1]Moritz Hardt:
Private Spectral Analysis. Encyclopedia of Algorithms 2016: 1622-1626 - [i26]Moritz Hardt, Tengyu Ma, Benjamin Recht:
Gradient Descent Learns Linear Dynamical Systems. CoRR abs/1609.05191 (2016) - [i25]Moritz Hardt, Eric Price, Nathan Srebro:
Equality of Opportunity in Supervised Learning. CoRR abs/1610.02413 (2016) - [i24]Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals:
Understanding deep learning requires rethinking generalization. CoRR abs/1611.03530 (2016) - [i23]Moritz Hardt, Tengyu Ma:
Identity Matters in Deep Learning. CoRR abs/1611.04231 (2016) - 2015
- [c28]Avrim Blum, Moritz Hardt:
The Ladder: A Reliable Leaderboard for Machine Learning Competitions. ICML 2015: 1006-1014 - [c27]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS 2015: 2350-2358 - [c26]Ilias Diakonikolas, Moritz Hardt, Ludwig Schmidt:
Differentially Private Learning of Structured Discrete Distributions. NIPS 2015: 2566-2574 - [c25]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth:
Preserving Statistical Validity in Adaptive Data Analysis. STOC 2015: 117-126 - [c24]Moritz Hardt, Eric Price:
Tight Bounds for Learning a Mixture of Two Gaussians. STOC 2015: 753-760 - [i22]Avrim Blum, Moritz Hardt:
The Ladder: A Reliable Leaderboard for Machine Learning Competitions. CoRR abs/1502.04585 (2015) - [i21]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR abs/1506.02629 (2015) - [i20]Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. CoRR abs/1506.06980 (2015) - [i19]Moritz Hardt, Benjamin Recht, Yoram Singer:
Train faster, generalize better: Stability of stochastic gradient descent. CoRR abs/1509.01240 (2015) - 2014
- [c23]Moritz Hardt, Mary Wootters:
Fast matrix completion without the condition number. COLT 2014: 638-678 - [c22]Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz:
Computational Limits for Matrix Completion. COLT 2014: 703-725 - [c21]Moritz Hardt, Jonathan R. Ullman:
Preventing False Discovery in Interactive Data Analysis Is Hard. FOCS 2014: 454-463 - [c20]Moritz Hardt:
Understanding Alternating Minimization for Matrix Completion. FOCS 2014: 651-660 - [c19]Moritz Hardt, Eric Price:
The Noisy Power Method: A Meta Algorithm with Applications. NIPS 2014: 2861-2869 - [i18]Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz:
Computational Limits for Matrix Completion. CoRR abs/1402.2331 (2014) - [i17]Moritz Hardt, Eric Price:
Sharp bounds for learning a mixture of two gaussians. CoRR abs/1404.4997 (2014) - [i16]Moritz Hardt, Mary Wootters:
Fast matrix completion without the condition number. CoRR abs/1407.4070 (2014) - [i15]Moritz Hardt, Jonathan R. Ullman:
Preventing False Discovery in Interactive Data Analysis is Hard. CoRR abs/1408.1655 (2014) - [i14]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Preserving Statistical Validity in Adaptive Data Analysis. CoRR abs/1411.2664 (2014) - 2013
- [j2]Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman:
Privately Releasing Conjunctions and the Statistical Query Barrier. SIAM J. Comput. 42(4): 1494-1520 (2013) - [c18]Moritz Hardt:
Robust subspace iteration and privacy-preserving spectral analysis. Allerton 2013: 1624-1626 - [c17]Moritz Hardt, Ankur Moitra:
Algorithms and Hardness for Robust Subspace Recovery. COLT 2013: 354-375 - [c16]Ritwik Kumar, Ting Chen, Moritz Hardt, David Beymer, Karen Brannon, Tanveer Fathima Syeda-Mahmood:
Multiple Kernel Completion and its application to cardiac disease discrimination. ISBI 2013: 764-767 - [c15]Moritz Hardt, David P. Woodruff:
How robust are linear sketches to adaptive inputs? STOC 2013: 121-130 - [c14]Moritz Hardt, Aaron Roth:
Beyond worst-case analysis in private singular vector computation. STOC 2013: 331-340 - [i13]Moritz Hardt:
Robust Subspace Iteration and Privacy-Preserving Spectral Analysis. CoRR abs/1311.2495 (2013) - [i12]Moritz Hardt:
On the Provable Convergence of Alternating Minimization for Matrix Completion. CoRR abs/1312.0925 (2013) - 2012
- [c13]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness through awareness. ITCS 2012: 214-226 - [c12]Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani:
Graph densification. ITCS 2012: 380-392 - [c11]Moritz Hardt, Katrina Ligett, Frank McSherry:
A Simple and Practical Algorithm for Differentially Private Data Release. NIPS 2012: 2348-2356 - [c10]Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio:
Private data release via learning thresholds. SODA 2012: 168-187 - [c9]Moritz Hardt, Aaron Roth:
Beating randomized response on incoherent matrices. STOC 2012: 1255-1268 - [i11]Moritz Hardt, Aaron Roth:
Beyond Worst-Case Analysis in Private Singular Vector Computation. CoRR abs/1211.0975 (2012) - [i10]Moritz Hardt, Ankur Moitra:
Can We Reconcile Robustness and Efficiency in Unsupervised Learning? CoRR abs/1211.1041 (2012) - [i9]Moritz Hardt, David P. Woodruff:
How Robust are Linear Sketches to Adaptive Inputs? CoRR abs/1211.1056 (2012) - 2011
- [b1]Moritz Hardt:
A Study of Privacy and Fairness in Sensitive Data Analysis. Princeton University, USA, 2011 - [c8]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531 - [c7]Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman:
Privately releasing conjunctions and the statistical query barrier. STOC 2011: 803-812 - [i8]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness Through Awareness. CoRR abs/1104.3913 (2011) - [i7]Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio:
Private Data Release via Learning Thresholds. CoRR abs/1107.2444 (2011) - [i6]Moritz Hardt, Aaron Roth:
Beating Randomized Response on Incoherent Matrices. CoRR abs/1111.0623 (2011) - 2010
- [c6]Moritz Hardt, Guy N. Rothblum:
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. FOCS 2010: 61-70 - [c5]Moritz Hardt, Kunal Talwar:
On the geometry of differential privacy. STOC 2010: 705-714 - [i5]Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman:
Privately Releasing Conjunctions and the Statistical Query Barrier. CoRR abs/1011.1296 (2010) - [i4]Moritz Hardt, Katrina Ligett, Frank McSherry:
A simple and practical algorithm for differentially private data release. CoRR abs/1012.4763 (2010)
2000 – 2009
- 2009
- [j1]Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi:
Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. 109(3): 187-192 (2009) - [c4]Boaz Barak, Moritz Hardt, Satyen Kale:
The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200 - [i3]Moritz Hardt, Kunal Talwar:
On the Geometry of Differential Privacy. CoRR abs/0907.3754 (2009) - [i2]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009) - [i1]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c3]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer:
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - [c2]Markus Bläser, Moritz Hardt, David Steurer:
Asymptotically Optimal Hitting Sets Against Polynomials. ICALP (1) 2008: 345-356 - 2006
- [c1]Moritz Hardt, Gert Smolka:
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic. HyLo@FLoC 2006: 15-27
Coauthor Index
Celestine Dünner
aka: Celestine Mendler-Dünner
aka: Celestine Mendler-Dünner
Benjamin Recht
aka: Ben Recht
aka: Ben Recht
Aaron Roth 0001
aka: Aaron Leon Roth
aka: Aaron Leon Roth
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
