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

130259389518 · Jun 202019922001200920172026
48 results for Private Multiplicative Weights

Optimizes sparse fine-tuning for privacy in neural networks.

problem Performance gap between DP-SGD and non-private fine-tuning.
method Optimization-based approach using private gradient information for selecting trainable weights.
result Our selection method leads to better prediction accuracy compared to existing approaches.

Differentially private weighted sampling improves privacy while maintaining utility.

problem Ensuring privacy in datasets with key-value pairs while preserving analytical utility.
method Private Weighted Sampling (PWS) that ensures element-level differential privacy.
result Significant performance gains in key reporting and estimation accuracy compared to prior methods.

Differentially private method for estimating individualized treatment rules.

problem Estimating individualized treatment rules while preserving privacy.
method Differentially private two-stage empirical risk minimization (DP-2ERM).
result Improved privacy-utility trade-off demonstrated through simulations and applications.

Financial forecasting is challenging and attractive in machine learning. There are many classic solutions, as well as many deep learning based methods, proposed to deal with it yielding encouraging performance. Stock time series forecasting is the most representative problem in financial forecasting. Due to the strong …

2018-09-27abs ↗pdf ↗

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.

Private method measures nonlinear correlations between data hosted across two entities.

problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.

We design a new algorithm for the Euclidean kk-means problem that operates in the local model of differential privacy. Unlike in the non-private literature, differentially private algorithms for the kk-means objective incur both additive and multiplicative errors. Our algorithm significantly reduces the additive erro…

2019-07-04abs ↗pdf ↗

This paper relaxes the common prior assumption in the public and private information game of Morris and Shin (2000, 2004). For the generalized game, where the agent's prior expectations are heterogenous, it derives a sharp condition for the emergence of unique/multiple equilibria. This condition indicates that unique e…

2013-12-30abs ↗pdf ↗

Paper proposes a privacy-preserving method to control false discoveries.

problem Protecting individual information in hypothesis tests while controlling false discoveries.
method Differentially private adaptive FDR control method with privacy guarantee.
result The method controls the FDR metric exactly at a user-specified level with privacy.

New framework provides privacy guarantees for practical federated learning.

problem Inadequate privacy guarantees for federated learning due to restrictive assumptions.
method Fed-α\alpha-NormEC, integrating multiple local updates, partial client participation, and standard assumptions.
result Provably convergent and differentially private federated learning framework.

Differentially private hyperparameter tuning improves privacy in machine learning.

problem Hyperparameter tuning leaks private information through selected configurations.
method Local Bayesian optimization using Gaussian Process surrogate for private gradient approximation.
result DP-GIBO converges to locally optimal hyperparameters with polynomial dimensional dependence.

Private algorithms adapt from public to private domains with minimal labeled data.

problem Adapting from a public source domain to a private target domain with few labeled data.
method Differentially private discrepancy minimization algorithms based on Frank-Wolfe and Mirror-Descent methods.
result Effective adaptation with strong generalization and privacy guarantees.

DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.

problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.

EIGAN learns private representations without centralized data, outperforming state-of-the-art.

problem Private representation learning with multiple ally and adversary attributes.
method Exclusion-Inclusion Generative Adversarial Network (EIGAN) and Distributed EIGAN (D-EIGAN).
result EIGAN and D-EIGAN outperform state-of-the-art methods in accuracy and scalability.

Efficient FPGA virtualization for deep learning reduces user isolation and overhead.

problem Poor isolation and heavy re-compilation overhead in FPGA-based DNN accelerators.
method Two-level instruction dispatch module, multi-core hardware resources pool, tiling-based instruction frame package, two-stage static-dynamic compilation.
result 1.07-1.69x and 1.88-3.12x throughput improvement over previous designs.

New method for private linear regression under privacy constraints, achieving optimal rates.

problem Statistical complexity of private linear regression under unknown, ill-conditioned covariates.
method Information-Weighted Regression method
result Optimal convergence rates for both central and local privacy models.

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.

Differentially private random block coordinate descent improves utility in machine learning.

problem Lack of privacy in classical CD methods when handling sensitive information.
method Proposes a differentially private random block coordinate descent method using sketch matrices and importance sampling.
result Demonstrates improved convergence rates and utility guarantees compared to non-private methods.

SPLICE method disentangles shared and private latent variables from multi-view data.

problem Lack of methods to characterize nonlinear relationships and preserve geometric information in multi-view data.
method Neural network-based approach to infer disentangled, interpretable representations of shared and private latent variables.
result SPLICE yields more interpretable representations by preserving geometry and is more robust to incorrect latent dimensionality.

Private online FDR control for adaptive testing under differential privacy.

problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.

Improved differentially private deep learning with group-wise clipping techniques.

problem Efficiency and privacy trade-offs in deep learning models.
method Group-wise clipping techniques (per-layer and per-device) to reduce compute time and memory overhead.
result Private learning with group-wise clipping achieves similar or better performance than non-private learning with less wall time.

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.

We introduce a new class of context dependent, incomplete information games to serve as structured prediction models for settings with significant strategic interactions. Our games map the input context to outcomes by first condensing the input into private player types that specify the utilities, weighted interactions…

2019-05-29abs ↗pdf ↗

New DP bootstrap method for statistical inference with improved privacy and accuracy.

problem Lack of general techniques for conducting statistical inference under differential privacy.
method DP bootstrap procedure to infer sampling distribution and construct confidence intervals.
result DP bootstrap estimates provide consistent point estimates and asymptotically valid standard CIs.

We investigate the problem of nodes clustering under privacy constraints when representing a dataset as a graph. Our contribution is threefold. First we formally define the concept of differential privacy for structured databases such as graphs, and give an alternative definition based on a new neighborhood notion betw…

2018-01-19abs ↗pdf ↗

Due to massive amounts of data distributed across multiple locations, distributed machine learning has attracted a lot of research interests. Alternating Direction Method of Multipliers (ADMM) is a powerful method of designing distributed machine learning algorithm, whereby each agent computes over local datasets and e…

2019-01-07abs ↗pdf ↗

New algorithms for private generalized linear contextual bandits.

problem Private estimation and optimization for generalized linear models under differential privacy.
method Developed algorithms for stochastic and adversarial contexts under shuffle and joint differential privacy.
result Achieved private regret bounds for generalized linear models, differing from non-private rates by factors of d/ε\sqrt{d/\varepsilon} and d/ε\sqrt{d/\varepsilon} respectively.

We provide the first differentially private algorithms for controlling the false discovery rate (FDR) in multiple hypothesis testing, with essentially no loss in power under certain conditions. Our general approach is to adapt a well-known variant of the Benjamini-Hochberg procedure (BHq), making each step differential…

2015-11-12abs ↗pdf ↗

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.