IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.18627.html

Accuracy of Uniform Inference on Fine Grid Points

Author

Listed:
  • Shunsuke Imai

Abstract

Uniform confidence bands are widely used to quantify uncertainty about unknown functions in nonparametric inference. Although various methods, including the multiplier bootstrap, have been developed and theoretically justified, practical implementations typically replace the supremum over a continuum by the maximum over a finite evaluation grid. This paper investigates how this discretization affects coverage accuracy and how fine the evaluation grid must be to ensure valid uniform inference. We first illustrate through simulations of a kernel-based nonparametric estimator that coarse grids can substantially reduce uniform coverage. Surprisingly, increasing the sample size can worsen coverage on a fixed coarse grid, even as the remaining approximation error on the grid decreases. We then derive general upper bounds on the coverage probability and coverage error of uniform confidence bands based on multiplier-bootstrap critical values on the finite grid points, separating discretization error from the remaining approximation error on the grid. For local empirical processes arising from kernel smoothing, we establish primitive conditions under which coverage converges to zero even when the number of grid points diverges, and conditions ensuring asymptotically nominal coverage. The latter results yield rate-sharp grid resolution requirements in terms of the bandwidth. Furthermore, we derive an explicit leading constant in the bound on coverage error and develop a quantitative grid selection rule for a user-specified discretization tolerance level, which can be implemented through a simple one-dimensional search.

Suggested Citation

  • Shunsuke Imai, 2025. "Accuracy of Uniform Inference on Fine Grid Points," Papers 2512.18627, arXiv.org, revised Oct 2026.
  • Handle: RePEc:arx:papers:2512.18627
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2512.18627
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2512.18627. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.