Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0612258

Error structures and parameter estimation

Nicolas Bouleau·Christophe Chorro
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article proposes a link between statistics and the theory of Dirichlet forms used to compute errors. The error calculus based on Dirichlet forms is an extension of classical Gauss' approach to error propagation. The aim of this paper is to derive error structures from measurements. The links with Fisher's information lay the foundations of a strong connection with experiment. We show that this connection behaves well towards changes of variables and is related to the theory of asymptotic statistics.

Explore related subjects

math.STmath.FAmath.PRstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Bouleau, Christophe Chorro. 2006-12-10. Error structures and parameter estimation. https://arxiv.org/abs/math/0612258

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Universality of Non-Separable Approximate Message Passing Algorithms

Mean-field characterizations of first-order iterative algorithms -- including Approximate Message Passing (AMP), stochastic and proximal gradient descent, and Langevin diffusions -- have enabled a precise understanding of learning dynamics in many statistical applications. For algorithms whose non-linearities have a coordinate-separable form, it is known that such characterizations enjoy a degree of universality with respect to the underlying data distribution. However, mean-field characterizations of non-separable algorithm dynamics have largely remained restricted to i.i.d. Gaussian or rotationally-invariant data. In this work, we initiate a study of universality for non-separable AMP algorithms. We identify a general condition for AMP with polynomial non-linearities, in terms of a Bounded Composition Property (BCP) for their representing tensors, to admit a state evolution that holds universally for matrices with non-Gaussian entries. We then formalize a condition of BCP-approximability for Lipschitz AMP algorithms to enjoy a similar universal guarantee. We demonstrate that many common classes of non-separable non-linearities are BCP-approximable, including local denoisers, spectral denoisers for generic signals, and compositions of separable functions with generic linear maps, implying the universality of state evolution for AMP algorithms employing these non-linearities.

math.ST↗
arXiv2026

Graphon-Level Bayesian Predictive Synthesis for Random Network

Analysts often fit several models to the same network. Each estimates a graphon, the function giving the probability of a link between two nodes. Reporting one predictive graphon means weighting these estimates, and the weights can be constrained in several ways. We determine which constraint is correct and when the combination improves on the best single model. We introduce Bayesian predictive synthesis at the graphon level. The models enter as agents, a prior is placed on the weights combining their link probabilities, and the posterior returns one predictive graphon with credible intervals. We study this rule when the network is a union of overlapping mechanisms, so a pair is linked if at least one mechanism links it. Weights forced to sum to one cannot reproduce a union. Free and nonnegative weights do far better and do equally well. A noisy-OR rule matches the union exactly. From one observed graph we give an exact variance formula for the fitted weights, and the usual credible intervals are too narrow. On polblogs, email-Eu-core, Cora, ca-GrQc, wiki-Vote and soc-Epinions1, combining adds under one percent once a flaw in the usual benchmark is corrected, and a larger single model often wins. On the Amazon and YouTube multiplex networks, where the layers are recorded separately, it beats every competitor we tuned, including spectral estimation, blockmodels, random forests and node2vec.

math.ST↗
arXiv2026

Local increment inference for time-inhomogeneous drift in Gaussian processes

We study statistical inference for deterministic drifts in Gaussian process models under high-frequency observations over an expanding time horizon. Using a least squares-type contrast based on first-order increments, we establish consistency and asymptotic normality under conditions on drift accumulation and increment dependence.A key feature is that the convergence rate is determined jointly by the deterministic signal and the full covariance structure of the weighted Gaussian increments, rather than by local noise roughness alone.For power and fixed-frequency periodic drifts under Gaussian and Ornstein-Uhlenbeck covariance kernels, we derive explicit convergence rates and limiting variances, revealing distinct regimes depending on the drift structure and, for periodic drifts, the noise spectrum. These results clarify the respective roles of sampling frequency and observation horizon.

math.ST↗