Wu, Yi
Carnegie Mellon University
2 papers on CoChatORCID 0009-0006-3120-3769
Most cited papers
- Verified
Agnostic Learning of Monomials by Halfspaces Is Hard
Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2012) · SIAM Journal on Computing
Complexity and Algorithms in GraphsMachine Learning and Algorithms
Cited by 143
- Verified
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions
Diakonikolas, I., O'Donnell, R., Servedio, R. A., & Wu, Y. (2011) · Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
Machine Learning and AlgorithmsComplexity and Algorithms in Graphs
Cited by 6
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free