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

3416811,0221,362 · Jun 202019922001200920172026
48 results for private data analysis

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.

The paper proposes differentially private sliced inverse regression algorithms for high-dimensional data.

problem Privacy concerns in high-dimensional data analysis.
method Differentially private sliced inverse regression algorithms designed for privacy preservation.
result Achieves minimax lower bounds up to logarithmic factors.

The paper analyzes a private likelihood-ratio test for frequency tables under differential privacy constraints.

problem Achieving privacy in statistical data analysis while maintaining statistical utility.
method A rigorous analysis of a private likelihood-ratio (LR) test for goodness-of-fit in frequency tables, considering (ε,δ)(\varepsilon,δ)-differential privacy.
result Characterization of the trade-off between differential privacy parameters (ε,δ)(\varepsilon,δ) and statistical power of the private LR test.

The study of private inference has been sparked by growing concern regarding the analysis of data when it stems from sensitive sources. We present the first method for private Bayesian inference in exponential families that properly accounts for noise introduced by the privacy mechanism. It is efficient because it work…

2018-09-06abs ↗pdf ↗

Locally private methods detect changes in time series data.

problem Detecting distributional changes in time series data under local differential privacy.
method Proposed locally differentially private algorithms based on randomized response and binary mechanisms.
result Theoretical performance bounds and empirical validation of detection accuracy.

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.

Novel privatization framework for high-dimensional variable selection with differential privacy.

problem High-dimensional controlled variable selection with rigorous FDR control under differential privacy constraints.
method Gaussian Johnson-Lindenstrauss Transformation for privatizing the knockoff matrix.
result The proposed private variable selection procedure maintains statistical power even under strict privacy budgets.

Algorithm selects public datasets for private machine learning.

problem Choosing the most suitable public dataset for private machine learning.
method Measures gradient subspace distance between public and private datasets.
result Excess risk scales with the subspace distance between gradients.

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.

Study private submodular maximization in streaming data.

problem Private maximization of submodular functions in streaming data.
method Established differentially private baselines and derived better trade-offs for decomposable submodular functions.
result Improved trade-offs between privacy and utility for decomposable submodular functions.

New method generates private synthetic data with optimal utility for smooth queries.

problem Achieving strong utility guarantees for meaningful downstream analysis of sensitive datasets.
method Proposes a polynomial-time algorithm for generating (ε,δ)(\varepsilon,δ)-differentially private synthetic data with minimax optimal error rates for smooth queries.
result Achieves a minimax error rate of Ok,d(nmin{1,kd})O_{k,d}(n^{-\min \{1, \frac{k}{d}\}}) for kk-smooth queries, up to a log(n)\log(n) factor.

The paper proposes methods to infer from privacy-protected data using simulation-based techniques.

problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.

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.

Paper analyzes InstaHide's security, recovering all private images with provable guarantee.

problem Protecting privacy of training data in neural networks.
method Unified framework to understand and analyze attacks on InstaHide, presenting a new algorithm to recover all private images with provable guarantee.
result InstaHide is computationally secure but not information-theoretically secure when mixing two private images.

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.

Multi-modal data collections, such as corpora of paired images and text snippets, require analysis methods beyond single-view component and topic models. For continuous observations the current dominant approach is based on extensions of canonical correlation analysis, factorizing the variation into components shared b…

2012-10-16abs ↗pdf ↗

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 ↗

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 ↗

Private CI tests for continuous Z with privacy constraints.

problem Testing conditional independence under differential privacy constraints.
method Developed two private CI testing procedures based on generalized covariance and conditional randomization tests.
result First private CI tests with rigorous theoretical guarantees for continuous Z.

Study differentially private methods for learning Hawkes processes.

problem Lack of thorough analysis on sample complexity for learning Hawkes processes parameters and releasing differentially private versions.
method Developed non-private and differentially private estimators for Hawkes processes parameters.
result Obtained sample complexity results for both private and non-private settings.

Study shows privacy and utility trade-offs in synthetic data models, impacting fairness and real-world performance.

problem Understanding the impact of differential privacy on fairness and model performance in synthetic data.
method Systematic analysis of differentially private synthetic datasets on classification models, measuring utility and bias using fairness metrics.
result More privacy does not necessarily mean more bias, but it can affect model performance when deployed on real data.

Paper proposes differentially private quantile regression for high-dimensional data.

problem Privacy concerns in big data with heterogeneous sensitive personal information.
method Newton-type transformation for reformulating quantile regression into an OLS problem; iterative updates for estimation; debiased estimator for inference; communication-efficient bootstrap.
result Near-optimal statistical accuracy and formal privacy guarantees achieved.

Paper presents a faster method for computing cost of equity and performing comparable company analysis.

problem Tedium and subjectivity in traditional cost of equity and comparable company analysis methods.
method Uses spectral and agglomerative clustering to compute cost of equity and perform comparable company analysis.
result Reduces time required for comps by orders of magnitude and improves consistency and reliability.

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.

Many commonly used learning algorithms work by iteratively updating an intermediate solution using one or a few data points in each iteration. Analysis of differential privacy for such algorithms often involves ensuring privacy of each step and then reasoning about the cumulative privacy cost of the algorithm. This is …

2018-08-20abs ↗pdf ↗

DP-SGD analysis shows many datapoints leak less privacy than previously thought.

problem Empirical evidence suggests DP-SGD leaks less privacy than current analysis predicts.
method Developed a per-instance DP analysis of DP-SGD, introducing dependence on dataset distribution.
result Formally shows DP-SGD leaks significantly less privacy for many datapoints on common benchmarks.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.