Demo Data from EDBT 2026 / reviewers in the wild / expert
Ian Waudby-Smith
dblp:280/1136
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Information theory · 67% Mathematical optimization · 33% | |
| Network and information security
1 paper |
Privacy and data protection · 100% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 50% Learning theory · 50% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › differential privacy
local differential privacy |
0.7 | 1 | 2023 | Nonparametric Extensions of Randomized Response for Private Confidence Sets · ICML 2023 |
Information theory › statistical inference
confidence sequences |
0.4 | 1 | 2020 | Confidence sequences for sampling without replacement · NeurIPS 2020 |
Mathematical optimization › stochastic optimization
sampling without replacement |
0.4 | 1 | 2020 | Confidence sequences for sampling without replacement · NeurIPS 2020 |
Information theory
statistical inference |
0.4 | 1 | 2020 | Confidence sequences for sampling without replacement · NeurIPS 2020 |
Privacy and data protection › differential privacy › local differential privacy
randomized response |
0.2 | 1 | 2023 | Nonparametric Extensions of Randomized Response for Private Confidence Sets · ICML 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.1 | 1 | 2020 | Confidence sequences for sampling without replacement · NeurIPS 2020 |
Machine learning › Learning theory
martingale analysis |
0.1 | 1 | 2020 | Confidence sequences for sampling without replacement · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
martingale · 0.9hypergeometric distribution · 0.9randomized response · 0.7hoeffding's inequality · 0.7confidence sequences · 0.7hoeffding bounds · 0.4hoeffding bound · 0.4empirical bernstein bounds · 0.4empirical bernstein bound · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Nonparametric Extensions of Randomized Response for Private Confidence SetsabstractThis work derives methods for performing nonparametric, nonasymptotic statistical inference for population means under the constraint of local differential privacy (LDP). Given bounded observations $(X_1, …, X_n)$ with mean $\mu^\star$ that are privatized into $(Z_1, …, Z_n)$, we present confidence intervals (CI) and time-uniform confidence sequences (CS) for $\mu^\star$ when only given access to the privatized data. To achieve this, we introduce a nonparametric and sequentially interactive generalization of Warner’s famous “randomized response” mechanism, satisfying LDP for arbitrary bounded random variables, and then provide CIs and CSs for their means given access to the resulting privatized observations. For example, our results yield private analogues of Hoeffding’s inequality in both fixed-time and time-uniform regimes. We extend these Hoeffding-type CSs to capture time-varying (non-stationary) means, and conclude by illustrating how these methods can be used to conduct private online A/B tests. Ian Waudby-Smith, Steven Z. Wu, Aaditya Ramdas |
ICML | 1 |
| 2020 | Confidence sequences for sampling without replacementabstractMany practical tasks involve sampling sequentially without replacement (WoR) from a finite population of size $N$, in an attempt to estimate some parameter $\theta^\star$. Accurately quantifying uncertainty throughout this process is a nontrivial task, but is necessary because it often determines when we stop collecting samples and confidently report a result. We present a suite of tools for designing \textit{confidence sequences} (CS) for $\theta^\star$. A CS is a sequence of confidence sets $(C_n)_{n=1}^N$, that shrink in size, and all contain $\theta^\star$ simultaneously with high probability. We first exploit a relationship between Bayesian posteriors and martingales to construct a (frequentist) CS for the parameters of a hypergeometric distribution. We then present Hoeffding- and empirical-Bernstein-type time-uniform CSs and fixed-time confidence intervals for sampling WoR which improve on previous bounds in the literature. Ian Waudby-Smith, Aaditya Ramdas |
NeurIPS | 1 |