Statistical Inference on Gradient Flows

• URL: http://arxiv.org/abs/2606.01257v1
• Date: Sun, 31 May 2026 14:22:37 GMT
• Title: Statistical Inference on Gradient Flows
• Abstract summary: We develop a theory for time-uniform statistical inference on gradient flows arising from empirical risk minimization.<n>We introduce an algorithm-aware covariance estimator that evolves jointly with the gradient flow and avoids matrix inversion, resampling, or sample splitting.<n>Our results connect optimization dynamics with statistical inference and provide practical tools for uncertainty quantification in gradient-based methods.
• Score: 46.05870703588429
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gradient-based algorithms are central to modern statistical estimation, yet their statistical analysis is often restricted to fixed-time behavior, such as convergence to a population target or fluctuations at a prescribed iteration. In many applications, however, uncertainty quantification is needed along the entire optimization path, especially when the stopping time is data-dependent or divergent. In this paper, we develop a theory for time-uniform statistical inference on gradient flows arising from empirical risk minimization. We prove a uniform central limit theorem that characterizes the deviation between empirical and population gradient flows as a continuous-time Gaussian process over the entire nonnegative real line. Building on this result, we introduce an algorithm-aware covariance estimator that evolves jointly with the gradient flow and avoids matrix inversion, resampling, or sample splitting. We show that the covariance estimator is uniformly consistent over time and use it to construct confidence intervals for the target parameter with asymptotically valid coverage. Our results connect optimization dynamics with statistical inference and provide practical tools for uncertainty quantification in gradient-based methods.

Related papers

• Statistical Inference for Stochastic Gradient Descent Beyond Finite Variance [10.36372217426986]
  gradient descent (SGD) is a foundational algorithm for large-scale statistical learning and optimization.<n>We develop an efficient, model-agnostic methodology for constructing confidence regions from SGD trajectories.
  arXiv  Detail & Related papers  (2026-05-25T16:18:39Z)
• Fréchet regression of multivariate distributions with nonparanormal transport [5.388168357866664]
  We introduce a new regression approach for multivariate distributional responses, in which distributions are modeled within the semi nonparanormal family.<n>We provide theoretical justification for NPT, establishing its topological equivalence to the Wasserstein distance and proving that it mitigates the curse of dimensionality.<n>The utility of our method is demonstrated via simulations and an application to continuous glucose monitoring data.
  arXiv  Detail & Related papers  (2026-03-07T03:21:12Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Debiased Nonparametric Regression for Statistical Inference and Distributionally Robustness [10.470114319701576]
  We introduce a model-free debiasing method for smooth nonparametric regression estimators.<n>We obtain a debiased estimator that satisfies pointwise and uniform risk convergence, along with smoothness, under mild conditions.
  arXiv  Detail & Related papers  (2024-12-28T15:01:19Z)
• Statistical Inference for Temporal Difference Learning with Linear Function Approximation [55.80276145563105]
  We investigate the statistical properties of Temporal Difference learning with Polyak-Ruppert averaging.<n>We make three theoretical contributions that improve upon the current state-of-the-art results.
  arXiv  Detail & Related papers  (2024-10-21T15:34:44Z)
• Statistical Inference in Tensor Completion: Optimal Uncertainty Quantification and Statistical-to-Computational Gaps [7.174572371800217]
  This paper presents a simple yet efficient method for statistical inference of tensor linear forms using incomplete and noisy observations. It is suitable for various statistical inference tasks, including constructing confidence intervals, inference under heteroskedastic and sub-exponential noise, and simultaneous testing.
  arXiv  Detail & Related papers  (2024-10-15T03:09:52Z)
• Kinetic Interacting Particle Langevin Monte Carlo [0.0]
  This paper introduces and analyses interacting underdamped Langevin algorithms, for statistical inference in latent variable models. We propose a diffusion process that evolves jointly in the space of parameters and latent variables. We provide two explicit discretisations of this diffusion as practical algorithms to estimate parameters of statistical models.
  arXiv  Detail & Related papers  (2024-07-08T09:52:46Z)
• Semi-Parametric Inference for Doubly Stochastic Spatial Point Processes: An Approximate Penalized Poisson Likelihood Approach [3.085995273374333]
  Doubly-stochastic point processes model the occurrence of events over a spatial domain as an inhomogeneous process conditioned on the realization of a random intensity function. Existing implementations of doubly-stochastic spatial models are computationally demanding, often have limited theoretical guarantee, and/or rely on restrictive assumptions.
  arXiv  Detail & Related papers  (2023-06-11T19:48:39Z)
• Statistical Efficiency of Score Matching: The View from Isoperimetry [96.65637602827942]
  We show a tight connection between statistical efficiency of score matching and the isoperimetric properties of the distribution being estimated. We formalize these results both in the sample regime and in the finite regime.
  arXiv  Detail & Related papers  (2022-10-03T06:09:01Z)
• Heavy-tailed Streaming Statistical Estimation [58.70341336199497]
  We consider the task of heavy-tailed statistical estimation given streaming $p$ samples. We design a clipped gradient descent and provide an improved analysis under a more nuanced condition on the noise of gradients.
  arXiv  Detail & Related papers  (2021-08-25T21:30:27Z)
• Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods [8.890430804063705]
  We first present the distribution for the Polyak-Ruppert-averaging type Kiefer-Wolfowitz (AKW) estimators. The distributional result reflects the trade-off between statistical efficiency and function query complexity.
  arXiv  Detail & Related papers  (2021-02-05T19:22:41Z)
• Instability, Computational Efficiency and Statistical Accuracy [101.32305022521024]
  We develop a framework that yields statistical accuracy based on interplay between the deterministic convergence rate of the algorithm at the population level, and its degree of (instability) when applied to an empirical object based on $n$ samples. We provide applications of our general results to several concrete classes of models, including Gaussian mixture estimation, non-linear regression models, and informative non-response models.
  arXiv  Detail & Related papers  (2020-05-22T22:30:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.