Spectral Minimax Direct Fidelity Estimation for Generic Target States

• URL: http://arxiv.org/abs/2605.01438v1
• Date: Sat, 02 May 2026 13:21:41 GMT
• Title: Spectral Minimax Direct Fidelity Estimation for Generic Target States
• Abstract summary: We propose an exact spectral replacement for arbitrary target states under the same non-adaptive single-copy measurement model.<n>We characterize unbiased linear estimators by a single operator identity, determine the state-wise optimal sampling law for fixed reconstruction coefficients, and convert the exact minimax problem into a semidefinite program.
• Score: 5.706918315850497
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Direct fidelity estimation benefits from tailoring measurements to a fixed target, but the operator-aware shadow importance sampling (OASIS) method optimizes an outcome-wise linear-program surrogate rather than the exact worst-case variance over physical states. We propose an exact spectral replacement for arbitrary target states under the same non-adaptive single-copy measurement model. Specifically, we characterize unbiased linear estimators by a single operator identity, determine the state-wise optimal sampling law for fixed reconstruction coefficients, and convert the exact minimax problem into a semidefinite program. The resulting offline design and online estimator are presented as an algorithm and implemented with local Pauli measurements. Numerical simulations under depolarizing noise demonstrate that our exact spectral optimization outperforms the OASIS surrogate in terms of estimation variance.

Related papers

• The Regularization Parameter: Sparse Precision Matrix Estimation [1.3532832187980637]
  Sparse precision matrix estimation provides an efficient framework for modeling conditional dependencies in high-dimensional, low-sample-size data.<n>A recurring challenge is appropriately selecting the regularization parameter that controls estimator sparsity.<n>We propose a closed-form, matrix-valued regularization parameter derived from the sampling distribution of the first-order optimality conditions.
  arXiv  Detail & Related papers  (2026-07-07T13:19:19Z)
• Revisiting Zeroth-Order Hessian Approximation: A Single-Step Policy Optimization Lens [18.253856190297405]
  ZoVH is a suite of variance-reduced estimators for the full Hessian matrix, its regularized inverse, and the bias-corrected inverse Hessian-gradient product.<n>We show that ZoVH achieves superior estimation accuracy and convergence performance in real-world applications.
  arXiv  Detail & Related papers  (2026-05-29T07:55:57Z)
• Optimal Estimation in Orthogonally Invariant Generalized Linear Models: Spectral Initialization and Approximate Message Passing [36.35215381372567]
  This paper proposes optimal spectral estimators and an approximate message passing (AMP) algorithm.<n>Building on the paradigm of spectrally-d iterative optimization, this paper proposes optimal spectral estimators and an approximate message passing (AMP) algorithm.
  arXiv  Detail & Related papers  (2026-02-09T22:08:09Z)
• On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization [57.179679246370114]
  A potential limitation of existing methods is the bias inherent in most perturbation estimators unless a stepsize is proposed.<n>We propose a novel family of unbiased gradient scaling estimators that eliminate bias while maintaining favorable construction.
  arXiv  Detail & Related papers  (2025-10-22T18:25:43Z)
• Near-optimal Rank Adaptive Inference of High Dimensional Matrices [46.66027208538566]
  We address the problem of estimating a high-dimensional matrix from linear measurements.<n>We propose an algorithm that combines a Least-Squares estimator with a universal singular value thresholding procedure.<n>Our results rely on an enhanced analysis of matrix denoising methods based on singular value thresholding.
  arXiv  Detail & Related papers  (2025-10-09T12:01:46Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid 3D Registration [77.13381026159111]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration.<n>The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• On the design-dependent suboptimality of the Lasso [27.970033039287884]
  We show that the Lasso estimator is provably minimax rate-suboptimal when the minimum singular value is small. Our lower bound is strong enough to preclude the sparse statistical optimality of all forms of the Lasso.
  arXiv  Detail & Related papers  (2024-02-01T07:01:54Z)
• Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing [28.91482208876914]
  We consider the problem of parameter estimation in a high-dimensional generalized linear model.<n>Despite their wide use, a rigorous performance characterization, as well as a principled way to preprocess the data, are available only for unstructured designs.
  arXiv  Detail & Related papers  (2023-08-28T11:49:23Z)
• Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
  Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling. We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
  arXiv  Detail & Related papers  (2022-09-27T07:58:25Z)
• 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)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

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.