Papers › Private Synthetic Data for Multitask Learning and Marginal Queries

Private Synthetic Data for Multitask Learning and Marginal Queries

15 Sep 2022arXiv:2209.07400archive 2025-07-28

Giuseppe Vietri, Cedric Archambeau, Sergul Aydore, William Brown, Michael Kearns, Aaron Roth, Ankit Siva, Shuai Tang, Zhiwei Steven Wu

We provide a differentially private algorithm for producing synthetic data simultaneously useful for multiple tasks: marginal queries and multitask machine learning (ML). A key innovation in our algorithm is the ability to directly handle numerical features, in contrast to a number of related prior approaches which require numerical features to be first converted into {high cardinality} categorical features via {a binning strategy}. Higher binning granularity is required for better accuracy, but this negatively impacts scalability. Eliminating the need for binning allows us to produce synthetic data preserving large numbers of statistical queries such as marginals on numerical features, and class conditional linear threshold queries. Preserving the latter means that the fraction of points of each class label above a particular half-space is roughly the same in both the real and synthetic data. This is the property that is needed to train a linear classifier in a multitask setting. Our algorithm also allows us to produce high quality synthetic data for mixed marginal queries, that combine both categorical and numerical features. Our method consistently runs 2-5x faster than the best comparable techniques, and provides significant accuracy improvements in both marginal queries and linear prediction tasks for mixed-type datasets.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2209.07400")

Code

Syntology Ran 5 of 12 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong; 3 ran with no contract checked.

By repository: community (archive-listed): 12 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

amazon-science/relaxed-adaptive-projection mentioned on GitHubjaxNOASSERTION report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 5 ran; 1 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong
3ran
7unverified

Licence: 12 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from amazon-research/relaxed-adaptive-projection. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Domain amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) ran · metamorphic tier: deterministic licence not identified · pointer only · 9aa567d59f83e9d4 · report
LogTime amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) ran licence not identified · pointer only · d27393ae9f746993 · report
ManageStats amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) ran fingerprinted licence not identified · pointer only · 9cc1317ab7844603 · report
initialize_synthetic_dataset amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) ran · our draft was wrong licence not identified · pointer only · be738d3900d465be · report
sparsemax amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) ran · honoured contract fingerprinted licence not identified · pointer only · bc4cc560bd7663fc · report
BaseConfiguration amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 5c3d3e6d9ce4bdb4 · report
BaseMechanism amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · ba39aaf5a41b65f3 · report
Dataset amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 4cfb7c38939bbc13 · report
RAPpp amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 762f5f3073e36182 · report
RAPppConfiguration amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 7a14b6f7000d4f34 · report
print_bold amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 677aecd970514308 · report
sparsemax_project amazon-research/relaxed-adaptive-projection/mechanisms/rap_pp.py community (archive-listed) unverified licence not identified · pointer only · 461f51a17a3ac7d3 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections