1 citations · 1 across the 12 of their papers we have counts for
6 papers · 1 filter
On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
Maxwell Lovig, Ilias Zadik
The group testing problem is a canonical inference task where one seeks to identify infected individuals out of a population of people, based on the outcomes of group t…
On the Hardness of Learning One Hidden Layer Neural Networks
Shuchen Li, Ilias Zadik, Manolis Zampetakis
In this work, we consider the problem of learning one hidden layer ReLU neural networks with inputs from . We show that this learning problem is hard under standard c…
Low-degree Security of the Planted Random Subgraph Problem
Andrej Bogdanov, Chris Jones, Alon Rosen +1
The planted random subgraph detection conjecture of Abram et al. (TCC 2023) asserts the pseudorandomness of a pair of graphs , where is an Erdos-Renyi random graph on $…
On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
Zongchen Chen, Conor Sheehan, Ilias Zadik
Over the last years, there has been a significant amount of work studying the power of specific classes of computationally efficient estimators for multiple statistical parametric…
Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
Xifan Yu, Ilias Zadik, Peiyuan Zhang
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task…
Transfer Learning Beyond Bounded Density Ratios
Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis
We study the fundamental problem of transfer learning where a learning algorithm collects data from some source distribution but needs to perform well with respect to a differe…