← Back to all news
arXiv Machine Learning By Talal Alrawajfeh, Cristiana Diaconu, Ossi R\"ais\"a, Sebastian Rodriguez Beltran, Yuan He, John Bronskill, Richard E. Turner, Antti Honkela

Efficient Provably Private Classification with a Tabular Foundation Model

Read the original on arXiv Machine Learning →

Efficient Provably Private Classification with a Tabular Foundation Model introduces PrivTab, a tabular foundation model that embeds differential privacy directly into its architecture. Pretrained on simulated datasets, PrivTab uses in-context learning to convert sensitive rows into compact, provably private summaries, enabling a single forward pass for classification. The model outperforms private linear and neural‑network baselines under moderate-to-strong privacy, shows negligible membership leakage, maintains well‑calibrated predictions, and reduces dataset fitting time by 10,000×.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 29

Differentially-Private Decision Trees and Provable Robustness to Data Poisoning

The paper introduces PrivaTree, a differentially‑private decision tree algorithm that uses private histograms to select splits while preserving a small privacy budget. PrivaTree supports mixed numerical and categorical data without leaking information about numerical features and achieves a superior privacy‑utility trade‑off compared to existing methods. Additionally, the authors provide theoretical bounds on the expected accuracy and success rates of backdoor attacks, showing that PrivaTree-trained trees are more robust against data poisoning than standard decision trees.

By Dani\"el Vos, Jelle Vos, Tianyu Li, Zekeriya Erkin, Sicco Verwer
benchmarkssafety
More like this →
arXiv Machine Learning
Oct 2

Certification-Based Differentially Private Learning

The paper extends the abstract gradient training (AGT) framework to provide tighter differential privacy guarantees for both private prediction and private learning. It introduces Abstract Gradient Sampling (AGS) to analyze privacy in continuous, unbounded regression and offers theoretical and empirical evidence that these methods yield tighter bounds than global-sensitivity baselines, even in previously unbounded settings. The authors also demonstrate that their private learning algorithm can outperform standard private learners under comparable conditions.

By Mihnea Ghitu, Matthew Wicker
benchmarkssafety
More like this →