Finite-Shot Sensitivity for Moment Estimation in Quantum Metrology

• URL: http://arxiv.org/abs/2606.25920v1
• Date: Wed, 24 Jun 2026 15:01:01 GMT
• Title: Finite-Shot Sensitivity for Moment Estimation in Quantum Metrology
• Abstract summary: We develop a finite-measurement theory for method-of-moments estimation.<n>We identify a general density-matrix condition under which the full $1/2$ correction vanishes.<n>The resulting thresholds quantify how many measurements are needed before the sensitivity of a moment- protocol protocol is operationally visible.
• Score: 3.5426941871022373
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The quantum Cramér-Rao bound can be saturated only asymptotically and does not specify how many measurements are needed for a concrete estimator to approach it. We develop a finite-measurement theory for method-of-moments estimation, where the parameter is inferred from the sample mean of a calibrating observable rather than from the full likelihood. For general quantum statistical models, the expansion is written in terms of the calibration curve and the central moments of the measured observable. Nonlinear calibration curves make the usual moment estimator biased at finite measurement number; we construct a bias-corrected estimator with bias $O(ν^{-3})$. This gives sensitivity corrections beyond the leading error-propagation term of the chosen moment protocol. We identify a general density-matrix condition under which the full $1/ν^2$ correction vanishes. In unitary examples, the leading residual correction appears at order $1/ν^3$, is governed by calibration curvature, and can be reduced or cancelled by higher-rank components of the same measured observable. The resulting thresholds quantify how many measurements are needed before the asymptotic sensitivity of a moment-estimation protocol is operationally visible.

Related papers

• Measuring multi-calibration [9.514997419494993]
  When predicted probabilities are perfectly calibrated simultaneously across several subpopulations, the predictions are known as "perfectly multi-calibrated"<n>A recently proposed metric for calibration, based on the classical Kuiper statistic, is a natural basis for a new metric of multi-calibration.
  arXiv  Detail & Related papers  (2025-06-12T19:48:10Z)
• Orthogonal Causal Calibration [55.28164682911196]
  We develop general algorithms for reducing the task of causal calibration to that of calibrating a standard (non-causal) predictive model.<n>Our results are exceedingly general, showing that essentially any existing calibration algorithm can be used in causal settings.
  arXiv  Detail & Related papers  (2024-06-04T03:35:25Z)
• Calibrated Uncertainty Quantification for Operator Learning via Conformal Prediction [95.75771195913046]
  We propose a risk-controlling quantile neural operator, a distribution-free, finite-sample functional calibration conformal prediction method. We provide a theoretical calibration guarantee on the coverage rate, defined as the expected percentage of points on the function domain. Empirical results on a 2D Darcy flow and a 3D car surface pressure prediction task validate our theoretical results.
  arXiv  Detail & Related papers  (2024-02-02T23:43:28Z)
• Consistent and Asymptotically Unbiased Estimation of Proper Calibration Errors [23.819464242327257]
  We propose a method that allows consistent estimation of all proper calibration errors and refinement terms. We prove the relation between refinement and f-divergences, which implies information monotonicity in neural networks. Our experiments validate the claimed properties of the proposed estimator and suggest that the selection of a post-hoc calibration method should be determined by the particular calibration error of interest.
  arXiv  Detail & Related papers  (2023-12-14T01:20:08Z)
• Calibration by Distribution Matching: Trainable Kernel Calibration Metrics [56.629245030893685]
  We introduce kernel-based calibration metrics that unify and generalize popular forms of calibration for both classification and regression. These metrics admit differentiable sample estimates, making it easy to incorporate a calibration objective into empirical risk minimization. We provide intuitive mechanisms to tailor calibration metrics to a decision task, and enforce accurate loss estimation and no regret decisions.
  arXiv  Detail & Related papers  (2023-10-31T06:19:40Z)
• A Unifying Theory of Distance from Calibration [9.959025631339982]
  There is no consensus on how to quantify the distance from perfect calibration. We propose a ground-truth notion of distance from calibration, inspired by the literature on property testing. Applying our framework, we identify three calibration measures that are consistent and can be estimated efficiently.
  arXiv  Detail & Related papers  (2022-11-30T10:38:24Z)
• A Consistent and Differentiable Lp Canonical Calibration Error Estimator [21.67616079217758]
  Deep neural networks are poorly calibrated and tend to output overconfident predictions. We propose a low-bias, trainable calibration error estimator based on Dirichlet kernel density estimates. Our method has a natural choice of kernel, and can be used to generate consistent estimates of other quantities.
  arXiv  Detail & Related papers  (2022-10-13T15:11:11Z)
• Parametric and Multivariate Uncertainty Calibration for Regression and Object Detection [4.630093015127541]
  We show that common detection models overestimate the spatial uncertainty in comparison to the observed error. Our experiments show that the simple Isotonic Regression recalibration method is sufficient to achieve a good calibrated uncertainty. In contrast, if normal distributions are required for subsequent processes, our GP-Normal recalibration method yields the best results.
  arXiv  Detail & Related papers  (2022-07-04T08:00:20Z)
• T-Cal: An optimal test for the calibration of predictive models [49.11538724574202]
  We consider detecting mis-calibration of predictive models using a finite validation dataset as a hypothesis testing problem. detecting mis-calibration is only possible when the conditional probabilities of the classes are sufficiently smooth functions of the predictions. We propose T-Cal, a minimax test for calibration based on a de-biased plug-in estimator of the $ell$-Expected Error (ECE)
  arXiv  Detail & Related papers  (2022-03-03T16:58:54Z)
• Near-optimal inference in adaptive linear regression [60.08422051718195]
  Even simple methods like least squares can exhibit non-normal behavior when data is collected in an adaptive manner. We propose a family of online debiasing estimators to correct these distributional anomalies in at least squares estimation. We demonstrate the usefulness of our theory via applications to multi-armed bandit, autoregressive time series estimation, and active learning with exploration.
  arXiv  Detail & Related papers  (2021-07-05T21:05:11Z)
• Localized Calibration: Metrics and Recalibration [133.07044916594361]
  We propose a fine-grained calibration metric that spans the gap between fully global and fully individualized calibration. We then introduce a localized recalibration method, LoRe, that improves the LCE better than existing recalibration methods.
  arXiv  Detail & Related papers  (2021-02-22T07:22:12Z)

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.