Nadav

2000

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.

Whom Nadav trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. David Haussler
2. Robert E. Schapire

Who trusts Nadav overall

1. Adam N. Elmachtoub

Papers from Nadav's perspective

Ordered by how strongly the researchers Nadav trusts endorse each paper. Same corpus, a different order for every researcher.

1. Learning in the presence of malicious errors
2. The Strength of Weak Learnability
3. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications
4. Learnability and the Vapnik-Chervonenkis dimension
5. Original Contribution: Training a 3-node neural network is NP-complete
6. Some optimal inapproximability results
7. A theory of the learnable
8. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
9. On the learnability of Boolean formulae
10. Convergence of stochastic processes

Their papers

• On the Di cultyof Approximately Maximizing Agreements (2000)