in the point location problem one is given a hyperplane arrangement and an unknown point. by making linear queries about that point one wants to determine which cell of the hyperplane arrangement it lies in. this problem has an unexpected connection to the problem in machine learning of actively learning a halfspace. we discuss these problems and their relationship and provide a new and nearly optimal algorithm for solving them.