Nader H. Bshouty

activity

20182026

most citedElementary Proofs of Some Stirling Bounds

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing cs.LGShow all

2 papers · 1 filter

cs.LG2025

On Exact Learning of $d$ -Monotone Functions

Nader H. Bshouty

In this paper, we study the learnability of the Boolean class of $d$ -monotone functions $f : X \to {0, 1}$ from membership and equivalence queries, where $(X, \leq)$ is a…

cs.LG2024

Approximating the Number of Relevant Variables in a Parity Implies Proper Learning

Nader H. Bshouty, George Haddad

Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approxi…

On Exact Learning of d-Monotone Functions

Approximating the Number of Relevant Variables in a Parity Implies Proper Learning

On Exact Learning of $d$ -Monotone Functions