Robust Nonparametric Methods for $α$-Mixing Sequences via Median-of-Means

Attila Lovas; Marcell Tukora

Home/Archive/arXiv

arXiv · 2610.15974

Robust Nonparametric Methods for $α$-Mixing Sequences via Median-of-Means

Attila Lovas·Marcell Tukora

View original source ↗Read source document ↗Export metadata ↓

Abstract

The median-of-means (MoM) estimator is a robust alternative to the sample mean for heavy-tailed or contaminated data. While its non-asymptotic properties are well understood for i.i.d.\ samples, much less is known for dependent sequences. We establish non-asymptotic deviation bounds for the MoM estimator computed from consecutive blocks of an identically distributed $α$-mixing sequence, both for a single mean and uniformly over a class of functions (the median-of-means process). All bounds remain valid, with explicitly adjusted constants, when a sufficiently small fraction of the blocks is adversarially corrupted. As applications, we obtain deviation bounds for a median-of-means Nadaraya--Watson regression estimator, for the MoM kernel density estimator, and for empirical and Bahadur-type estimators of Value-at-Risk and Conditional Value-at-Risk. Finally, we show that the sampling of bulk materials, where the measurements form a spatially dependent random field, reduces to the one-dimensional setting if the samples are taken in well-separated groups.

Explore related subjects

math.ST math.PR stat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Attila Lovas, Marcell Tukora. 2026-10-11. Robust Nonparametric Methods for $α$-Mixing Sequences via Median-of-Means. https://arxiv.org/abs/2610.15974

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference

We consider experimentation in the presence of non-stationarity, inter-unit (spatial) interference, and carry-over effects (temporal interference), where we wish to estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control. We suppose spatial interference is described by a graph, where a unit's outcome depends on its neighborhood's treatments, and that temporal interference is described by an MDP, where the transition kernel under either treatment (action) satisfies a rapid mixing condition. We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks, and each whole cluster-block combination is assigned a single random treatment. Under this design, we show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $\tilde O(1/NT)$ mean squared error (MSE), matching the lower bound up to logarithmic terms for sparse graphs. Our results simultaneously generalize the results from \citet{hu2022switchback,ugander2013graph} and \citet{leung2022rate}. Simulation studies validate the favorable performance of our approach.

math.ST↗

arXiv2026

Random sets from the perspective of metric statistics

Since the seminal work by Beresteanu and Molinari(2008), the random set theory and related inference methods have been widely applied in partially identified econometric models. Meanwhile, there is an emerging field in statistics for studying random objects in metric spaces, called metric statistics. This paper clarifies a relationship between two fundamental concepts in these literatures, the Aumann and Fréchet means, and presents some applications of metric statistics to econometric problems involving random sets.

math.ST↗

arXiv2026

Minimax Binary Counting under Shuffle Privacy: Poisson Limits and Randomized-Response Optimality

We study estimation of a deterministic binary count from the shuffled outputs of a common single-message local channel. Privacy is required for every neighboring composition at fixed global parameters $(\varepsilon,δ)$, and estimators may be biased. We obtain uniform critical Poisson and Skellam approximations and characterize the limiting minimax risk as an infimum over finite observed-mark Poisson experiments. Let $Λ$ be the noise intensity required by the boundary Poisson-shift profile and let $λ_{\min}$ be the intensity required by the full composition-maximized randomized-response profile. Binary randomized response is asymptotically minimax optimal if and only if $Λ=λ_{\min}$. When $Λ<λ_{\min}$, the minimax value lies strictly between $(Λ+λ_{\min})/2$ and $λ_{\min}$, and a randomized-response construction with observed rare marks strictly improves on binary randomized response. We give a finite-sample certified example. Binary randomized response is strictly suboptimal at $\varepsilon=0$ for every $0<δ<1$, and this persists for sufficiently small positive $\varepsilon$ at each fixed target. For every fixed positive $\varepsilon$, strict suboptimality also occurs along a sequence of fixed privacy targets tending to zero. The variational characterization permits approximation by finite marked channels; it does not assert that a finite optimizer exists.

math.ST↗