Demo Data from EDBT 2026 / reviewers in the wild / expert
Lucas Massot
dblp:427/1245
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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 · 50% Mathematical optimization · 50% |
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
local differential privacy |
1.0 | 1 | 2026 | Estimating the True Distribution of Data Collected with Randomized Response · AAAI 2026 |
Privacy and data protection › differential privacy › local differential privacy
randomized response |
1.0 | 1 | 2026 | Estimating the True Distribution of Data Collected with Randomized Response · AAAI 2026 |
Information theory › statistical inference
distribution estimation |
1.0 | 1 | 2026 | Estimating the True Distribution of Data Collected with Randomized Response · AAAI 2026 |
Mathematical optimization › statistical estimation
maximum likelihood estimation |
1.0 | 1 | 2026 | Estimating the True Distribution of Data Collected with Randomized Response · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
iterative bayesian update · 2.0debiasing rule · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Estimating the True Distribution of Data Collected with Randomized ResponseabstractRandomized Response (RR) is a protocol designed to collect and analyze categorical data with local differential privacy guarantees. It has been used as a building block of mechanisms deployed by Big tech companies to collect app or web users' data. Each user reports an automatic random alteration of their true value to the analytics server, which then estimates the histogram of the true unseen values of all users using a debiasing rule to compensate for the added randomness. A known issue is that the standard debiasing rule can yield a vector with negative values (which can not be interpreted as a histogram), and there is no consensus on the best fix. An elegant but slow solution is the Iterative Bayesian Update algorithm (IBU), which converges to the Maximum Likelihood Estimate (MLE) as the number of iterations goes to infinity. This paper bypasses IBU by providing a simple formula for the exact MLE of RR and compares it with other estimation methods experimentally to help practitioners decide which one to use. Carlos Antonio Pinzón, Ehab ElSalamouny, Lucas Massot, Alexis Miller, Héber Hwang Arcolezi, Catuscia Palamidessi |
AAAI | 3 |