Skip to content

Locally Private Inference for Riemannian Stochastic Optimization

Sep 2026 · 0 citations · 38 references
Mathematics Computer Science

TL;DR

The central limit theorem and consistency of the fully transcript-based sandwich covariance and intrinsic Wald region under local differential privacy are proved and the predicted decrease in estimation error and near-nominal coverage under moderate privacy is supported.

Abstract

We develop inference for manifold-valued population minimizers when each observation belongs to a different participant and only locally private messages reach the analyst. The method releases randomized tangent gradients and combines them through Riemannian stochastic approximation and Polyak-Ruppert averaging. Directly inserting a private data surrogate into a nonlinear loss can shift its population target, whereas conditional centring of the released gradient preserves the first-order equation. We introduce symmetric-pair regression (SPR) to estimate the asymptotic variance from the same private messages used for point estimation, without holding out participants or requesting a second release. We prove the central limit theorem and consistency of the fully transcript-based sandwich covariance and intrinsic Wald region under local differential privacy. Simulations across various statistical problems and manifolds support the predicted decrease in estimation error and near-nominal coverage under moderate privacy. An application to NHANES anthropometric data illustrates private estimation of a leading body-size direction and its uncertainty.

View source

Similar papers

Gradient Estimation for Mixture Variational Inference

This work provides an elementary derivation of a single-sample post-stratified estimator—previously derived via transport equations—and proves a variance reduction relative to simple random sampling, expanding the applicability of implicit reparameterization and reducing its computational complexity.

Javier Burroni, Daniel Sheldon · 0 citations
Open access Aug 2026

Projection-robust zeroth-order optimization on manifolds under heavy-tailed oracle noise

This work proposes PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation and establishes the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace.

Yin-Pu Ma, Cunlin Li, Shiyue Zhang · 0 citations
#machine learning Preprint Sep 2026

Riemannian Simultaneous Inference for Tangent Vector Field Regression

We consider nonparametric tangent vector field regression on a Riemannian manifold without boundary. Because responses at different points lie in different tangent spaces, the proposed kernel estimator first parallel transports nearby responses to the target tangent space and then forms a volume-corrected local average...

Xiao-Tian Chang, Yang-Di Jiang, Qi-Rui Hu · 0 citations
Preprint Sep 2026

Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances

This paper investigates the numerical resolution of the Beurling-LASSO (BLASSO), a convex optimization framework that promotes sparsity in the space of measures. We consider its application to the estimation of Gaussian mixture models (GMMs) with an unknown number of components and unknown diagonal covariance matrices....

Romane Giard, Y. de Castro, R. Denis et al. · 0 citations
Preprint Sep 2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Conformal-DRO is proposed, which uses nested conformal regions to construct an ambiguity set for the future latent law, which covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism.

Lu-Hao Zhang, Shi-Xiang Zhu · 1 citation
Preprint Aug 2026

Statistical Properties of Nonparametric MLE under Laplace Noise

This work studies the problem of estimating the distribution of the latent confidential data from the privatized observations via the nonparametric maximum likelihood estimator (NPMLE) under an i.i.d. sampling model, and shows that the NPMLE remains consistent when the Laplace noise grows at a rate slower than $n^{3/16...

Yifei Xiong, Nianqiao Ju, Vinayak A. Rao · 0 citations

Related blog posts

GPT-Lab Sep 3, 2026

Adaptive AI Agents in Construction Workflows

Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.