Learning boolean halfspaces with small weights from membership queries

摘要

We consider the problem of proper learning of a boolean halfspace with integer weights {0, 1,..., t}, from membership queries only. The best known algorithm for this problem is an adaptive algorithm that asks n(0(t5)) membership queries, while the best lower bound for the number of membership queries is n(Omega(t)) [1].