资讯

Exploring the Privacy--Size Tradeoff for Differentially Private Self-Attentive Variational Autoencoders

📅 2026-11-05 ⏱️ 约 6 分钟阅读 ✍️ AI导航编辑部 🔗 arxiv.org
Exploring the Privacy--Size Tradeoff for Differentially Private Self-Attentive Variational Autoencoders
📝 内容摘要

Computer Science > Machine Learning [Submitted on 3 Nov 2026] Title:Exploring the Privacy--Size Tradeoff for Diffe

📌 核心要点

  • Computer Science > Machine Learning
  • [Submitted on 3 Nov 2026]
  • Current browse context:

Computer Science > Machine Learning

[Submitted on 3 Nov 2026]

Title:Exploring the Privacy--Size Tradeoff for Differentially Private Self-Attentive Variational Autoencoders

View PDF HTML (experimental)Abstract:Data tends to be most useful when it is shared, and the data most worth sharing is often the data that privacy obligations restrict. Synthetic data from a generator trained under differential privacy (DP) is one way to reconcile the two, but its utility depends on the privacy budget $\varepsilon$ and on how much data the generator sees - a parameter that most data sharing applications of synthetic data control. We present SAVANT, a self-attentive variational autoencoder for tabular data trained with DP-SGD that, to our knowledge, is the first to combine attention, a VAE, and DP in one tabular model. We evaluate it against two marginal mechanisms, PrivBayes and MST, jointly over the privacy budget and the dataset size on two public datasets, measuring the utility a downstream classifier loses by training on synthetic rather than real data. We find that, under the same DP guarantee, more data generally means more utility. For the marginal mechanisms it absorbs most of what a strict budget costs, and a noise-scaling argument suggests DP-SGD exchanges data fo budget at a worse rate. Two independent membership-inference attacks, judged against a measured null, found no aggregate membership signal.

Additional Features

Current browse context:

cs.LG

References & Citations

Loading...

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)

Connected Papers (What is Connected Papers?)

Litmaps (What is Litmaps?)

scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub (What is DagsHub?)

Gotit.pub (What is GotitPub?)

Hugging Face (What is Huggingface?)

ScienceCast (What is ScienceCast?)

Demos

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)

CORE Recommender (What is CORE?)

IArxiv Recommender

(What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

来源arxiv.org· 本文为编辑整理,仅供参考