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

76153229305 · Jun 202019922001200920172026
48 results for private values

Hypothesis tests are a crucial statistical tool for data mining and are the workhorse of scientific research in many fields. Here we present a differentially private analogue of the classic Wilcoxon signed-rank hypothesis test, which is used when comparing sets of paired (e.g., before-and-after) data values. We present…

2018-09-05abs ↗pdf ↗

New algorithm learns regression models privately under growth condition.

problem Private learning of nonparametric regression models.
method Novel filtering procedure to output stable hypotheses for nonparametric function classes.
result Established first nonparametric private learnability guarantee for diverging fat shattering dimensions.

Two private algorithms improve domain adaptation with privacy guarantees.

problem Improving predictions for a private target domain using public data.
method Two (ε,δ)(ε, δ)-differentially private algorithms for supervised domain adaptation.
result Private algorithms maintain performance close to non-private versions.

Differentially Private algorithms often need to select the best amongst many candidate options. Classical works on this selection problem require that the candidates' goodness, measured as a real-valued score function, does not change by much when one person's data changes. In many applications such as hyperparameter o…

2018-11-19abs ↗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.

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 ↗

Algorithm ensures privacy while strictly adhering to constraints.

problem Differential privacy with linear constraints that must be strictly followed.
method Developed an algorithm that releases a nearly-optimal solution satisfying constraints with probability 1.
result Achieved nearly optimal performance while preserving privacy and strictly adhering to constraints.

New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.

problem Rational actors will deploy AGI despite negative social value due to shared catastrophic risk.
method Continuous-time preemption game with shared catastrophic externalities, showing suicide region and welfare distortion.
result The suicide region widens as catastrophic risk grows, and two mechanisms can close it.

New method for differentially private optimization with general Lipschitz conditions.

problem Differentially private optimization under general Lipschitz conditions.
method Generalized Lipschitz condition for per-sample gradients, tuning clip norm based on minimum per-sample Lipschitz constant.
result Efficacy of the recommended clip norm tuning method verified on 8 datasets.

Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…

2018-06-06abs ↗pdf ↗

Study of public and private VC relationships in France using qualitative methods.

problem Understanding interactions between public and private venture capitalists in France.
method Qualitative approach with semi-structured interviews and thematic content analysis.
result Formal or informal relationships between public and private VCs are a 'economico-cognitive' approach to networking and innovation.

Expands differential privacy mechanisms to include the Generalized Gaussian mechanism for improved private machine learning.

problem Improving privacy in machine learning algorithms while maintaining utility.
method Introduces and analyzes the Generalized Gaussian (GG) mechanism for differential privacy.
result The GG mechanism provides better performance than the Laplace and Gaussian mechanisms across various values of β.

Paper explores how non-neural simulators can enhance DP synthetic data generation.

problem Generating differentially private synthetic data without access to foundation models.
method Private Evolution (PE) framework using inference APIs and simulators.
result Sim-PE framework improves downstream classification accuracy and FID scores.

We extend Kyle's model to include stochastic liquidity and multiple assets.

problem Modeling informed trading with stochastic liquidity and multiple assets.
method Developed a variational formulation and derived a matrix-valued martingale depth process.
result A linear-Gaussian equilibrium with stochastic matrix-valued price impact.

We formulate a private learning model to study an intrinsic tradeoff between privacy and query complexity in sequential learning. Our model involves a learner who aims to determine a scalar value, vv^*, by sequentially querying an external database and receiving binary responses. In the meantime, an adversary observes…

2018-05-06abs ↗pdf ↗

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 algorithms minimize regret in repeated auctions by estimating values and optimizing bids.

problem Minimizing regret in repeated first-price auctions with limited feedback.
method Incorporates causal inference to estimate private values and optimize bidding strategies under different feedback types.
result Achieves near-optimal regret bounds for both full and binary feedback types.

This paper proposes a joint energy and data market to handle uncertainty in energy procurement.

problem Handling uncertainty in energy markets through data markets.
method Modeling a day-ahead retailer energy procurement problem with uncertain demand, integrating forecasting and optimisation, and using differential privacy.
result The value of joint energy and data clearing is highlighted through numerical case studies.

This paper proposes methods to compute differentially private confidence intervals for the median.

problem Ensuring privacy in statistical inference for the median.
method Directly estimating interval bounds for the median under differential privacy constraints.
result The proposed methods provide valid differentially private confidence intervals for the median.

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.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Paper develops DP methods for low-rank matrix estimation with near-optimal performance.

problem Estimating a low-rank matrix under differential privacy constraints.
method Introduced computationally efficient DP-initialization and Riemannian optimization-based DP-RGrad algorithm.
result DP-RGrad achieves near-optimal convergence rate under weak differential privacy constraints.

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.

Improved Frank-Wolfe algorithm speeds up training of differentially private LASSO models.

problem Training differentially private LASSO models on sparse data.
method Adapted Frank-Wolfe algorithm for sparse inputs, reducing runtime.
result Training time reduced from O(TDS+TNs)\mathcal{O}(TDS + TNs) to O(NS+TDlogD+TS2)\mathcal{O}(N S + T \sqrt{D} \log{D} + TS^2).

Hypothesis testing is one of the most common types of data analysis and forms the backbone of scientific research in many disciplines. Analysis of variance (ANOVA) in particular is used to detect dependence between a categorical and a numerical variable. Here we show how one can carry out this hypothesis test under the…

2019-03-01abs ↗pdf ↗

Traders in a market typically have widely different, private information on the return of an asset. The equilibrium price of the asset may reflect this information more accurately if the number of traders is large enough compared to the number of the states of the world that determine the return of the asset. We study …

2001-01-23abs ↗pdf ↗

Study factors affecting liquidity on decentralized exchanges, introducing new metrics.

problem Understanding and predicting liquidity on decentralized exchanges (DEXs).
method Analyzes platform, blockchain, token pair, and liquidity pool factors; introduces new metrics.
result Identifies how various factors affect liquidity through concentration and total value locked.

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.

Differential privacy has emerged as a gold standard in privacy-preserving data analysis. A popular variant is local differential privacy, where the data holder is the trusted curator. A major barrier, however, towards a wider adoption of this model is that it offers a poor privacy-utility tradeoff. In this work, we add…

2019-01-21abs ↗pdf ↗

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.