no code implementations • 28 Mar 2018 • Hasan Abasi, Nader H. Bshouty
We then give two two-round Monte Carlo algorithms, the first asks $O(m^{4/3}\log n)$ queries for any $n$ and $m$, and the second asks $O(m\log n)$ queries when $n>2^m$.
no code implementations • 13 Feb 2015 • Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries.
no code implementations • 7 May 2014 • Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
We also give a non-adaptive proper learning algorithm that asks $n^{O(t^3)}$ membership queries.
no code implementations • 5 May 2014 • Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
In this paper, we study the problem of learning a monotone DNF with at most $s$ terms of size (number of variables in each term) at most $r$ ($s$ term $r$-MDNF) from membership queries.
