Learning Boolean Halfspaces with Small Weights from Membership Queries.

Hasan Abasi,Ali Z. Abdi,Nader H. Bshouty

Theoretical Computer Science（2016）

引用 1|浏览336

暂无评分

摘要

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 nO(t5) membership queries, while the best lower bound for the number of membership queries is nΩ(t) [1].

查看译文

关键词

Membership query,Proper learning,Boolean halfspaces,Automata,Adaptive algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要