Michael Kearns

Available identifiers

zbMath Open kearns.michael-jWikidataQ18749034 ScholiaQ18749034MaRDI QIDQ171920

List of research outcomes

Publication	Date of Publication	Type
Competitive contagion in networks	2019-03-29	Paper
Mechanism design in large games	2017-05-19	Paper
Strategic Network Formation with Attack and Immunization	2017-02-10	Paper
Weakly learning DNF and characterizing statistical query learning using Fourier analysis	2016-09-01	Paper
On the learnability of discrete distributions	2016-09-01	Paper
Privacy and Truthful Equilibrium Selection for Aggregative Games	2016-01-08	Paper
Efficient learning of typical finite automata from random walks	2015-05-07	Paper
Efficient noise-tolerant learning from statistical queries	2015-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q2934656	2014-12-18	Paper
Competitive contagion in networks	2014-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q3096169	2011-11-08	Paper
A Clustering Coefficient Network Formation Game	2011-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q2996254	2011-05-06	Paper
Regret to the best vs. regret to the average	2009-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q3524716	2008-09-12	Paper
Risk-Sensitive Online Learning	2008-09-04	Paper
Regret to the Best vs. Regret to the Average	2008-01-03	Paper
Learning Theory	2006-06-22	Paper
Learning Theory	2005-06-13	Paper
Efficient noise-tolerant learning from statistical queries	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4797450	2003-03-13	Paper
Horn approximations of empirical data	2003-02-04	Paper
A sparse sampling algorithm for near-optimal planning in large Markov decision processes	2002-07-08	Paper
Near-optimal reinforcement learning in polynomial time	2002-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4533345	2002-06-10	Paper
Testing problems with sublearning sample complexity	2001-04-17	Paper
Toward efficient agnostic learning	2000-06-21	Paper
On the boosting ability of top-down decision tree learning algorithms	2000-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4252718	2000-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q4217805	1999-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q4228501	1999-03-01	Paper
Efficient learning of typical finite automata from random walks	1998-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q4341754	1997-09-17	Paper
Rigorous learning curve bounds from statistical mechanics	1997-05-06	Paper
Learning from a population of hypotheses	1995-10-29	Paper
Efficient distribution-free learning of probabilistic concepts	1995-10-09	Paper
On the sample complexity of weak learning	1995-07-10	Paper
On the complexity of teaching	1995-07-05	Paper
Learning Boolean formulas	1995-04-10	Paper
Cryptographic limitations on learning Boolean formulae and finite automata	1995-03-01	Paper
Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension	1994-03-03	Paper
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions	1993-10-10	Paper
Learning in the Presence of Malicious Errors	1993-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4013526	1992-09-27	Paper
Equivalence of models for polynomial learnability	1992-06-28	Paper
A general lower bound on the number of examples needed for learning	1989-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael Kearns