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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2016-10, Vol.650, p.45-56
Hauptverfasser:	Abasi, Hasan, Abdi, Ali Z., Bshouty, Nader H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithm Adaptive algorithms Algorithms Automata Boolean algebra Boolean halfspaces Integers Learning Lower bounds Membership query Proper learning Queries
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!