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 ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 12 code samples harvested from 1 repository linked to this paper: 5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 12 samples from 1 repository, 5 ran (4 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

amazon-research/relaxed-adaptive-projection mentioned on GitHubjaxSyntology: 12 samples, 5 ran (1 instrument-failed) · 7 unverified report
amazon-science/relaxed-adaptive-projection mentioned on GitHubjaxNOASSERTIONSyntology: not harvested 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 (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

amazon-research/relaxed-adaptive-projection community (archive-listed) 12 samples, 5 ran (1 instrument-failed) · 7 unverified
Domain mechanisms/rap_pp.py ran · metamorphic tier: deterministic licence not identified · pointer only · 9aa567d59f83e9d4 · report fixture: signature attrs:list/1/str · returned Domain · level recorded 2026-09-22
LogTime mechanisms/rap_pp.py ran licence not identified · pointer only · d27393ae9f746993 · report fixture: returned NoneType · level recorded 2026-09-24
ManageStats mechanisms/rap_pp.py ran fingerprinted licence not identified · pointer only · 9cc1317ab7844603 · report fixture: signature D_temp:ArrayImpl/2/float · returned ArrayImpl · level recorded 2026-09-24
initialize_synthetic_dataset mechanisms/rap_pp.py ran · our draft was wrong licence not identified · pointer only · be738d3900d465be · report fixture: signature key:ArrayImpl/1/int, num_generated_points:int/0/int, data_dimension:int/0/int · returned ArrayImpl · level recorded 2026-09-22
sparsemax in 11 papers mechanisms/rap_pp.py ran · honoured contract fingerprinted licence not identified · pointer only · bc4cc560bd7663fc · report fixture: signature logits:ArrayImpl/2/float · returned ArrayImpl · level recorded 2026-09-22
BaseConfiguration mechanisms/rap_pp.py unverified licence not identified · pointer only · 5c3d3e6d9ce4bdb4 · report
BaseMechanism mechanisms/rap_pp.py unverified licence not identified · pointer only · ba39aaf5a41b65f3 · report
Dataset in 14 papers mechanisms/rap_pp.py unverified licence not identified · pointer only · 4cfb7c38939bbc13 · report
RAPpp mechanisms/rap_pp.py unverified licence not identified · pointer only · 762f5f3073e36182 · report
RAPppConfiguration mechanisms/rap_pp.py unverified licence not identified · pointer only · 7a14b6f7000d4f34 · report
print_bold mechanisms/rap_pp.py unverified licence not identified · pointer only · 677aecd970514308 · report
sparsemax_project mechanisms/rap_pp.py unverified licence not identified · pointer only · 461f51a17a3ac7d3 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for differentially private algorithm (graph method: differentially private algorithm). 12 bricks; individually on a fixture: 5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.

  1. RAPpp entry · level 0 · unverified · 762f5f3073e36182
  2. BaseMechanism helper · level 0 · unverified · ba39aaf5a41b65f3
  3. Dataset helper · level 0 · unverified · 4cfb7c38939bbc13
  4. LogTime helper · level 1 · ran · d27393ae9f746993
  5. ManageStats helper · level 1 · ran · 9cc1317ab7844603
  6. RAPppConfiguration helper · level 0 · unverified · 7a14b6f7000d4f34
  7. initialize_synthetic_dataset helper · level 1 · ran · our draft was wrong · be738d3900d465be
  8. print_bold helper · level 0 · unverified · 677aecd970514308
  9. sparsemax_project helper · level 0 · unverified · 461f51a17a3ac7d3
  10. Domain helper · level 1 · ran · 9aa567d59f83e9d4
  11. BaseConfiguration helper · level 0 · unverified · 5c3d3e6d9ce4bdb4
  12. sparsemax helper · level 1 · ran · honoured contract · bc4cc560bd7663fc

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2209.07400") returns these assemblies with each brick's role and wiring (how to connect).

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