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,657 papers · 148 categories

Trend · papers per month

58117175233 · Jun 202019922001200920172026
48 results for Rényi differential privacy

A(DP)2^2SGD improves federated learning privacy and efficiency.

problem Privacy and efficiency in federated learning with asynchronous decentralized parallel SGD.
method Differentially private asynchronous decentralized parallel SGD (A(DP)2^2SGD) using R{é}nyi differential privacy.
result Achieves optimal convergence rate and comparable model accuracy to SSGD but faster.

In this work we consider the gravitating vortex equations. These equations couple a metric over a compact Riemann surface with a hermitian metric over a holomorphic line bundle equipped with a fixed global section --- the Higgs field ---, and have a symplectic interpretation as moment-map equations. As a particular cas…

2016-06-24abs ↗pdf ↗

Improves privacy amplification by shuffling for differential privacy.

problem Enhancing privacy guarantees in systems with anonymous data contributions.
method Theoretical and numerical analysis of Rényi differential privacy parameters and privacy amplification by shuffling.
result First asymptotically optimal analysis of Rényi differential privacy parameters for shuffled outputs.

Differential privacy is a statistical concept that can be explained through hypothesis testing.

problem Formalizing differential privacy as a statistical concept.
method Using David Blackwell's informativeness theorem, the paper shows differential privacy can be understood through hypothesis testing.
result The definition of ff-differential privacy provides a unified framework for analyzing privacy bounds.

We obtain all possible solutions of a 1/4 Bogomol'nyi-Prasad-Sommerfield equation exactly, containing configurations made of walls, vortices and monopoles in the Higgs phase. We use supersymmetric U(N_C) gauge theories with eight supercharges with N_F fundamental hypermultiplets in the strong coupling limit. The moduli…

2004-05-14abs ↗pdf ↗

Addresses theoretical and practical aspects of Gaussian differential privacy.

problem Theoretical and practical challenges in privacy-preserving data analysis.
method Discussion of f-differential privacy and Gaussian differential privacy.
result Gaussian differential privacy can enhance privacy in various applications.

We consider a general 4n-dimensional quaternionic Kahler geometry with a free action of the torus T^(n+1). The toric action lifts onto the Swann bundle of the quaternionic Kahler space to a tri-holomorphic action that commutes with the standard H* action on the bundle. By matching Pedersen and Poon's generalized Gibbon…

2008-11-23abs ↗pdf ↗

Proposes a privacy-preserving recommendation system using matrix factorization and differential privacy.

problem Privacy leakage in recommendation systems when anonymizing user data is not sufficient.
method Uses matrix factorization and differential privacy via the Gaussian mechanism.
result Demonstrates excellent utility for privacy-preserving recommendation systems.

A new GAN loss function based on cumulant generating functions improves stability and robustness.

problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.

This paper benchmarks privacy-preserving machine learning on medical images.

problem Ensuring privacy in medical image analysis while maintaining model accuracy.
method Comparing Local-DP and DP-SGD for differential privacy in medical imagery.
result Theoretical privacy guarantees do not fully align with real-world performance.

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.

Develops a computationally tractable high-dimensional differential privacy estimator.

problem Differential privacy in high dimensions is computationally intractable.
method Combines high-dimensional robust statistics with differential privacy techniques.
result A computationally tractable algorithm with dimension-independent privacy loss.

A new privacy accountant for Gaussian differential privacy measures individual privacy losses.

problem Bounding differential privacy loss for each participant in data analysis.
method Developed a privacy accountant for adaptive compositions of randomised mechanisms using Gaussian differential privacy.
result Provided optimal bounds for the Gaussian mechanism and constructed an approximative individual privacy accountant.

Private minimum Hellinger distance estimators maintain robustness and efficiency while ensuring privacy.

problem Ensuring privacy in robust statistical estimation.
method Derive private minimum Hellinger distance estimators satisfying Hellinger differential privacy.
result Private minimum Hellinger distance estimators retain robustness and efficiency under privacy constraints.

This paper bounds min-entropy leakage for Blowfish privacy using graph symmetries.

problem Bounding min-entropy leakage for Blowfish privacy mechanisms.
method Organizing analysis over symmetrical partitions corresponding to orbits of graph automorphism groups.
result Demonstrates a construction meeting the bound with asymptotic equality, showing tightness.

Differentially private GANs improve image privacy without significant quality loss.

problem Anonymizing image data sets while maintaining image quality.
method Training GANs with differential privacy on MNIST, analyzing privacy-utility trade-offs and explaining optimization methods.
result An increasing privacy budget adds little to generated image quality, revealing a saturated training regime.

Edgeworth Accountant calculates privacy loss under differential privacy compositions efficiently.

problem Efficiently computing overall privacy loss under composition of private algorithms.
method Analytical approach using ff-differential privacy framework and Edgeworth expansion.
result Non-asymptotic (ε,δ)(ε, δ)-differential privacy bounds with reduced computational cost.

Integrates differential privacy and demographic parity in multi-class classification.

problem Ensuring fairness and privacy in sensitive applications.
method Designs DP2DP algorithm that enforces both demographic parity and differential privacy.
result DP2DP converges towards demographic parity at nearly the same rate as non-private methods, achieving state-of-the-art trade-offs.

We consider the problem of reinforcing federated learning with formal privacy guarantees. We propose to employ Bayesian differential privacy, a relaxation of differential privacy for similarly distributed data, to provide sharper privacy loss bounds. We adapt the Bayesian privacy accounting method to the federated sett…

2019-11-22abs ↗pdf ↗

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.

Paper tackles federated learning with privacy, enhancing target data analysis.

problem Heterogeneity and privacy of distributed data in federated learning.
method Formulates federated differential privacy, studies statistical problems under privacy constraints.
result Federated differential privacy offers a balance between privacy and knowledge transfer.

Paper simplifies DP composition for adaptive privacy budgets, enabling better privacy and accuracy in deep learning.

problem Tension between efficiency and flexibility in DP composition theorems.
method Rényi Differential Privacy (RDP) for adaptive privacy budgets, proving simpler composition theorem with smaller constants.
result Practical DP composition for adaptive privacy budgets, enabling better privacy and accuracy in deep learning.

DPNR preserves privacy of text representations using differential privacy.

problem Privacy leakage in deep learning text representations.
method DPNR uses Differential Privacy to provide formal privacy guarantees and dropout masking for enhanced privacy.
result DPNR reduces privacy leakage without significantly sacrificing main task performance.

Sherpa.ai framework combines federated learning and differential privacy for edge AI services.

problem Protecting data privacy in edge AI services.
method Holistic federated learning and differential privacy approach with methodological guidelines.
result Demonstrated through classification and regression use cases.

This paper addresses privacy concerns in ratio statistics using differential privacy.

problem Privacy concerns in ratio statistics across machine learning areas.
method Develops a simple algorithm for differentially private ratio statistics, proving consistency and constructing confidence intervals.
result A simple algorithm can provide excellent privacy, sample accuracy, and bias properties in ratio statistics.

Novel mean estimation method under user-level differential privacy reduces noise in continual mean estimates.

problem Maintaining accurate running mean estimates under user-level differential privacy.
method Developed a novel mean estimation specific factorization under approximate differential privacy.
result Achieved asymptotically lower mean-squared error bounds in continual mean estimation.

BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.

problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02ε= 0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n11)S)]ε= ln [t/((n_1 - 1)^S)].

PGFL framework learns personalized models with differential privacy.

problem Privacy-preserving personalized learning for diverse data.
method Exploits model similarities and differential privacy (zero-concentrated).
result Algorithm converges to optimal solutions with linear time complexity.

In this paper, we present a differential privacy version of convex and nonconvex sparse classification approach. Based on alternating direction method of multiplier (ADMM) algorithm, we transform the solving of sparse problem into the multistep iteration process. Then we add exponential noise to stable steps to achieve…

2019-08-02abs ↗pdf ↗

BCDP enhances privacy by protecting sensitive features more precisely.

problem Uniform privacy protection in LDP degrades performance for sensitive features.
method Bayesian Coordinate Differential Privacy (BCDP) adjusts privacy protection per feature sensitivity.
result BCDP improves accuracy in downstream tasks without sacrificing privacy.

Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.

problem Standard differential privacy ignores feature correlation, leading to suboptimal privacy-utility balance.
method Introduces CorrDP framework that accounts for feature correlation, using total variation distance for quantification.
result CorrDP algorithms outperform standard DP in synthetic and real-world datasets with insensitive features.

A privacy-preserving algorithm for high-dimensional bandits.

problem High-dimensional stochastic contextual linear bandits with sparse parameters under privacy constraints.
method PrivateLASSO algorithm based on sparse hard-thresholding and episodic thresholding.
result Minimax private lower bounds and utility guarantees for PrivateLASSO.

GRAND ensures node-level differential privacy for network data.

problem Lack of node-level differential privacy for network data.
method Proposes GRAND, the first mechanism for releasing networks with node-level differential privacy and preserving structural properties.
result GRAND releases networks while ensuring node-level differential privacy and preserving structural properties.

This paper surveys differential privacy methods for transportation spatiotemporal data.

problem Protecting user privacy in public release of spatiotemporal data.
method Review of differential privacy mechanisms and their application in transportation.
result Challenges in deploying and adopting differential privacy in transportation.