 | Kearns, Michael (Michael Kearns and Satinder Singh) -- Near-optimal reinforcement learning in polynomial time - 1998 |
| Kearns, Michael (Yoav Freund, Michael Kearns, Yishay Mansour, Dana Ron and Ronitt Rubinfeld) -- Efficient algorithms for learning to play repeated games against computationally bounded adversaries - 1995 |
| Kearns, Michael (Michael Kearns and Leslie Valiant) -- Cryptographic limitations on learning Boolean formulae and finite automata - 1994 |
| Kearns, Michael (Michael Kearns and Dana Ron) -- Testing problems with sub-learning sample complexity - 1998 |
| Kearns, Michael (Michael Kearns and H. Sebastian Seung) -- Learning from a population of hypotheses - 1995 |
| Kearns, Michael (David Haussler, Michael Kearns and Robert E. Schapire) -- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension - 1994 |
| Kearns, Michael (Michael Kearns and Dana Ron) -- Algorithmic stability and sanity-check bounds for leave-one-out cross-validation - 1997 |
| Kearns, Michael (Tom Dietterich, Michael Kearns and Yishay Mansour) -- Applying the weak learning framework to understand and improve C4.5 - 1996 |
| Kearns, Michael (Michael Kearns, Yishay Mansour, Andrew Y. Ng and Dana Ron) -- An Experimental and Theoretical Comparison of Model Selection Methods - 1997 |
| Kearns, Michael (Michael Kearns, Ming Li and Leslie Valiant) -- Learning Boolean formulas - 1994 |
| Kearns, Michael (Kary Myers, Michael Kearns, Satinder Singh and Marilyn A. Walker) -- A Boosting Approach to Topic Spotting on Subdialogues - 2000 |
| Kearns, Michael (Michael Kearns and Satinder Singh) -- Near-Optimal Reinforcement Learning in Polynomial Time - 2002 |
| Kearns, Michael (Michael Kearns and Dana Ron) -- Testing Problems with Sublearning Sample Complexity - December 2000 |
| Kearns, Michael (Michael Kearns and Satinder Singh) -- Bias-Variance Error Bounds for Temporal Difference Updates - 2000 |
| Kearns, Michael (Michael Kearns and Yishay Mansour) -- A fast, bottom-up decision tree pruning algorithm with near-optimal generalization - 1998 |
| Kearns, Michael (Michael Kearns, Yishay Mansour and Andrew Y. Ng) -- A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes - 2002 |
