Rocco A. Servedio
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
all 4 in the filters
on a stage with
all 5 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Convex Influences | ITCS 2022 | 2022-01-31 |
Defines convex influence along a direction as the negated degree-two Hermite coefficient and shows it equals the infinitesimal rate at which Gaussian volume… | ||
| Polynomial-time trace reconstruction in the low deletion rate regime | ITCS 2021 | 2021-01-06 |
Claim: a polynomial-time algorithm reconstructs any n-bit string with high probability using polynomially many traces when the deletion rate δ < n^{-1/3+ε}… | ||
| Quantitative Correlation Inequalities via Semigroup Interpolation | ITCS 2021 | 2021-01-06 |
Proves a quantitative Gaussian correlation bound: for symmetric convex sets K,L the correlation ≥ φ(Σ_i Inf_i(K)·Inf_i(L)) with Inf_i defined as the negated… | ||
| Distribution-Free Junta Testing | Boolean Devices 2018 | 2018-09-10 |
Shows nonadaptive distribution-free junta testing needs exponential queries and gives an efficient adaptive alternative: a 2^{Ω(k)} lower bound comes from a… | ||
| Predicting from Noisy and Incomplete Data: Some Perspectives from Computational Learning Theory | Real-Time Decision Making | 2016-07-01 |
Survey claims: PAC learning is often computationally hard, so the field studies agnostic and restricted-distribution settings and gets concrete algorithms and… | ||
| Testing Probability Distributions using Conditional Samples | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Introduces a conditional-sampling model where an algorithm queries a subset and receives a sample conditioned on that subset, and shows concrete gains… | ||
| nothing matches | ||