Jayadev Acharya
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Robust Parameter Estimation For Random Graphs | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
Establishes nearly tight upper and lower bounds for estimating p in G(n,p) with an adversary corrupting a γ fraction of nodes: a two-step algorithm uses a… | ||
| Locally Private Statistical Inference: Communication, Samples, and Shared Randomness | Privacy and the Science of Data Analysis 2019 | 2019-04-08 |
Claims tight sample bounds for locally private inference: distribution learning needs about K^2/(ε^2 α^2) samples under LDP private‑coin (centralized is… | ||
| Testing Distribution Families | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Proposes a two-step method: use a proper learning routine (LP-based for discrete log-concave and specific estimators for Poisson binomial) to get an… | ||
| nothing matches | ||