atlas

Research map / Learning theory and algorithms / Sample complexity

Small Resamples, Sharp Guarantees: Convergence Rates for Resampled Studentized Quantile Estimators

NeurIPS 2025 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Derives convergence rates for the m-out-of-n bootstrap applied to studentized quantile estimators, giving sharp guarantees for small-subsample resampling.

Problem

The m-out-of-n bootstrap is widely used for robust inference with heavy-tailed data, but its theoretical convergence guarantees for quantile estimators are not well understood.

Approach

Provides sharp convergence rates for resampled studentized quantile estimators under the m-out-of-n bootstrap, showing how subsample size m relative to n governs accuracy.

Experimental setup

Builds on: m-out-of-n bootstrap

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy