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

10.7%21.3%32.0%42.6% · Jun 202019922001200920172026
48 results for user-level data

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.

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.

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.

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.

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.

New attack recovers user-level information from large batch images.

problem Recovering private information from user-level gradients in distributed learning.
method Proposes a gradient inversion attack using a denoising diffusion model as a prior.
result Demonstrates recovery of realistic facial images and private attributes.

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.

New method uses Winsorized mean estimators for privacy-preserving statistics on dependent data.

problem Privacy-preserving statistics on dependent data with sensitive information.
method Adapting noisy Winsorized mean estimators to handle dependence via log-Sobolev inequalities.
result Asymptotic and finite sample guarantees for item-level and user-level mean estimation similar to \iid{} settings.

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.

CDA framework infers channel influence from aggregated data without user identifiers.

problem Lack of user-level path data due to privacy regulations and platform restrictions.
method CDA integrates PCMCI for causal discovery and Structural Causal Model for effect estimation.
result CDA achieves strong accuracy in estimating channel influence, even under structural uncertainty.

Study shows FL reduces unintended memorization by clustering data and using strong user-level privacy.

problem Unintended memorization in federated learning.
method Examined the effect of clustering data and using strong user-level differential privacy in FL.
result Clustering data and strong user-level differential privacy reduce unintended memorization.

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.

Improved locally private sparse estimation with multiple samples per user.

problem Challenges in high-dimensional locally private sparse estimation.
method Proposes a framework for user-level locally private sparse linear regression with multiple samples per user.
result Eliminates the dependency of dimensionality on error bounds, achieving tighter error bounds.

The evolution of social media users' behavior over time complicates user-level comparison tasks such as verification, classification, clustering, and ranking. As a result, naïve approaches may fail to generalize to new users or even to future observations of previously known users. In this paper, we propose a novel pro…

2019-10-11abs ↗pdf ↗

Structured subsampling improves privacy in deep time series forecasting.

problem Incompatible privacy guarantees with time series forecasting.
method Structured subsampling of sequential data for privacy amplification.
result Structured subsampling enables training with strong privacy guarantees.

Kolmogorov-Arnold network improves GW catalog posterior construction.

problem Efficiently constructing posterior distributions for GW catalogs.
method Using the Kolmogorov-Arnold network to create lightweight neural density estimators.
result Kolmogorov-Arnold network achieves superior interpretability and accuracy in posterior construction.

User engagement in online social networking depends critically on the level of social activity in the corresponding platform--the number of online actions, such as posts, shares or replies, taken by their users. Can we design data-driven algorithms to increase social activity? At a user level, such algorithms may incre…

2018-02-19abs ↗pdf ↗

Existing approaches for training neural networks with user-level differential privacy (e.g., DP Federated Averaging) in federated learning (FL) settings involve bounding the contribution of each user's model update by clipping it to some constant value. However there is no good a priori setting of the clipping norm acr…

2019-05-09abs ↗pdf ↗

FedIRT enables privacy-preserving psychometric estimation without centralizing data.

problem Privacy and data governance concerns in centralized IRT estimation.
method Federated Item Response Theory (FedIRT) and FedIRT-DP for differentially private estimation.
result FedIRT matches accuracy of centralized estimators while preserving privacy.

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.

New DP mechanisms improve ML privacy-utility-computational tradeoffs.

problem Improving privacy in machine learning with multiple passes over data.
method Formalized DP for adaptive streams, extended matrix factorization techniques, Fourier-transform-based mechanism.
result Substantial improvements in privacy-utility-computational tradeoffs over previous methods.

A new method improves recommendation accuracy by learning from multiple networks and time-dependent user preferences.

problem Incomplete user profiles and dynamic user preferences degrade recommender quality.
method A cross-network time-aware recommender that learns from multiple source networks and develops current user models.
result The proposed solution achieves superior performance in accuracy, novelty, and diversity.

Locally private online quantile regression method addresses privacy constraints.

problem Estimating and inferring quantile regression under local differential privacy constraints.
method Developed a finite-alphabet channel where users compute local contributions, apply randomized response, and send reports. A public decoder corrects distortion and reconstructs inputs for averaging.
result Established local privacy, decoder unbiasedness, consistency, asymptotic normality, and inference for scalar contrasts.

Critical task and cognition-based environments, such as in military and defense operations, aviation user-technology interaction evaluation on UI, understanding intuitiveness of a hardware model or software toolkit, etc. require an assessment of how much a particular task is generating mental workload on a user. This i…

2019-11-07abs ↗pdf ↗

This paper improves privacy in federated learning without a trusted server.

problem Privacy in federated learning with silos that distrust each other.
method Introduces Inter-Silo Record-Level Differential Privacy (ISRL-DP) and accelerated algorithms for convex and smooth losses.
result Achieves optimal privacy and accuracy tradeoffs in federated learning.

This paper shows how differential privacy can be achieved naturally in federated learning over fading channels without artificial noise.

problem Achieving differential privacy in federated learning over fading channels without artificial noise.
method Study of AirFL over multiple-access fading channels with a multi-antenna base station, deriving novel bounds on differential privacy.
result DP can be achieved naturally in federated learning over fading channels without artificial noise, revealing convergence-privacy trade-offs.

We establish the first benchmark for federated learning with differential privacy in ASR, achieving competitive performance.

problem Challenges in training large transformer models for ASR in federated learning with differential privacy.
method Per-layer clipping and layer-wise gradient normalization to mitigate gradient heterogeneity.
result FL with DP is viable in ASR with strong privacy guarantees, achieving competitive performance.

Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…

2017-12-12abs ↗pdf ↗

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.