160 citations · 224 across the 30 of their papers we have counts for
Showing 2019 · cs.CCShow all
3 papers · 2 filters
cs.CC2019
Testing noisy linear functions for sparsity
Xue Chen, Anindya De, Rocco A. Servedio
We consider the following basic inference problem: there is an unknown high-dimensional vector , and an algorithm is given access to labeled pairs where…
cs.CC2019★ 1 cited
Kruskal-Katona for convex sets, with applications
Anindya De, Rocco A. Servedio
The well-known Kruskal-Katona theorem in combinatorics says that (under mild conditions) every monotone Boolean function has a nontrivial "density increm…
cs.CC2019
Junta correlation is testable
Anindya De, Elchanan Mossel, Joe Neeman
The problem of tolerant junta testing is a natural and challenging problem which asks if the property of a function having some specified correlation with a -Junta is testable.…