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

64129193257 · Jun 202019922001200920172026
48 results for Privacy Cost

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.

Asynchronous algorithms reduce privacy costs in distributed machine learning.

problem Privacy concerns in training machine learning models on scattered private data.
method Differentially-private asynchronous algorithms for collaborative training.
result Cost of privacy is inversely proportional to dataset size and privacy budgets.

This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.

problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.

The calibration of noise for a privacy-preserving mechanism depends on the sensitivity of the query and the prescribed privacy level. A data steward must make the non-trivial choice of a privacy level that balances the requirements of users and the monetary constraints of the business entity. We analyse roles of the so…

2020-03-02abs ↗pdf ↗

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.

D2P-Fed improves privacy and communication in federated learning.

problem Achieving both differential privacy and communication efficiency in federated learning.
method Applying discrete Gaussian noise to private data transmission.
result D2P-Fed outperforms state-of-the-art by 4.7% to 13.0% in model accuracy with one-third less communication cost.

Efficient privacy-preserving machine learning framework using random transformations.

problem Slow training and inference speed in privacy-preserving machine learning systems.
method Random transformations like linear and permutation, combined with arithmetic sharing.
result High efficiency and low computation cost in private machine learning.

Fairness in machine learning increases privacy risks, especially for underrepresented groups.

problem Privacy risks in fair machine learning models, particularly for underrepresented groups.
method Membership inference attacks to measure information leakage and analyze fairness vs. privacy trade-offs.
result Achieving fairness in machine learning models increases privacy risks, especially for underrepresented groups.

Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowdsourced and contain sensitive information. The models should not expose private information in these datasets. Addr…

2016-07-01abs ↗pdf ↗

A novel method for learning Bayesian network structures from decentralized data, balancing privacy and efficiency.

problem Privacy and communication costs in learning Bayesian network structures from decentralized data.
method Fed-Sparse-BNSL, combining differential privacy with greedy updates targeting only a few relevant edges per participant.
result Achieves utility close to non-private baselines while offering stronger privacy and communication efficiency.

Improved canary crafting for one-run privacy auditing reduces leakage estimates.

problem Detecting canaries in one-run privacy auditing to estimate leakage effectively.
method Optimizes canaries for detectability and diversity, using a greedy initialization and bilevel optimization.
result Achieves stronger leakage estimates at lower computational cost.

Privacy can be achieved without cost in overparameterized models.

problem Understanding the performance cost of differentially private gradient descent in overparameterized settings.
method Random features model with quadratic loss.
result Privacy can be obtained for free in the overparameterized regime, not dependent on privacy parameter ε.

Privacy-preserving machine learning methods add randomness, leading to varying predictions.

problem Privacy-preserving machine learning methods add randomness, leading to varying predictions.
method The study analyzes three DP-ensuring algorithms: output perturbation, objective perturbation, and DP-SGD.
result The degree of predictive multiplicity rises as the level of privacy increases, and is unevenly distributed across individuals and demographic groups.

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.

Optimal DP mechanisms for vector queries are found to be staircase distributions.

problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.

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.

The paper addresses privacy-preserving BAI in clinical trials and user studies.

problem Privacy-preserving Best Arm Identification in adaptive clinical trials and user studies.
method The paper derives lower bounds on sample complexity for BAI algorithms with differential privacy constraints and proposes private variants of Top Two algorithms.
result Private variants of Top Two algorithms achieve asymptotic optimality in terms of sample complexity for BAI problems under differential privacy constraints.

DP-REC combines privacy and communication efficiency in federated learning.

problem Combining privacy and communication efficiency in federated learning.
method DP-REC uses Relative Entropy Coding (REC) for compression and a minor modification for differential privacy.
result DP-REC reduces communication costs while maintaining privacy comparable to state-of-the-art methods.

Develops privacy-preserving multivariate median estimation methods.

problem Lack of rigorous privacy guarantees for robust multivariate location estimation.
method Novel finite-sample performance guarantees for differentially private multivariate depth-based medians.
result Sharp performance guarantees for multivariate depth-based medians under differential privacy.

Framework for AI customer support that protects privacy and reduces costs.

problem Privacy risks and compliance challenges in AI customer support.
method Zero-shot learning with large language models, real-time data anonymization, retrieval-augmented generation, robust post-processing.
result Reduces privacy risks and compliance costs while maintaining accuracy.

The Sampled Gaussian Mechanism (SGM)---a composition of subsampling and the additive Gaussian noise---has been successfully used in a number of machine learning applications. The mechanism's unexpected power is derived from privacy amplification by sampling where the privacy cost of a single evaluation diminishes quadr…

2019-08-28abs ↗pdf ↗

This paper addresses privacy in federated learning with wireless clients and base stations.

problem Privacy of clients' data in federated learning with hierarchical wireless architecture.
method Derives communication cost limits and introduces private aggregation schemes tailored for hierarchical wireless systems.
result Private aggregation schemes reduce communication costs by multiplicative factors compared to information-theoretic limits.

Study compares federated learning and coreset approaches for privacy in distributed machine learning.

problem Measuring privacy in distributed machine learning approaches.
method Comparison of federated learning and coreset approaches using membership inference attack.
result Federated learning offers better privacy than coreset, but with higher communication cost.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

While many solutions for privacy-preserving convex empirical risk minimization (ERM) have been developed, privacy-preserving nonconvex ERM remains a challenge. We study nonconvex ERM, which takes the form of minimizing a finite-sum of nonconvex loss functions over a training set. We propose a new differentially private…

2019-10-30abs ↗pdf ↗

Private RL algorithm with privacy guarantees for personalized medicine decisions.

problem Privacy-preserving reinforcement learning for personalized medicine decisions.
method Developed a private optimism-based RL algorithm using joint differential privacy (JDP).
result Achieved strong PAC and regret bounds with a privacy guarantee.

New algorithms improve prediction with expert advice under local differential privacy.

problem Predicting expert advice with privacy constraints.
method Design of two new algorithms: RW-AdaBatch and RW-Meta, leveraging limited-switching behavior and random walks.
result RW-Meta outperforms classical and central DP algorithms by 1.5-3x on predicting hospital COVID patient densities.

Deep learning models are often trained on datasets that contain sensitive information such as individuals' shopping transactions, personal contacts, and medical records. An increasingly important line of work therefore has sought to train neural networks subject to privacy constraints that are specified by differential…

2019-11-26abs ↗pdf ↗

We develop a novel approximate Bayesian computation (ABC) framework, ABCDP, that produces differentially private (DP) and approximate posterior samples. Our framework takes advantage of the Sparse Vector Technique (SVT), widely studied in the differential privacy literature. SVT incurs the privacy cost only when a cond…

2019-10-11abs ↗pdf ↗

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.

A new federated learning framework with sparsification and adaptive optimization for privacy and efficiency.

problem Lack of sufficient privacy protection in federated learning.
method Integrates random sparsification with gradient perturbation and acceleration techniques to enhance privacy and efficiency.
result Outperforms previous differentially-private federated learning approaches in privacy and efficiency.

FastSecAgg improves federated learning security and efficiency.

problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.