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

134268401535 · Jun 202019922001200920172026
48 results for private linear regression

Paper introduces data-dependent SSP for private linear and logistic regression.

problem Private linear and logistic regression with better performance.
method Data-dependent sufficient statistic perturbation (SSP) for linear and logistic regression.
result Data-dependent SSP outperforms state-of-the-art methods for linear and logistic regression.

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.

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.

Linear regression is an important tool across many fields that work with sensitive human-sourced data. Significant prior work has focused on producing differentially private point estimates, which provide a privacy guarantee to individuals while still allowing modelers to draw insights from data by estimating regressio…

2019-10-29abs ↗pdf ↗

Proposes a method for differentially private linear regression and synthetic data generation.

problem Lack of valid inference and synthetic data generation methods for small-scale datasets in privacy-aware settings.
method Gaussian differentially private linear regression with bias-corrected estimator and SDG procedure.
result Improves accuracy and provides valid confidence intervals for downstream tasks.

Improved linear regression with privacy and robustness guarantees.

problem Private and robust linear regression with adversarial corruption.
method Differentially private stochastic gradient descent with full-batch gradient descent and adaptive clipping.
result Near optimal sample complexity for both private and robust linear regression.

This paper achieves optimal regret bounds for locally private linear contextual bandit.

problem Designing locally private linear contextual bandit algorithms with optimal regret bounds.
method New algorithmic and analytical ideas, including mean absolute deviation analysis and layered principal component regression.
result Achieves an ildeO(T) ilde O(\sqrt{T}) regret upper bound for locally private linear contextual bandit.

The paper tests the credibility of public and private surveys using linear regression and differential privacy.

problem Ensuring the validity of data analysis results from sample surveys using linear regression.
method Designing an algorithm to test the credibility of surveys and extending it to handle LDP.
result The algorithm achieves optimal estimation error bound for 1\ell_1 linear regression and reduces sample complexity.

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.

Efficiently estimates private least squares with linear error growth.

problem Private estimation of ordinary least squares with bounded residuals and leverage.
method Scaled noise added to a stable nonprivate estimator of the regression vector.
result Near-optimal accuracy guarantee with linear error growth in dimension.

Study differentially private linear regression with heavy-tailed data.

problem Differentially private 1\ell_1-norm linear regression with heavy-tailed data.
method Exponential mechanism for 2\ell_2-norm bounded second moment; relaxation to 2\ell_2-norm bounded θθ-th moment; coordinate-wise bounded moments.
result Achieved upper bounds for privacy-preserving linear regression under various moment conditions.

Differential privacy for simple linear regression protects small datasets from individual data leaks.

problem Protecting sensitive personal information in small datasets from individual data leaks.
method Differential privacy algorithms for simple linear regression tailored for small datasets (tens to hundreds of datapoints).
result Robust estimators like Theil-Sen perform well on small datasets, but standard algorithms improve as dataset size increases.

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).

New method improves privacy in linear regression with optimal error bounds.

problem Differentially private linear regression with suboptimal error bounds.
method One-pass mini-batch stochastic gradient descent (DP-AMBSSGD) with adaptive clipping.
result Nearly optimal error bounds in terms of key parameters like dimensionality, number of points, and noise standard deviation.

Study extends learnability equivalence to multi-class and regression, overcoming binary classification limits.

problem Equivalence of online and private learnability in multi-class and regression settings.
method Introduced a novel Littlestone dimension variant and threshold functions for multi-class classification.
result Online learnability implies private learnability in multi-class classification but not in regression.

New private learning algorithms improve utility in tasks with public features.

problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.

Improved privacy-preserving linear regression via iterative Hessian mixing.

problem Differentially private linear regression with improved accuracy and efficiency.
method Iterative Hessian Mixing (IHM) for differentially private ordinary least squares (DP-OLS).
result IHM provides better utility guarantees and outperforms AdaSSP in empirical evaluations.

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.

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.

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…

2017-01-04abs ↗pdf ↗

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.

In this paper, we consider the problem of preserving privacy in the online learning setting. We study the problem in the online convex programming (OCP) framework---a popular online learning setting with several interesting theoretical and practical implications---while using differential privacy as the formal privacy …

2011-09-01abs ↗pdf ↗

Optimal DP-GD achieves high-dimensional linear regression risk.

problem Differentially private linear regression in high-dimensional settings.
method One-pass DP gradient descent (DP-GD) with gradient clipping and decaying learning rate.
result Achieves optimal non-asymptotic risk of O(γ+γ2/ρ2)O(γ+ γ^2 / ρ^2) for well-conditioned 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 explores differential privacy in high-dimensional federated learning, tackling server trustworthiness and estimation.

problem Maintaining privacy in distributed environments with high-dimensional data.
method Investigates scenarios with untrusted and trusted central servers, introduces novel federated estimation algorithms for linear regression models.
result Tight minimax rates depend on high-dimensionality even with sparsity assumptions, and novel algorithms handle slight variations among distributed models.

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.