Moritz Hardt

15.7k total citations · 2 hit papers
56 papers, 4.8k citations indexed

About

Moritz Hardt is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Moritz Hardt has authored 56 papers receiving a total of 4.8k indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 11 papers in Computational Mechanics. Recurrent topics in Moritz Hardt's work include Privacy-Preserving Technologies in Data (14 papers), Complexity and Algorithms in Graphs (12 papers) and Stochastic Gradient Optimization Techniques (12 papers). Moritz Hardt is often cited by papers focused on Privacy-Preserving Technologies in Data (14 papers), Complexity and Algorithms in Graphs (12 papers) and Stochastic Gradient Optimization Techniques (12 papers). Moritz Hardt collaborates with scholars based in United States, Germany and Canada. Moritz Hardt's co-authors include Omer Reingold, Toniann Pitassi, Cynthia Dwork, Benjamin Recht, Richard S. Zemel, Samy Bengio, Chiyuan Zhang, Oriol Vinyals, Guy N. Rothblum and Aaron Roth and has published in prestigious journals such as Science, Communications of the ACM and SIAM Journal on Computing.

In The Last Decade

Moritz Hardt

50 papers receiving 4.6k citations

Hit Papers

Fairness through awareness 2012 2026 2016 2021 2012 2021 500 1000 1.5k

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Moritz Hardt 3.1k 1.0k 675 456 306 56 4.8k
Suresh Venkatasubramanian 3.8k 1.2× 1.2k 1.2× 595 0.9× 1.4k 3.0× 751 2.5× 114 6.0k
Dino Pedreschi 4.1k 1.3× 606 0.6× 799 1.2× 675 1.5× 1.1k 3.4× 204 9.1k
Natalia Díaz-Rodríguez 4.2k 1.3× 834 0.8× 782 1.2× 225 0.5× 467 1.5× 49 7.3k
Franco Turini 2.8k 0.9× 753 0.8× 274 0.4× 257 0.6× 417 1.4× 66 4.0k
Sergio Gil-López 3.3k 1.0× 635 0.6× 465 0.7× 137 0.3× 345 1.1× 52 6.6k
Richard Benjamins 3.1k 1.0× 658 0.7× 389 0.6× 143 0.3× 413 1.3× 28 5.3k
Adrien Bennetot 3.0k 1.0× 637 0.6× 387 0.6× 134 0.3× 322 1.1× 5 5.0k
Alberto Barbado 3.0k 0.9× 632 0.6× 377 0.6× 132 0.3× 317 1.0× 5 5.0k
Marco Túlio Ribeiro 6.4k 2.0× 597 0.6× 1.1k 1.6× 221 0.5× 804 2.6× 22 9.3k
Anna Monreale 2.6k 0.8× 349 0.3× 345 0.5× 253 0.6× 401 1.3× 82 4.3k

Countries citing papers authored by Moritz Hardt

Since Specialization
Citations

This map shows the geographic impact of Moritz Hardt's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Moritz Hardt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moritz Hardt more than expected).

Fields of papers citing papers by Moritz Hardt

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Moritz Hardt. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Moritz Hardt. The network helps show where Moritz Hardt may publish in the future.

Co-authorship network of co-authors of Moritz Hardt

This figure shows the co-authorship network connecting the top 25 collaborators of Moritz Hardt. A scholar is included among the top collaborators of Moritz Hardt based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Moritz Hardt. Moritz Hardt is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hardt, Moritz, et al.. (2024). Do causal predictors generalize better to new domains?. 31202–31315.
2.
Kim, M. & Moritz Hardt. (2023). Is Your Model Predicting the Past?. 1–8. 1 indexed citations
3.
Li, Liam, Kevin Jamieson, Afshin Rostamizadeh, et al.. (2020). A System for Massively Parallel Hyperparameter Tuning. 2. 230–246. 87 indexed citations
4.
Zhang, Chiyuan, Samy Bengio, Moritz Hardt, Michael C. Mozer, & Yoram Singer. (2020). Identity Crisis: Memorization and Generalization Under Extreme Overparameterization. arXiv (Cornell University). 6 indexed citations
5.
Hardt, Moritz, et al.. (2019). Natural Analysts in Adaptive Data Analysis.. International Conference on Machine Learning. 7703–7711. 1 indexed citations
6.
Roelofs, Rebecca, Vaishaal Shankar, Benjamin Recht, et al.. (2019). A Meta-Analysis of Overfitting in Machine Learning. Neural Information Processing Systems. 32. 9175–9185. 53 indexed citations
7.
Miller, J. J. & Moritz Hardt. (2018). When Recurrent Models Don't Need To Be Recurrent.. arXiv (Cornell University). 6 indexed citations
8.
Miller, J. J. & Moritz Hardt. (2018). Stable Recurrent Models.. International Conference on Learning Representations. 9 indexed citations
9.
Hardt, Moritz, Tengyu Ma, & Benjamin Recht. (2018). Gradient Descent Learns Linear Dynamical Systems. arXiv (Cornell University). 19(29). 1–44. 42 indexed citations
10.
Dwork, Cynthia, Vitaly Feldman, Moritz Hardt, et al.. (2017). Guilt-free data reuse. Communications of the ACM. 60(4). 86–93. 10 indexed citations
11.
Hardt, Moritz, Benjamin Recht, & Yoram Singer. (2016). Train faster, generalize better: stability of stochastic gradient descent. International Conference on Machine Learning. 1225–1234. 125 indexed citations
12.
Hardt, Moritz, Nimrod Megiddo, Christos H. Papadimitriou, & Mary Wootters. (2016). Strategic Classification. 111–122. 99 indexed citations
13.
Hardt, Moritz, et al.. (2014). Computational Limits for Matrix Completion. Conference on Learning Theory. 703–725. 3 indexed citations
14.
Hardt, Moritz. (2013). Robust Subspace Iteration and Privacy-Preserving Spectral Analysis. arXiv (Cornell University). 3 indexed citations
15.
Hardt, Moritz. (2013). On the Provable Convergence of Alternating Minimization for Matrix Completion.. arXiv (Cornell University). 8 indexed citations
16.
Hardt, Moritz, Guy N. Rothblum, & Rocco A. Servedio. (2012). Private data release via learning thresholds. Symposium on Discrete Algorithms. 168–187. 15 indexed citations
17.
Hardt, Moritz, Katrina Ligett, & Frank McSherry. (2010). A simple and practical algorithm for differentially private data release. arXiv (Cornell University). 25. 2339–2347. 168 indexed citations
18.
Barak, Boaz, Moritz Hardt, & Satyen Kale. (2009). The uniform hardcore lemma via approximate Bregman projections. Symposium on Discrete Algorithms. 1193–1200. 9 indexed citations
19.
Barak, Boaz, Moritz Hardt, Thomas Holenstein, & David Steurer. (2009). Subsampling Semidefinite Programs and Max-Cut on the Sphere. 1 indexed citations
20.
Barak, Boaz, Moritz Hardt, Ishay Haviv, et al.. (2008). Rounding Parallel Repetitions of Unique Games. 1. 374–383. 28 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026