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

2835668481,131 · Jun 202019922001200920172026
48 results for private data release

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

Three new oracle-efficient algorithms for private synthetic data release.

problem Constructing private synthetic data that preserves statistical query answers.
method Oracle-efficient algorithms using optimization oracles for differential privacy.
result Better accuracy in large workload and high privacy regime compared to state-of-the-art.

New algorithm corrects bias in LDP-released data for better analysis.

problem Bias in data released under Local Differential Privacy (LDP).
method Inverse Weierstrass Private Stochastic Gradient Descent (IWP-SGD).
result Converges to true population risk minimizer at O(1/n)\mathcal{O}(1/n) rate.

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.

Paper addresses private online convex optimization with optimal algorithms in various geometries and high-dimensional bandits.

problem Private online convex optimization with streaming and continual release data.
method Proposes a private variant of online Frank-Wolfe algorithm with recursive gradients for variance reduction.
result Achieves optimal excess risk in linear time for 1<p21<p\leq 2 and state-of-the-art excess risk for 2<p2<p\leq\infty.

Privacy is enhanced by synthetic data release even with unlimited data.

problem Improving privacy guarantees for synthetic data release.
method Analyzing a bounded-parameter assumption to show privacy amplification persists with unlimited synthetic records.
result Privacy amplification is possible even with an unbounded number of synthetic records.

This paper provides a method for noise-calibrated inference from DP synthetic data.

problem Inference from DP synthetic data is often miscalibrated and lacks principled uncertainty quantification.
method Release DP sufficient statistics, perform noise-calibrated likelihood-based inference, and optional synthetic data generation.
result Asymptotic normality and valid confidence intervals for the plug-in DP MLE.

Many commonly used learning algorithms work by iteratively updating an intermediate solution using one or a few data points in each iteration. Analysis of differential privacy for such algorithms often involves ensuring privacy of each step and then reasoning about the cumulative privacy cost of the algorithm. This is …

2018-08-20abs ↗pdf ↗

New DP bootstrap method for statistical inference with improved privacy and accuracy.

problem Lack of general techniques for conducting statistical inference under differential privacy.
method DP bootstrap procedure to infer sampling distribution and construct confidence intervals.
result DP bootstrap estimates provide consistent point estimates and asymptotically valid standard CIs.

User releases data to service provider while balancing privacy and utility.

problem Balancing user privacy and service utility in data release.
method Formulated as a Markov decision process (MDP) and solved using deep reinforcement learning (RL).
result Achieved a trade-off between revealing useful information and protecting sensitive data.

This work refines grid size selection for non-interactive private KK-means clustering.

problem Choosing the optimal number of grids for privatized KK-means clustering.
method Proposes a refined grid-size selection rule to minimize expected deviation in the K-means objective function.
result The proposed strategy results in more accurate clustering compared to prior work, even under tight privacy budgets.

Review of privacy-preserving linear models for high-dimensional data.

problem Overfitting and data memorization in high-dimensional linear models.
method Comprehensive comparison of optimization techniques for differentially private high-dimensional linear models.
result Coordinate-optimized algorithms perform best in empirical tests.

We lay theoretical foundations for new database release mechanisms that allow third-parties to construct consistent estimators of population statistics, while ensuring that the privacy of each individual contributing to the database is protected. The proposed framework rests on two main ideas. First, releasing (an esti…

2017-10-04abs ↗pdf ↗

A new mechanism for differentially private Fréchet mean on SPD matrices.

problem Privacy-preserving statistical summaries for SPD matrices.
method Tangent Gaussian mechanism for log-Euclidean metric.
result Significantly better utility and computational efficiency.

Paper introduces data-dependent SSP for private linear and logistic regression.

problem Private linear and logistic regression with better performance.
method Data-dependent sufficient statistic perturbation (SSP) for linear and logistic regression.
result Data-dependent SSP outperforms state-of-the-art methods for linear and logistic regression.

New algorithms improve privacy-preserving data release using external predictions.

problem Privacy-preserving data release with improved utility using external information.
method Learning-augmented algorithms for multiple quantile release.
result Error guarantees scale with prediction quality, almost recovering state-of-the-art guarantees.

The paper analyzes and proposes methods for privately sharing individual privacy losses using per-instance differential privacy.

problem The standard differential privacy framework provides a worst-case bound that may not accurately reflect individual privacy losses.
method The paper analyzes per-instance differential privacy and proposes methods to privately and accurately publish per-instance privacy losses.
result The methods privately and accurately publish per-instance differential privacy losses with minimal additional privacy cost.

New algorithm for personalized healthcare with privacy guarantees.

problem Online exploration in reinforcement learning with differential privacy constraints.
method ε-JDP algorithm with privately released exploration bonuses and visitation statistics.
result Regret bound of O(SAH2T+S2AH3/ε)O(\sqrt{SAH^2T}+S^2AH^3/ε) matching information-theoretic lower bound.

Study differentially private methods for learning Hawkes processes.

problem Lack of thorough analysis on sample complexity for learning Hawkes processes parameters and releasing differentially private versions.
method Developed non-private and differentially private estimators for Hawkes processes parameters.
result Obtained sample complexity results for both private and non-private settings.

P3GM improves privacy-preserving data synthesis for high-dimensional data.

problem Mitigating privacy risks in releasing large volumes of sensitive data.
method Privacy-preserving phased generative model (P3GM) with two-phase learning process.
result P3GM significantly outperforms existing solutions in terms of noise reduction and data accuracy.

Proposes differentially private normalizing flows for privacy-preserving density estimation.

problem Privacy concerns in density estimation models when individuals are directly associated with the training data.
method Uses normalizing flow models with explicit differential privacy guarantees.
result Substantially outperforms previous state-of-the-art approaches in privacy-preserving density estimation.

Paper proposes no-regret algorithms for private GP bandit optimization.

problem Private Gaussian process bandit optimization.
method Combines uniform kernel approximator with random perturbations for differentially private GP bandit algorithms.
result Provable no-regret algorithms for stationary kernel functions in two DP settings.

Algorithm ensures privacy while strictly adhering to constraints.

problem Differential privacy with linear constraints that must be strictly followed.
method Developed an algorithm that releases a nearly-optimal solution satisfying constraints with probability 1.
result Achieved nearly optimal performance while preserving privacy and strictly adhering to constraints.

Bayesian optimization is a powerful tool for fine-tuning the hyper-parameters of a wide variety of machine learning models. The success of machine learning has led practitioners in diverse real-world settings to learn classifiers for practical problems. As machine learning becomes commonplace, Bayesian optimization bec…

2015-01-16abs ↗pdf ↗

Differential privacy is a framework for privately releasing summaries of a database. Previous work has focused mainly on methods for which the output is a finite dimensional vector, or an element of some discrete set. We develop methods for releasing functions while preserving differential privacy. Specifically, we sho…

2012-03-12abs ↗pdf ↗

Releasing full data records is one of the most challenging problems in data privacy. On the one hand, many of the popular techniques such as data de-identification are problematic because of their dependence on the background knowledge of adversaries. On the other hand, rigorous methods such as the exponential mechanis…

2017-08-26abs ↗pdf ↗

We revisit the problem of differentially private release of classification queries. In this problem, the goal is to design an algorithm that can accurately answer a sequence of classification queries based on a private training set while ensuring differential privacy. We formally study this problem in the agnostic PAC …

2019-07-31abs ↗pdf ↗

We present differentially private algorithms for the stochastic Multi-Armed Bandit (MAB) problem. This is a problem for applications such as adaptive clinical trials, experiment design, and user-targeted advertising where private information is connected to individual rewards. Our major contribution is to show that the…

2015-11-27abs ↗pdf ↗

Proposes using probabilistic models for privacy-preserving synthetic data.

problem Designing high-quality synthetic data for privacy preservation.
method Formulate the problem through probabilistic modelling, choosing a model for the data.
result Statistical discoveries can be reliably reproduced from synthetic data.

Widely-used public benchmarks are of huge importance to computer vision and machine learning research, especially with the computational resources required to reproduce state of the art results quickly becoming untenable. In medical image computing, the wide variety of image modalities and problem formulations yields a…

2019-08-12abs ↗pdf ↗

Study on generating and identifying languages privately, showing privacy imposes costs and creates barriers.

problem Generating and identifying languages privately in the limit model.
method Introduced a continual release model under differential privacy constraints, proving both positive and negative results.
result Privacy imposes quantitative and qualitative costs, and creates fundamental barriers for identification.

Popular approaches to differential privacy, such as the Laplace and exponential mechanisms, calibrate randomised smoothing through global sensitivity of the target non-private function. Bounding such sensitivity is often a prohibitively complex analytic calculation. As an alternative, we propose a straightforward sampl…

2017-06-08abs ↗pdf ↗

Differentially private method for estimating individualized treatment rules.

problem Estimating individualized treatment rules while preserving privacy.
method Differentially private two-stage empirical risk minimization (DP-2ERM).
result Improved privacy-utility trade-off demonstrated through simulations and applications.