Yi Wu
Artificial Intelligence · with Diakonikolas · 2009–2010
A researcher in the Science corpus: 2 papers; trusts 10 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 15 citations into it
- Computational Theory and Mathematics — 14 citations into it
- Statistical Learning Theory — 6 citations into it
Whom Yi Wu trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Yi Wu's perspective
Ordered by how strongly the researchers Yi Wu trusts endorse each paper. Same corpus, a different order for every researcher.
- Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
- Learning in the presence of malicious errors
- The Strength of Weak Learnability
- A theory of the learnable
- Toward efficient agnostic learning
- Efficient noise-tolerant learning from statistical queries
- The perceptron: a probabilistic model for information storage and organization in the brain.
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- Cryptographic Hardness for Learning Intersections of Halfspaces
- Occam's razor
Their papers
- Hardness results for agnostically learning low-degree polynomial threshold functions (2010) — 26 citations
- Agnostic Learning of Monomials by Halfspaces Is Hard (2009) — 165 citations