Demo Data from VLDB 2026 / reviewers in the wild / expert
Jongmin Mun
dblp:373/7113
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 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.
| Network and information security
1 paper |
Privacy and data protection · 100% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
0.9 | 1 | 2025 | Minimax Optimal Two-Sample Testing under Local Differential Privacy · J. Mach. Learn. Res. 2025 |
Privacy and data protection › differential privacy
local differential privacy |
0.9 | 1 | 2025 | Minimax Optimal Two-Sample Testing under Local Differential Privacy · J. Mach. Learn. Res. 2025 |
Information theory
hypothesis testing |
0.3 | 1 | 2025 | Minimax Optimal Two-Sample Testing under Local Differential Privacy · J. Mach. Learn. Res. 2025 |
Information theory
statistical inference |
0.3 | 1 | 2025 | Minimax Optimal Two-Sample Testing under Local Differential Privacy · J. Mach. Learn. Res. 2025 |
Information theory › hypothesis testing
two-sample testing |
0.3 | 1 | 2025 | Minimax Optimal Two-Sample Testing under Local Differential Privacy · J. Mach. Learn. Res. 2025 |
Methods — techniques the papers use, named apart from their topics
permutation test · 1.7laplace mechanism · 1.7bonferroni correction · 1.7binning · 1.7RAPPOR · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Minimax Optimal Two-Sample Testing under Local Differential PrivacyabstractWe explore the trade-off between privacy and statistical utility in private two-sample testing under local differential privacy (LDP) for both multinomial and continuous data. We begin with the multinomial case, where we introduce private permutation tests using practical privacy mechanisms such as Laplace, discrete Laplace, and Google's RAPPOR. We then extend this approach to continuous data via binning and study its uniform separation under LDP over Hölder and Besov smoothness classes. The proposed tests for both discrete and continuous cases rigorously control type I error for any finite sample size, strictly adhere to LDP constraints, and achieve minimax optimality under LDP. The attained minimax rates reveal inherent privacy-utility trade-offs that are unavoidable in private testing. To address scenarios with unknown smoothness parameters in density testing, we propose a Bonferroni-type adaptive test that ensures robust performance without prior knowledge of the smoothness parameters. We validate our theoretical findings with extensive numerical experiments and demonstrate the practical relevance and effectiveness of our proposed methods. Jongmin Mun, Seungwoo Kwak, Ilmun Kim |
J. Mach. Learn. Res. | 1 |