Searching for "Hardness of Proper Learning." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries
by Vitaly Feldman — 2006 — in Proceedings of the 38th Annual ACM Symposium on the Theory of Computing
… learning). We prove that DNF expressions are NP-hard to PAC learn properly even when the learner has access…
Cited by 4 (0 self) – Add To MetaCart

Hardness of reconstructing multivariate polynomials over finite fields
by Parikshit Gopalan — 2007 — In Proc. 48 th IEEE Symp. on Foundations of Computer Science (FOCS’07
…˚astad [16]. In the setting of Computational Learning, our result shows the hardness of (non-proper…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB