Zobrazeno 1 - 10
of 2 667
pro vyhledávání: '"Nader H"'
Autor:
Bshouty, Nader H., Haddad, George
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 approximating the number of relevant variables in the parity function is as h
Externí odkaz:
http://arxiv.org/abs/2407.11832
Efficiently counting or detecting defective items is a crucial task in various fields ranging from biological testing to quality control to streaming algorithms. The \emph{group testing estimation problem} concerns estimating the number of defective
Externí odkaz:
http://arxiv.org/abs/2309.10286
Autor:
Bshouty, Nader H., Harcos, Gergely
Let $X$ be a set of items of size $n$ , which may contain some defective items denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The test outcome is $1$ (positive) if $Q$ contains at leas
Externí odkaz:
http://arxiv.org/abs/2309.09613
Autor:
Bshouty, Nader H.
Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least one defec
Externí odkaz:
http://arxiv.org/abs/2308.07721
Group testing is an approach aimed at identifying up to $d$ defective items among a total of $n$ elements. This is accomplished by examining subsets to determine if at least one defective item is present. In our study, we focus on the problem of iden
Externí odkaz:
http://arxiv.org/abs/2307.04822
Autor:
Bshouty, Nader H.
Koch, Strassle, and Tan [SODA 2023], show that, under the randomized exponential time hypothesis, there is no distribution-free PAC-learning algorithm that runs in time $n^{\tilde O(\log\log s)}$ for the classes of $n$-variable size-$s$ DNF, size-$s$
Externí odkaz:
http://arxiv.org/abs/2301.08486