Variance estimation in compound decision theory under boundedness

Subhodh Kotekal
2/3/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

The normal means model is often studied under the assumption of a known variance. However, ignorance of the variance is a frequent issue in applications and basic theoretical questions still remain open in this setting. This article establishes that the sharp minimax rate of variance estimation in square error is (log log n/ log n ) 2 under arguably the most mild assumption imposed for identifiability: bounded means. The rate-optimal estimator proposed in this article achieves the optimal rate by estimating O (log n/ log log n ) cumulants and leveraging a variational representation of the noise variance in terms of the cumulants of the data distribution. The minimax lower bound involves a moment matching construction

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kotekal2026variance,
  title  = {Variance estimation in compound decision theory under boundedness},
  author = {Subhodh Kotekal},
  year   = {2026},
  doi    = {10.52202/079017-2919},
  url    = {https://doi.org/10.52202/079017-2919},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/4867a370b4581d1549ceb5f9f0430acb2876f4d0.svg)](https://codeofpaper.com/paper/4867a370b4581d1549ceb5f9f0430acb2876f4d0)

Discussion