Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brett Mullins

dblp:251/3111 · also Brett C. Mullins · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Privacy and data protection · 100%
Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 57% Data integration and cleaning · 43%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
1.322024
Efficient and Private Marginal Reconstruction with Local Non-Negativity · NeurIPS 2024
AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data · Proc. VLDB Endow. 2022
Privacy and data protection › differential privacy
synthetic data generation
1.322024
Efficient and Private Marginal Reconstruction with Local Non-Negativity · NeurIPS 2024
AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data · Proc. VLDB Endow. 2022
Privacy and data protection › differential privacy
differentially private query answering
0.812024
Efficient and Private Marginal Reconstruction with Local Non-Negativity · NeurIPS 2024
Data integration and cleaning › data generation
synthetic data generation
0.212022
AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data · Proc. VLDB Endow. 2022

Methods — techniques the papers use, named apart from their topics

residual query basis · 1.5pseudoinversion · 1.5non-negativity · 1.5gaussian noise · 1.5iterative query selection · 1.1confidence intervals · 0.6confidence interval · 0.6
YearPublicationVenuePosition
2024 Joint Selection: Adaptively Incorporating Public Information for Private Synthetic Data
abstract
Mechanisms for generating differentially private synthetic data based on marginals and graphical models have been successful in a wide range of settings. However, one limitation of these methods is their inability to incorporate public data. Initializing a data generating model by pre-training on public data has shown to improve the quality of synthetic data, but this technique is not applicable when model structure is not determined a priori. We develop the mechanism JAM-PGM, which expands the adaptive measurements framework to jointly select between measuring public data and private data. This technique allows for public data to be included in a graphical-model-based mechanism. We show that JAM-PGM is able to outperform both publicly assisted and non publicly assisted synthetic data generation mechanisms even when the public data distribution is biased.
Miguel Fuentes, Brett Mullins, Ryan McKenna, Gerome Miklau, Daniel Sheldon
AISTATS2
2024 Efficient and Private Marginal Reconstruction with Local Non-Negativity
abstract
Differential privacy is the dominant standard for formal and quantifiable privacy and has been used in major deployments that impact millions of people. Many differentially private algorithms for query release and synthetic data contain steps that reconstruct answers to queries from answers to other queries that have been measured privately. Reconstruction is an important subproblem for such mechanisms to economize the privacy budget, minimize error on reconstructed answers, and allow for scalability to high-dimensional datasets. In this paper, we introduce a principled and efficient postprocessing method ReM (Residuals-to-Marginals) for reconstructing answers to marginal queries. Our method builds on recent work on efficient mechanisms for marginal query release, based on making measurements using a residual query basis that admits efficient pseudoinversion, which is an important primitive used in reconstruction. An extension GReM-LNN (Gaussian Residuals-to-Marginals with Local Non-negativity) reconstructs marginals under Gaussian noise satisfying consistency and non-negativity, which often reduces error on reconstructed answers. We demonstrate the utility of ReM and GReM-LNN by applying them to improve existing private query answering mechanisms.
Brett Mullins, Miguel Fuentes, Yingtai Xiao, Daniel Kifer, Cameron Musco, Daniel Sheldon
NeurIPS1
2022 AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data
abstract
We propose AIM, a new algorithm for differentially private synthetic data generation. AIM is a workload-adaptive algorithm within the paradigm of algorithms that first selects a set of queries, then privately measures those queries, and finally generates synthetic data from the noisy measurements. It uses a set of innovative features to iteratively select the most useful measurements, reflecting both their relevance to the workload and their value in approximating the input data. We also provide analytic expressions to bound per-query error with high probability which can be used to construct confidence intervals and inform users about the accuracy of generated data. We show empirically that AIM consistently outperforms a wide variety of existing mechanisms across a variety of experimental settings.
Ryan McKenna, Brett Mullins, Daniel Sheldon, Gerome Miklau
Proc. VLDB Endow.2