P

Initializing...

Theorem 5.1 — every $d$-dimensional geometric class is learnable with $O(d^2\log n+dk)$ queries by a deterministic learner that does not know $k$ · Prove2Me