Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for private data generation

We study the sample complexity of private synthetic data generation over an unbounded sized class of statistical queries, and show that any class that is privately proper PAC learnable admits a private synthetic data generator (perhaps non-efficient). Previous work on synthetic data generators focused on the case that …

2019-02-09abs ↗pdf ↗

Improved image generation with private data using perceptual features.

problem Difficulty in training generative models with differential privacy.
method Use pre-trained perceptual features to learn private data distribution.
result Generative models can generate high-quality images with low privacy budget (ϵ2\epsilon \approx 2).

Develops a private synthetic graph generator using Gromov-Wasserstein distance.

problem Creating private synthetic networks for complex data.
method Random connection model, fused Gromov-Wasserstein distance, differential privacy.
result Effective algorithm for generating private synthetic graphs with theoretical guarantees.

Private method measures nonlinear correlations between data hosted across two entities.

problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.

AdaDPSyn generates synthetic examples to protect private data in ICL.

problem Protecting private data in in-context learning with large language models.
method Data-adaptive differentially private algorithm that dynamically adjusts noise level based on data properties.
result AdaDPSyn outperforms existing methods in preserving high ICL accuracy while maintaining differential privacy.

Private algorithms adapt from public to private domains with minimal labeled data.

problem Adapting from a public source domain to a private target domain with few labeled data.
method Differentially private discrepancy minimization algorithms based on Frank-Wolfe and Mirror-Descent methods.
result Effective adaptation with strong generalization and privacy guarantees.

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…

2017-01-04abs ↗pdf ↗

DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.

problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.

Two private algorithms improve domain adaptation with privacy guarantees.

problem Improving predictions for a private target domain using public data.
method Two (ε,δ)(ε, δ)-differentially private algorithms for supervised domain adaptation.
result Private algorithms maintain performance close to non-private versions.

Discond-VAE separates continuous and discrete factors in data.

problem Separating shared and class-specific variations in real-world data.
method Introduces private and public latent variables to represent continuous and discrete factors, respectively.
result Discond-VAE successfully disentangles class-dependent continuous factors from discrete factors.

Paper explores how non-neural simulators can enhance DP synthetic data generation.

problem Generating differentially private synthetic data without access to foundation models.
method Private Evolution (PE) framework using inference APIs and simulators.
result Sim-PE framework improves downstream classification accuracy and FID scores.

DP-RandP improves privacy-utility tradeoff in DP-SGD by learning priors from random processes.

problem Improving the performance of differentially private stochastic gradient descent (DP-SGD) on private data.
method A three-phase approach that learns priors from images generated by random processes and transfers these priors to private data.
result New state-of-the-art accuracy on CIFAR10, CIFAR100, MedMNIST, and ImageNet for various privacy budgets.

Catastrophic forgetting can be a significant problem for institutions that must delete historic data for privacy reasons. For example, hospitals might not be able to retain patient data permanently. But neural networks trained on recent data alone will tend to forget lessons learned on old data. We present a differenti…

2019-02-18abs ↗pdf ↗

We consider learning problems where the training set consists of two types of examples: private and public. The goal is to design a learning algorithm that satisfies differential privacy only with respect to the private examples. This setting interpolates between private learning (where all examples are private) and cl…

2019-10-25abs ↗pdf ↗

Public pretraining improves private model training even in extreme distribution shift scenarios.

problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.

Hermite polynomials improve private data generation by reducing feature count.

problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.

Differentially private algorithms protect model explanations from leaking training data.

problem Model explanations can leak training data, compromising privacy.
method Adaptive differentially private gradient descent algorithm to produce accurate, private explanations.
result Privacy amplification and reduction of overall privacy loss on explanation data.

Algorithm generates private continuous-time data for sensitive domains.

problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.

Study private submodular maximization in streaming data.

problem Private maximization of submodular functions in streaming data.
method Established differentially private baselines and derived better trade-offs for decomposable submodular functions.
result Improved trade-offs between privacy and utility for decomposable submodular functions.

Study public-data assisted private stochastic optimization with labeled or unlabeled public data.

problem Limits and capability of public-data assisted differentially private (PA-DP) algorithms in stochastic convex optimization.
method Lower bounds for PA-DP mean estimation and novel methods for leveraging public data in private supervised learning.
result Achieved dimension independent rate for GLM with unlabeled public data, showing optimality.

Differentially Private algorithms often need to select the best amongst many candidate options. Classical works on this selection problem require that the candidates' goodness, measured as a real-valued score function, does not change by much when one person's data changes. In many applications such as hyperparameter o…

2018-11-19abs ↗pdf ↗

Private estimation of many quantiles using differential privacy.

problem Estimating quantiles of a distribution privately.
method Two approaches: 1) Private estimation of empirical quantiles, 2) Uniform density estimation.
result There is a tradeoff between estimating quantiles at specific points and uniformly estimating the quantile function.

Framework evaluates privacy cost of non-private pre-processing in DP pipelines.

problem Privacy cost of non-private data-dependent pre-processing in DP machine learning pipelines.
method Establishes upper bounds on overall privacy guarantees using Smooth DP and bounded sensitivity.
result Explicit overall privacy guarantees for various pre-processing algorithms.

Locally private methods detect changes in time series data.

problem Detecting distributional changes in time series data under local differential privacy.
method Proposed locally differentially private algorithms based on randomized response and binary mechanisms.
result Theoretical performance bounds and empirical validation of detection accuracy.

Unified approach improves accuracy in private estimation.

problem Protecting sensitive information in statistical estimation.
method Unified Bayes Private Point (UBaPP) approach to Bayes point estimation under differential privacy constraints.
result Achieves better accuracy-privacy trade-off than traditional methods.

EIGAN learns private representations without centralized data, outperforming state-of-the-art.

problem Private representation learning with multiple ally and adversary attributes.
method Exclusion-Inclusion Generative Adversarial Network (EIGAN) and Distributed EIGAN (D-EIGAN).
result EIGAN and D-EIGAN outperform state-of-the-art methods in accuracy and scalability.

New method for estimating median and mean with high probability privacy.

problem Estimating median and mean with differential privacy.
method Propose, Test, Release (PTR) mechanism with concentration inequalities.
result First sub-Gaussian high probability bounds for differentially private median and mean estimation.