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

24497397 · Jun 202019922001200920172026
48 results for personalized privacy

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.

Generative framework unifies and improves personalized learning and estimation methods.

problem Statistical heterogeneity in client data motivates personalized learning models.
method Generative framework unifies and suggests new personalized learning and estimation algorithms.
result AdaPeD algorithm numerically outperforms known algorithms.

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.

The rise of connected personal devices together with privacy concerns call for machine learning algorithms capable of leveraging the data of a large number of agents to learn personalized models under strong privacy requirements. In this paper, we introduce an efficient algorithm to address the above problem in a fully…

2017-05-23abs ↗pdf ↗

Study improves privacy in cross-silo federated learning by personalizing data.

problem Privacy concerns in cross-silo federated learning.
method Introduced sample-level differential privacy for silos, analyzed mean-regularized multi-task learning.
result Mean-regularized multi-task learning is a strong baseline for cross-silo federated learning under stronger privacy requirements.

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 paper improves privacy and fairness in federated learning by protecting sensitive data and ensuring group fairness.

problem Privacy and fairness issues in federated learning.
method Introduces group privacy through dd-privacy, a localized form of differential privacy.
result The method provides better group fairness than a global model in federated learning.

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.

A new method for tighter privacy loss accounting in adaptive analyses.

problem Ensuring individual privacy in adaptive analyses while staying within a privacy budget.
method A personalized privacy loss estimate and a Rényi differential privacy filter.
result Personalized privacy loss accounting can be practical and tighter than existing methods.

Private mean estimation with multiple samples requires a certain number of people to maintain privacy.

problem Private mean estimation with person-level differential privacy for multiple samples.
method The approach involves estimating the mean up to a distance α in ℓ_2-norm under ε-differential privacy, using algorithms based on the clip-and-noise framework and new analyses.
result The necessary and sufficient number of people to estimate the mean up to distance α in ℓ_2-norm is given by a specific formula.

The introduction of data analytics into medicine has changed the nature of patient treatment. In this, patients are asked to disclose personal information such as genetic markers, lifestyle habits, and clinical history. This data is then used by statistical models to predict personalized treatments. However, due to pri…

2016-11-26abs ↗pdf ↗

Paper proposes FedPer to combat statistical heterogeneity in federated learning for personalized tasks.

problem Statistical heterogeneity in federated learning data degrades performance of traditional federated averaging.
method FedPer: a base + personalization layer approach for federated training of deep feedforward neural networks.
result FedPer effectively combats statistical heterogeneity in non-identical data partitions of CIFAR datasets and personalized image aesthetics datasets.

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 ↗

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.

The paper analyzes and improves privacy in machine learning through importance sampling.

problem Ensuring privacy in machine learning while maintaining utility and efficiency.
method Individualized privacy analysis of importance sampling, proposing two approaches for constructing sampling distributions.
result Proposed approaches optimize privacy-efficiency trade-off and outperform uniform sampling.

Proposes first privacy-preserving method for estimating Hawkes processes.

problem Estimating point process models with sensitive personal data raises privacy concerns.
method Proposes differential privacy for event stream data and two optimization algorithms.
result Efficiently estimates Hawkes process models with privacy and utility guarantees.

DP-CDA generates synthetic data to enhance privacy in high-dimensional datasets.

problem Privacy concerns in anonymized datasets, especially in high-dimensional data.
method Randomized mixing of privacy-sensitive data in a class-specific manner with carefully tuned randomness.
result DP-CDA provides stronger privacy guarantees compared to existing methods, maintaining utility.

LP-FT improves personalized model training in FL by balancing generalization and personalization.

problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.

FGPR uses averaging and SGD for federated GP\mathcal{GP} regression, excelling in personalization and multi-fidelity modeling.

problem Privacy-preserving multi-fidelity data modeling and personalization.
method Federated Gaussian process framework with averaging and SGD for local computations.
result FGPR converges to a critical point of the full log-likelihood function, excels in personalization and multi-fidelity modeling.

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 ↗

This paper enhances privacy-preserving randomized power method for large datasets.

problem Privacy issues in applying randomized power method to large datasets containing personal information.
method Proposes enhanced privacy-preserving variants of the randomized power method, including a variant with reduced noise and a decentralized framework.
result Tighter convergence bounds and empirical comparisons with previous work in real recommendation datasets.

FedLog reduces communication in federated learning by sharing data summaries.

problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.

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.

In machine learning, classification models need to be trained in order to predict class labels. When the training data contains personal information about individuals, collecting training data becomes difficult due to privacy concerns. Local differential privacy is a definition to measure the individual privacy when th…

2019-05-03abs ↗pdf ↗

Voice-enabled interactions provide more human-like experiences in many popular IoT systems. Cloud-based speech analysis services extract useful information from voice input using speech recognition techniques. The voice signal is a rich resource that discloses several possible states of a speaker, such as emotional sta…

2019-08-09abs ↗pdf ↗

Improved privacy in RL with near-optimal regret bounds.

problem Privacy-preserving reinforcement learning in personalized decision-making systems.
method Differentially private algorithm based on LSVI-UCB++ with privacy-preserving techniques.
result Achieved a near-optimal regret bound of O(d * sqrt(H^3 * K) + H^(15/4) * d^(7/6) * K^(1/2) / ε).

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.

Explanation in machine learning and related fields such as artificial intelligence aims at making machine learning models and their decisions understandable to humans. Existing work suggests that personalizing explanations might help to improve understandability. In this work, we derive a conceptualization of personali…

2019-01-03abs ↗pdf ↗

Study proposes BFEL framework for privacy-preserving FL in personalized healthcare.

problem Privacy and security concerns in traditional cloud-centric ML, especially in wearable devices.
method Develops a blockchain-enhanced federated edge learning (BFEL) framework based on FedCurv, incorporating fisher information matrix and public key encryption.
result Significant reduction in communication cost and high efficiency for federated training on non-iid and heterogeneous data.

Proposes PFWCP for multi-agent tasks with privacy and validity guarantees.

problem Challenges in uncertainty quantification for multi-agent settings.
method Personalized federated weighted conformal prediction (PFWCP) combining local density ratio weighting and weighted quantile aggregation.
result Asymptotically valid coverage guarantees for each agent in heterogeneous settings.

A new algorithm improves federated learning by combining knowledge distillation and weighted combination loss.

problem Non-IID client data in federated learning leads to model drift and poor generalization.
method pFedKD-WCL integrates knowledge distillation with bi-level optimization to address non-IID challenges.
result pFedKD-WCL outperforms state-of-the-art algorithms in accuracy and convergence speed.

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.

A new method models user-specific parameters as a low-rank plus sparse component for efficient personalization.

problem Efficient personalization of machine learning models for individual users.
method Meta-learning approach that models network weights as a sum of low-rank and sparse components.
result The proposed method, AMHT-LRS, achieves nearly optimal sample complexity for estimating the low-rank and sparse components.

A new DP algorithm for weighted ERM protects sensitive data in predictive models.

problem Protecting sensitive personal information in predictive models trained via ERM.
method Proposes the first differentially private algorithm for weighted ERM with formal privacy guarantees.
result Demonstrates strong DP guarantees while maintaining robust performance in real-world data.

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.

Group personalization improves FL performance in heterogeneous client data.

problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.

AI platforms disrupt investment by personalizing deal sourcing and insights.

problem Lack of scalable, personalized, and privacy-compliant deal sourcing and insights solutions.
method Development of in-house AI platforms that interact directly with funds and learn from interactions.
result AI platforms provide smarter, personalized use cases for funds, offering a competitive advantage.

Causal inference deals with identifying which random variables "cause" or control other random variables. Recent advances on the topic of causal inference based on tools from statistical estimation and machine learning have resulted in practical algorithms for causal inference. Causal inference has the potential to hav…

2015-12-17abs ↗pdf ↗