Demo Data from VLDB 2026 / reviewers in the wild / expert
Kaiyan Shi
dblp:227/2165
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-0845-1506ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1
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.
| Network and information security
2 papers |
Privacy and data protection · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
1.0 | 2 | 2023 | The Test of Tests: A Framework for Differentially Private Hypothesis Testing · ICML 2023 Differentially Private Nonparametric Hypothesis Testing · CCS 2019 |
Privacy and data protection › differential privacy
private hypothesis testing |
1.0 | 2 | 2023 | The Test of Tests: A Framework for Differentially Private Hypothesis Testing · ICML 2023 Differentially Private Nonparametric Hypothesis Testing · CCS 2019 |
Privacy and data protection
hypothesis testing |
0.7 | 1 | 2023 | The Test of Tests: A Framework for Differentially Private Hypothesis Testing · ICML 2023 |
Privacy and data protection
privacy-preserving data analysis |
0.4 | 1 | 2019 | Differentially Private Nonparametric Hypothesis Testing · CCS 2019 |
Methods — techniques the papers use, named apart from their topics
differential privacy · 1.0nonparametric hypothesis testing · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | The Test of Tests: A Framework for Differentially Private Hypothesis TestingabstractWe present a generic framework for creating differentially private versions of any hypothesis test in a black-box way. We analyze the resulting tests analytically and experimentally. Most crucially, we show good practical performance for small data sets, showing that at ε = 1 we only need 5-6 times as much data as in the fully public setting. We compare our work to the one existing framework of this type, as well as to several individually-designed private hypothesis tests. Our framework is higher power than other generic solutions and at least competitive with (and often better than) individually-designed tests. Zeki Kazan, Kaiyan Shi, Adam Groce, Andrew Bray |
ICML | 2 |
| 2022 | Multiangle QAOA Does Not Always Need All Its AnglesabstractIntroducing additional tunable parameters to quantum circuits is a powerful way of improving per-formance without increasing hardware requirements. A recently introduced multiangle extension of the quantum approximate optimization algorithm (ma-QAOA) signifi-cantly improves the solution quality compared with QAOA by allowing the parameters for each term in the Hamilto-nian to vary independently. Prior results suggest, however, considerable redundancy in parameters, the removal of which would reduce the cost of parameter optimization. In this work we show numerically the connection between the problem symmetries and the parameter redundancy by demonstrating that symmetries can be used to reduce the number of parameters used by ma-QAOA without decreasing the solution quality. We study Max-Cut on all 7,565 connected, non-isomorphic 8-node graphs with a nontrivial symmetry group and show numerically that in 67.4% of these graphs, symmetry can be used to reduce the number of parameters with no decrease in the objective, with the average ratio of parameters reduced by 28.1%. Moreover, we show that in 35.9% of the graphs this reduction can be achieved by simply using the largest symmetry. For the graphs where reducing the number of parameters leads to a decrease in the objective, the largest symmetry can be used to reduce the parameter count by 37.1% at the cost of only a 6.1% decrease in the objective. We demonstrate the central role of symmetries by showing that a random parameter reduction strategy leads to much worse performance. Kaiyan Shi, Rebekah Herrman, Ruslan Shaydulin, Shouvanik Chakrabarti, Marco Pistoia, Jeffrey Larson 0001 |
SEC | 1 |
| 2019 | Differentially Private Nonparametric Hypothesis TestingabstractHypothesis tests are a crucial statistical tool for data mining and are the workhorse of scientific research in many fields. Here we study differentially private tests of independence between a categorical and a continuous variable. We take as our starting point traditional nonparametric tests, which require no distributional assumption (e.g., normality) about the data distribution. We present private analogues of the Kruskal-Wallis, Mann-Whitney, and Wilcoxon signed-rank tests, as well as the parametric one-sample t-test. These tests use novel test statistics developed specifically for the private setting. We compare our tests to prior work, both on parametric and nonparametric tests. We find that in all cases our new nonparametric tests achieve large improvements in statistical power, even when the assumptions of parametric tests are met. Simon Couch, Zeki Kazan, Kaiyan Shi, Andrew Bray, Adam Groce |
CCS | 3 |