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

2457 · Jun 202019922001200920172026
48 results for privacy-protected portal

The paper proposes methods to infer from privacy-protected data using simulation-based techniques.

problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.

Entity relatedness has emerged as an important feature in a plethora of applications such as information retrieval, entity recommendation and entity linking. Given an entity, for instance a person or an organization, entity relatedness measures can be exploited for generating a list of highly-related entities. However,…

2018-10-23abs ↗pdf ↗

Paper assesses the market value of sharing privacy-protected smart meter data.

problem Value of sharing privacy-protected smart meter data between consumers and load serving entities.
method Discounted differential privacy model, ANN-based load forecasting, optimal procurement problem.
result Significant value in sharing smart meter data while retaining individual consumer privacy.

Study differential privacy in multi-agent RL, achieving efficient and private learning.

problem Protecting sensitive data in multi-agent reinforcement learning.
method Extending DP definitions to two-player games, designing an efficient algorithm with privatized bonuses.
result Achieved trajectory-wise differential privacy in multi-agent RL, improving regret bounds.

New optimizer improves privacy-protected hyperparameter tuning.

problem No practical methods for differentially private hyperparameter selection.
method Study honest hyperparameter selection under DP, show adaptive optimizers like DPAdam have an advantage.
result DPAdam optimizes hyperparameters more efficiently under DP constraints.

Differentially private log-location-scale regression models improve privacy in statistical analysis.

problem Ensuring privacy in statistical regression models while maintaining accuracy.
method Integrates differential privacy into LLS regression using the functional mechanism.
result Proposed DP-LLS models satisfy ε-differential privacy and perform well under various conditions.

Paper develops a robust PP distributed quasi-Newton estimation for Byzantine machines.

problem Byzantine machines in distributed computing under Privacy Protection constraints.
method Robust PP distributed quasi-Newton estimation method that transmits only five vectors.
result Reduces privacy budgeting and transmission cost compared to gradient descent and Newton iteration.

A new method combines federated learning and logistic regression for better credit scoring.

problem Improving credit scoring models while protecting data privacy.
method Projected gradient-based vertical federated learning (FL-LRBC) for logistic regression.
result Significant improvement in AUC and KS statistics due to data enrichment.

Proposes element-level differential privacy for better privacy and utility in statistical learning.

problem Challenges of strong differential privacy in statistical learning applications.
method Introduces element-level differential privacy, extending classical DP to protect specific user elements.
result Provides better utility and more robust results compared to classical DP by allowing finer privacy protections.

FedConPE improves conversational recommender systems efficiency and privacy.

problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.

New algorithms protect user data while optimizing personalized decisions.

problem Personalized decision-making with private user data.
method Developed LDP algorithms for stochastic generalized linear bandits using SGD and OLS.
result Achieved the same regret bound as non-privacy settings with LDP.

Differentially private synthetic control estimates treatment effects while protecting privacy.

problem Estimating treatment effects on sensitive data without revealing individual information.
method Combines non-private synthetic control and differentially private empirical risk minimization.
result Private synthetic control produces accurate predictions with minimal privacy cost.

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.

DVWU framework improves model performance by considering data value heterogeneity.

problem Existing machine unlearning algorithms ignore data value heterogeneity, potentially degrading model performance.
method Data Value-Weighted Unlearning (DVWU) framework that integrates data values into the unlearning process.
result DVWU achieves superior predictive performance and robustness compared to conventional unlearning approaches.

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.

The paper studies privacy-protected BAI with fixed confidence, deriving lower bounds and proposing an adaptive algorithm.

problem Privacy-protected Best Arm Identification (BAI) in data-sensitive applications.
method Derives lower bounds on sample complexity, proposes AdaP-TT algorithm with Laplace noise, and validates with experiments.
result AdaP-TT matches the sample complexity lower bound up to constants in the high-privacy regime.

RDP-GAN improves GAN privacy by adding random noises to loss function.

problem Protecting sensitive information in GANs while maintaining quality of generated samples.
method Integrates Rényi-differential privacy into GAN training process by adding random noises to loss function.
result Achieves better privacy protection with high-quality samples compared to existing methods.

This paper addresses privacy issues in personalized pricing using nonparametric demand models.

problem Privacy violation in personalized pricing algorithms with unknown nonparametric demand models.
method Develops algorithms to make pricing decisions and learn demand while ensuring central and local differential privacy.
result Proves near-optimal regret bounds for algorithms with CDP and LDP guarantees.

2020 Census uses more noise to protect privacy than needed, improving data accuracy.

problem Ensuring privacy in census data while maintaining accuracy for policy decisions.
method Applied ff-differential privacy to track and reduce noise across geographical levels.
result The 2020 Census provides stronger privacy protections than its nominal guarantees suggest.

Scoping review and benchmarking of synthetic EHR data generation methods.

problem Creating realistic synthetic electronic health records for research and training.
method Conducted a scoping review and benchmarked seven methods on open-source EHR datasets.
result GAN-based methods excel in fidelity and utility, while rule-based methods excel in privacy protection.

In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…

2019-05-08abs ↗pdf ↗

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.