Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 20 min ago
PreprintCC BY 4.0arXiv

Self-Normalized Inference from Riemannian Stochastic Gradient Paths

Abstract

Riemannian stochastic gradient paths estimate constrained parameters, but confidence regions usually require estimating the Hessian and gradient-noise covariance. We develop self-normalized inference from one path by expressing retained iterates in a common random tangent space. Their average and centered partial sums share an unknown covariance factor that cancels in a Brownian bridge pivot. Under suitable regularity conditions, a joint expansion of the averaged estimator and integrated path controls nonlinear coordinate errors using conditional second moments. The procedure uses fixed-dimensional memory and extends to nondegenerate smooth functionals and alternative local coordinates. Numerical studies show competitive coverage relative to plug-in Wald inference while avoiding Hessian and residual-density estimation.

Related

  1. Online Covariance Estimation for Averaged Stochastic Gradient Descent on Riemannian Manifolds
    Jingrong Guan, Liwei Jiang, Sen Na
    arXivPreprintCC BY 4.0Full textOptimisation & controlStatisticsarXiv
  2. Locally Private Inference for Riemannian Stochastic Optimization
    Xiaotian Chang, Yangdi Jiang, Qirui Hu
    arXivPreprintCC BY-SA 4.0Full textOptimisation & controlStatisticsarXiv
  3. Lower Bounds on Inference Complexity for Polyak-Ruppert Averaged Stochastic Gradient Descent
    Denis Belomestny, Alexey Naumov, Sergey Samsonov
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  4. Scalable Statistical Inference in Stochastic Gradient Descent
    Rahul Singh, Abhinek Shukla
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Finite volume discretization and normalized gradient flow for computing minimizers of the rotating Gross-Pitaevskii energy
    Quentin Chauleur, Guillaume Dujardin, Robin Roussel
    HALPreprintCC BY 4.0Full textNumerical analysis & scientific computingHALarXiv
BibTeX
@misc{chang2026selfnormalized,
  title = {{Self-Normalized Inference from Riemannian Stochastic Gradient Paths}},
  author = {Xiaotian Chang and Qirui Hu and Yi Liu},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01035},
  eprint = {2611.01035},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01035},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Self-Normalized Inference from Riemannian Stochastic Gradient Paths
AU  - Xiaotian Chang
AU  - Qirui Hu
AU  - Yi Liu
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01035
UR  - https://arxiv.org/abs/2611.01035
AB  - Riemannian stochastic gradient paths estimate constrained parameters, but confidence regions usually require estimating the Hessian and gradient-noise covariance. We develop self-normalized inference from one path by expressing retained iterates in a common random tangent space. Their average and centered partial sums share an unknown covariance factor that cancels in a Brownian bridge pivot. Under suitable regularity conditions, a joint expansion of the averaged estimator and integrated path controls nonlinear coordinate errors using conditional second moments. The procedure uses fixed-dimensional memory and extends to nondegenerate smooth functionals and alternative local coordinates. Numerical studies show competitive coverage relative to plug-in Wald inference while avoiding Hessian and residual-density estimation.
ER  -