The following pages link to Michael Kearns (Q171920):
Displaying 46 items.
- Rigorous learning curve bounds from statistical mechanics (Q676243) (← links)
- Regret to the best vs. regret to the average (Q1009274) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- On the boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension (Q1314506) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes (Q1604816) (← links)
- Near-optimal reinforcement learning in polynomial time (Q1604817) (← links)
- Competitive contagion in networks (Q1735734) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- On the complexity of teaching (Q1892202) (← links)
- On the sample complexity of weak learning (Q1892883) (← links)
- Learning from a population of hypotheses (Q1900976) (← links)
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- (Q2934656) (← links)
- Strategic Network Formation with Attack and Immunization (Q2959849) (← links)
- Mechanism design in large games (Q2988894) (← links)
- (Q2996254) (← links)
- A Clustering Coefficient Network Formation Game (Q3095276) (← links)
- (Q3096169) (← links)
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions (Q3137706) (← links)
- Learning in the Presence of Malicious Errors (Q3137710) (← links)
- Efficient noise-tolerant learning from statistical queries (Q3158527) (← links)
- Privacy and Truthful Equilibrium Selection for Aggregative Games (Q3460796) (← links)
- Risk-Sensitive Online Learning (Q3522986) (← links)
- (Q3524716) (← links)
- (Q4013526) (← links)
- (Q4217805) (← links)
- (Q4228501) (← links)
- (Q4252718) (← links)
- Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296) (← links)
- Learning Boolean formulas (Q4327633) (← links)
- (Q4341754) (← links)
- (Q4533345) (← links)
- Learning Theory (Q4680883) (← links)
- (Q4797450) (← links)
- Efficient learning of typical finite automata from random walks (Q5248500) (← links)
- Efficient noise-tolerant learning from statistical queries (Q5248508) (← links)
- Competitive contagion in networks (Q5415514) (← links)
- Regret to the Best vs. Regret to the Average (Q5434053) (← links)
- Learning Theory (Q5473641) (← links)
- Testing problems with sublearning sample complexity (Q5929914) (← links)
