Michael Kearns

From MaRDI portal
Person:171920

Available identifiers

zbMath Open kearns.michael-jWikidataQ18749034 ScholiaQ18749034MaRDI QIDQ171920

List of research outcomes

PublicationDate of PublicationType
Competitive contagion in networks2019-03-29Paper
Mechanism design in large games2017-05-19Paper
Strategic Network Formation with Attack and Immunization2017-02-10Paper
Weakly learning DNF and characterizing statistical query learning using Fourier analysis2016-09-01Paper
On the learnability of discrete distributions2016-09-01Paper
Privacy and Truthful Equilibrium Selection for Aggregative Games2016-01-08Paper
Efficient learning of typical finite automata from random walks2015-05-07Paper
Efficient noise-tolerant learning from statistical queries2015-05-07Paper
https://portal.mardi4nfdi.de/entity/Q29346562014-12-18Paper
Competitive contagion in networks2014-05-13Paper
https://portal.mardi4nfdi.de/entity/Q30961692011-11-08Paper
A Clustering Coefficient Network Formation Game2011-10-28Paper
https://portal.mardi4nfdi.de/entity/Q29962542011-05-06Paper
Regret to the best vs. regret to the average2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q35247162008-09-12Paper
Risk-Sensitive Online Learning2008-09-04Paper
Regret to the Best vs. Regret to the Average2008-01-03Paper
Learning Theory2006-06-22Paper
Learning Theory2005-06-13Paper
Efficient noise-tolerant learning from statistical queries2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q47974502003-03-13Paper
Horn approximations of empirical data2003-02-04Paper
A sparse sampling algorithm for near-optimal planning in large Markov decision processes2002-07-08Paper
Near-optimal reinforcement learning in polynomial time2002-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45333452002-06-10Paper
Testing problems with sublearning sample complexity2001-04-17Paper
Toward efficient agnostic learning2000-06-21Paper
On the boosting ability of top-down decision tree learning algorithms2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q42527182000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42178051999-04-27Paper
https://portal.mardi4nfdi.de/entity/Q42285011999-03-01Paper
Efficient learning of typical finite automata from random walks1998-06-02Paper
https://portal.mardi4nfdi.de/entity/Q43417541997-09-17Paper
Rigorous learning curve bounds from statistical mechanics1997-05-06Paper
Learning from a population of hypotheses1995-10-29Paper
Efficient distribution-free learning of probabilistic concepts1995-10-09Paper
On the sample complexity of weak learning1995-07-10Paper
On the complexity of teaching1995-07-05Paper
Learning Boolean formulas1995-04-10Paper
Cryptographic limitations on learning Boolean formulae and finite automata1995-03-01Paper
Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension1994-03-03Paper
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions1993-10-10Paper
Learning in the Presence of Malicious Errors1993-10-10Paper
https://portal.mardi4nfdi.de/entity/Q40135261992-09-27Paper
Equivalence of models for polynomial learnability1992-06-28Paper
A general lower bound on the number of examples needed for learning1989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael Kearns