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

Trend · papers per month

3673109145 · Jun 202019922001200920172026
48 results for user privacy

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.

New privacy mechanism for user-level discrete distributions with reduced penalty.

problem Achieving privacy for all items of a single user in practical applications.
method Study of learning discrete distributions with user-level differential privacy, proposing a new mechanism with reduced privacy penalty.
result Proposed mechanism reduces privacy penalty to ildeO(k/(mα2)+k/mεα) ilde{\mathcal{O}}(k/(mα^2) + k/\sqrt{m}εα), significantly smaller than standard mechanisms.

PriRec preserves privacy in POI recommendation by keeping data and models on users' devices.

problem Privacy concerns in centralized POI recommendation models.
method Local differential privacy for sensitive data, secure decentralized gradient descent for linear models, secure aggregation for feature interactions.
result PriRec achieves comparable or better recommendation accuracy than FM while protecting user privacy.

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.

Decor protects decentralized learning models from curious users.

problem Privacy violation in decentralized learning.
method Decor uses correlated Gaussian noises to protect local models in decentralized SGD with differential privacy guarantees.
result Decor matches central DP optimal privacy-utility trade-off for arbitrary connected graphs.

This paper analyzes user-level local differential privacy in distributed systems.

problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

The paper explores how to measure and optimize ad reach while maintaining user privacy.

problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces kk-anonymity and probabilistic discounting for frequency capping.
result Privacy introduces a significant performance drop but with manageable costs.

Paper studies user-level differential privacy in federated linear contextual bandits.

problem Federated learning with user-level differential privacy constraints.
method Unified federated bandits framework, CDP and LDP definitions, ROBIN algorithm.
result Near-optimal learning under user-level CDP with privacy budget and number of clients.

This paper presents a method to generate synthetic data with differential privacy to protect user privacy while maintaining data trends.

problem Protecting user privacy while using real data for AI applications.
method Develops a practical guide to generating synthetic data using differential privacy.
result Synthetic data can be generated to preserve trends of real data while ensuring strong privacy protections.

A new algorithm estimates mean under varying user data sizes with local differential privacy.

problem Mean estimation with user-level local differential privacy under varying data sizes.
method Distribution-aware mean estimation algorithm for users with varying data sizes.
result Upper and lower bounds on the worst-case risk for mean estimation are derived.

Develops privacy-preserving methods for longitudinal linear regression.

problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.

We propose a cloud-based filter trained to block third parties from uploading privacy-sensitive images of others to online social media. The proposed filter uses Distributed One-Class Learning, which decomposes the cloud-based filter into multiple one-class classifiers. Each one-class classifier captures the properties…

2018-02-10abs ↗pdf ↗

Secure federated learning framework resists adversarial users.

problem Resilience against adversarial (Byzantine) users in federated learning.
method Integrated stochastic quantization, verifiable outlier detection, and secure model aggregation.
result First single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning.

It is becoming increasingly clear that users should own and control their data. Utility providers are also becoming more interested in guaranteeing data privacy. As such, users and utility providers should collaborate in data privacy, a paradigm that has not yet been developed in the privacy research community. We intr…

2018-05-18abs ↗pdf ↗

Contextual bandit algorithms~(CBAs) often rely on personal data to provide recommendations. Centralized CBA agents utilize potentially sensitive data from recent interactions to provide personalization to end-users. Keeping the sensitive data locally, by running a local agent on the user's device, protects the user's p…

2019-09-10abs ↗pdf ↗

Providing meaningful privacy to users of location based services is particularly challenging when multiple locations are revealed in a short period of time. This is primarily due to the tremendous degree of dependence that can be anticipated between points. We propose a Rényi differentially private framework for boundi…

2019-12-09abs ↗pdf ↗

FLAME improves privacy in federated learning without trusted parties.

problem Ensuring privacy in federated learning without trusted parties.
method FLAME uses the shuffle model of differential privacy to achieve better accuracy and privacy.
result FLAME protocols improve testing accuracy by 60.7% compared to local model FL.

New methods protect privacy while providing accurate prediction sets.

problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.

Protects user privacy in models using optional personal data.

problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.

Our everyday interactions with pervasive systems generate traces that capture various aspects of human behavior and enable machine learning algorithms to extract latent information about users. In this paper, we propose a machine learning interpretability framework that enables users to understand how these generated t…

2017-10-23abs ↗pdf ↗

Private ALS method improves matrix completion with tighter rates and better privacy.

problem Differential privacy in matrix completion for user-level privacy.
method Joint differentially private ALS method with tighter sample complexity and privacy trade-offs.
result Achieves nearly optimal sample complexity and best privacy/utility trade-off.

New bounds for LDP with heterogeneous privacy levels guaranteeing high probability of accuracy.

problem Statistical estimation under LDP with users having varying privacy levels.
method Developed finite sample upper bounds in ℓ_2-norm with high probability, complemented by lower bounds.
result Optimal guarantees for heterogeneous LDP in terms of probability and constants.

Collaborative personalization, such as through learned user representations (embeddings), can improve the prediction accuracy of neural-network-based models significantly. We propose Federated User Representation Learning (FURL), a simple, scalable, privacy-preserving and resource-efficient way to utilize existing neur…

2019-09-27abs ↗pdf ↗

A new framework reduces data upload for image classification while protecting user privacy.

problem Data upload limitations and privacy concerns in cloud-based image classification.
method Unsupervised autoencoder training at edge devices, followed by latent vector transmission to server for classifier training.
result The framework reduces communications overhead and protects user data privacy.

Today, large amounts of valuable data are distributed among millions of user-held devices, such as personal computers, phones, or Internet-of-things devices. Many companies collect such data with the goal of using it for training machine learning models allowing them to improve their services. User-held data is, howeve…

2019-07-08abs ↗pdf ↗

This work addresses privacy issues in IoT data sharing by balancing information disclosure and user privacy.

problem Balancing privacy and utility in time-series data sharing from IoT devices.
method Formulated as POMDPs, solved using A2C DRL, evaluated with synthetic and real data.
result Proposed policies achieve a good balance between privacy and utility.

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.

This work studies differential privacy in the context of the recently proposed shuffle model. Unlike in the local model, where the server collecting privatized data from users can track back an input to a specific user, in the shuffle model users submit their privatized inputs to a server anonymously. This setup yields…

2019-03-07abs ↗pdf ↗

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.