
Convex Influences
We introduce a new notion of influence for symmetric convex sets over Ga...
read it

Approximating Sumset Size
Given a subset A of the ndimensional Boolean hypercube 𝔽_2^n, the sumse...
read it

NearOptimal AverageCase Approximate Trace Reconstruction from Few Traces
In the standard trace reconstruction problem, the goal is to exactly rec...
read it

Fourier growth of structured 𝔽_2polynomials and applications
We analyze the Fourier growth, i.e. the L_1 Fourier weight at level k (d...
read it

Fooling Gaussian PTFs via Local Hyperconcentration
We give a pseudorandom generator that fools degreed polynomial threshol...
read it

On the Approximation Power of TwoLayer Networks of Random ReLUs
This paper considers the following question: how well can depthtwo ReLU...
read it

Quantitative Correlation Inequalities via Semigroup Interpolation
Most correlation inequalities for highdimensional functions in the lite...
read it

Polynomialtime trace reconstruction in the low deletion rate regime
In the trace reconstruction problem, an unknown source string x ∈{0,1}^n...
read it

Polynomialtime trace reconstruction in the smoothed complexity model
In the trace reconstruction problem, an unknown source string x ∈{0,1}^n...
read it

Reconstructing weighted voting schemes from partial information about their power indices
A number of recent works [Goldberg 2006; O'Donnell and Servedio 2011; De...
read it

Testing noisy linear functions for sparsity
We consider the following basic inference problem: there is an unknown h...
read it

KruskalKatona for convex sets, with applications
The wellknown KruskalKatona theorem in combinatorics says that (under ...
read it

A Lower Bound on CycleFinding in Sparse Digraphs
We consider the problem of finding a cycle in a sparse directed graph G ...
read it

Efficient averagecase population recovery in the presence of insertions and deletions
Several recent works have considered the trace reconstruction problem, i...
read it

Learning from satisfying assignments under continuous distributions
What kinds of functions are learnable from their satisfying assignments?...
read it

Beyond trace reconstruction: Population recovery from the deletion channel
Population recovery is the problem of learning an unknown distribution o...
read it

Density estimation for shiftinvariant multidimensional distributions
We study density estimation for classes of shiftinvariant distributions...
read it

Fooling Polytopes
We give a pseudorandom generator that fools mfacet polytopes over {0,1}...
read it

LubyVeličkovićWigderson revisited: Improved correlation bounds and pseudorandom generators for depthtwo circuits
We study correlation bounds and pseudorandom generators for depthtwo ci...
read it

Distributionfree Junta Testing
We study the problem of testing whether an unknown nvariable Boolean fu...
read it

Improved pseudorandom generators from pseudorandom multiswitching lemmas
We give the best known pseudorandom generators for two touchstone classe...
read it

Deterministic search for CNF satisfying assignments in almost polynomial time
We consider the fundamental derandomization problem of deterministically...
read it

Efficient Density Estimation via Piecewise Polynomial Approximation
We give a highly efficient "semiagnostic" algorithm for learning univar...
read it
Rocco A. Servedio
is this you? claim profile