Michael J. Kearns
Active 1985–2023
- 163
- Papers
- 18,483
- Citations
- 63
- h-index
- 128
- i10-index
Citations
Citation sources
Countries
Institutions
Fields
- Computer Science67.1%
- Decision Sciences11.8%
- Social Sciences5.5%
- Engineering3.7%
- Physics and Astronomy3.2%
- Economics, Econometrics and Finance2.1%
- Other6.6%
Topics
- Machine Learning and Algorithms9.7%
- Reinforcement Learning in Robotics4.7%
- Algorithms and Data Compression3%
- Machine Learning and Data Classification3%
- Advanced Bandit Algorithms Research2.8%
- Game Theory and Applications2.8%
- Other74%
Coauthors
- Aaron Roth21
- Satinder Singh18
- Yishay Mansour18
- Robert E. Schapire14
- Zhiwei Steven Wu9
- Jamie Morgenstern8
- Jennifer Wortman8
- Dana Ron7
- Luis E. Ortiz7
- Seth Neel7
- Sham M. Kakade7
- Eyal Even-Dar6
- Hoda Heidari6
- J. Stephen Judd6
- Kareem Amin6
- Sally A. Goldman6
- Shahin Jabbari6
- David Haussler5
- Jinsong Tan5
- Lili Dworkin5
- Matthew Joseph5
- Andrew Y. Ng4
- Diane J. Litman4
- Leslie G. Valiant4
All papers
- A Convex Framework for Fair Regression
Authors: Richard Berk, Hoda Heidari, Shahin Jabbari, Matthew Joseph, Michael J. Kearns, Jamie Morgenstern, Seth Neel, Aaron Roth - arXiv (Cornell University), CoRR 2017 cited by 253
- An Introduction to Computational Learning Theory
Authors: Michael J. Kearns, Umesh V. Vazirani - The MIT Press eBooks 1994 cited by 1,733
- Efficient Noise-Tolerant Learning from Statistical Queries
Authors: Michael J. Kearns - Journal of the ACM, J. ACM 1993 cited by 712
- Cryptographic Primitives Based on Hard Learning Problems
Authors: Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton - Lecture notes in computer science, CRYPTO 1993 cited by 340
- Near-Optimal Reinforcement Learning in Polynomial Time
Authors: Michael J. Kearns, Satinder Singh - Machine Learning, Mach. Learn. 1998 cited by 858
- Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
Authors: Michael J. Kearns, Seth Neel, Aaron Roth, Zhiwei Steven Wu - International Conference on Machine Learning, ICML 2017 cited by 919
- STING agonism overcomes STAT3-mediated immunosuppression and adaptive resistance to PARP inhibition in ovarian cancer
Authors: Liya Ding, Qiwei Wang, Antons Martincuks, Michael J. Kearns, Tao Jiang, Ziying Lin, Xin Cheng, Changli Qian, Shaozhen Xie, Hye‐Jung Kim, Inga-Maria Launonen, Anniina Färkkilä, Thomas M. Roberts, Gordon J. Freeman, Joyce F. Liu, Panagiotis A. Konstantinopoulos, Ursula A. Matulonis, Hua Yu, Jean J Zhao - Journal for ImmunoTherapy of Cancer 2023 cited by 92
- Reinforcement learning for optimized trade execution
Authors: Yuriy Nevmyvaka, Yi Feng, Michael J. Kearns - conference on Machine learning - ICML '06 2006 cited by 262
- Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
Authors: Michael J. Kearns, Leslie G. Valiant - Journal of the ACM, J. ACM 1989 cited by 744
- Fairness in Learning: Classic and Contextual Bandits
Authors: Matthew Joseph, Michael J. Kearns, Jamie Morgenstern, Aaron Roth - Neural Information Processing Systems, NIPS 2016 cited by 515
- Toward Efficient Agnostic Learning
Authors: Michael J. Kearns, Robert E. Schapire, Linda Sellie - Machine Learning, COLT 1992 cited by 349
- A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
Authors: Michael J. Kearns, Yishay Mansour, Andrew Y. Ng - Machine Learning, IJCAI 1999 cited by 677
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Authors: Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich - twenty-sixth annual ACM symposium on Theory of computing - STOC '94 1994 cited by 264
- Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005
Authors: John Riedl, Michael J. Kearns, Michael K. Reiter - EC 2005 cited by 107
- On the Complexity of Teaching
Authors: Sally A. Goldman, Michael J. Kearns - Conference on Learning Theory, COLT 1991 cited by 277
- Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation
Authors: Michael J. Kearns, Dana Ron - Neural Computation, COLT 1997 cited by 418
- Efficient Distribution-Free Learning of Probabilistic Concepts
Authors: Michael J. Kearns, Robert E. Schapire - Elsevier eBooks, J. Comput. Syst. Sci. 1990 cited by 377
- On the learnability of discrete distributions
Authors: Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie - twenty-sixth annual ACM symposium on Theory of computing - STOC '94 1994 cited by 287
- An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering
Authors: Michael J. Kearns, Yishay Mansour, Andrew Y. Ng - Learning in Graphical Models 1997 cited by 176
- Fair Algorithms for Learning in Allocation Problems
Authors: Hadi Elzayn, Shahin Jabbari, Christopher Jung, Michael J. Kearns, Seth Neel, Aaron Roth, Zachary Schutzman - Conference on Fairness, FAT 2019 cited by 69
- Market making and mean reversion
Authors: Tanmoy Chakraborty, Michael J. Kearns - conference on Electronic commerce 2011 cited by 59
- An Empirical Study of Rich Subgroup Fairness for Machine Learning
Authors: Michael J. Kearns, Seth Neel, Aaron Roth, Zhiwei Steven Wu - Conference on Fairness, FAT 2019 cited by 33
- Graphical Models for Game Theory
Authors: Michael J. Kearns, Michael L. Littman, Satinder Singh - UAI 2001 cited by 574
- Eliciting and Enforcing Subjective Individual Fairness
Authors: Christopher Jung, Michael J. Kearns, Seth Neel, Aaron Roth, Logan Stapleton, Zhiwei Steven Wu - FORC 2021 cited by 53
