Skip to content
Preprint

Robust dimension-free estimation of simple random tensors: optimal guarantees under heavy tails and adversarial contamination

Sep 2026 · 0 citations · 55 references
Mathematics

TL;DR

This work proposes the first robust estimator achieving near-optimal dimension-free statistical rates in this setting, and extends the trimmed-mean framework underlying recent advances in robust mean and covariance estimation to arbitrary tensor order.

Abstract

We study robust estimation of simple random tensors of arbitrary order $q\in\mathbb{N}$ under finite-moment assumptions and adversarial contamination. We propose the first robust estimator achieving near-optimal dimension-free statistical rates in this setting. The estimator attains the near-optimal corruption rate whenever $p\ge2q$ moments are finite and continues to provide nontrivial guarantees throughout the weak-moment regime $q\le p\le2q$. Being based on directional trimmed means and minimax aggregation, our estimator is adaptive to $p$ and upper bounds on hypercontractive constants without resorting to interval-intersection procedures. Our analysis extends the trimmed-mean framework underlying recent advances in robust mean and covariance estimation to arbitrary tensor order. In particular, we establish concentration inequalities for higher-order counting and truncated empirical multi-vector product processes. We believe these inequalities could be of independent interest beyond the present application, including algorithmic robust estimation.

View source

Similar papers

Open access Aug 2026

Projection-robust zeroth-order optimization on manifolds under heavy-tailed oracle noise

This work proposes PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation and establishes the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace.

Yin-Pu Ma, Cunlin Li, Shiyue Zhang · 0 citations
Review Oct 2026

Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits

Saturated Propose-test-release, a general mechanism that privately releases the output of a discrete selector with probability one once its stability certificate reaches a finite threshold, is introduced and a computable support-stability score is constructed.

Jian-Zhong Gu, T. Cai · 0 citations
Preprint Oct 2026

Minimax Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions

We study zeroth-order optimization of convex and strongly convex functions with H\"older smoothness of order $\beta>2$ from values corrupted by random noise with bias independent of the method's random directions, a Lipschitz systematic error and a bounded adversarial error. We measure the number of function evaluation...

Т. В. Логінов, D. Dvinskikh, Nazarii Tupitsa et al. · 0 citations
Preprint Sep 2026

Contraction and Statistical Inference under Privacy for Uniformly Bounded Distributions

We investigate $c$-interior pointwise maximal leakage (PML) as a tool for contraction analyses and disclosure control. Based on the strong adversarial threat models from maximal leakage, $c$-interior PML generalizes local differential privacy (LDP) to data-generating distributions with densities uniformly bounded away...

Leonhard Grosse, Sara Saeidian, T. Oechtering et al. · 0 citations
Preprint Aug 2026

Sharp proper estimation of fixed-component Gaussian location mixtures in polynomial time

Exhaustive moment fitting in this constant-dimensional space produces a proper mixture and, together with the dimension-free moment characterization of Gaussian mixtures, achieves the optimal Hellinger rate in polynomial arithmetic time for every fixed $k$.

Heng-Zhi He, Guang Cheng · 0 citations
Preprint Sep 2026

Sharp spectral norm concentration of sparse random tensors

We prove a sharp concentration inequality for the spectral norm of sparse random tensors with independent Bernoulli entries. Let $T$ be an order-$k$ tensor of dimension $n\times\cdots\times n$ with independent Bernoulli$(p)$ entries, where $k$ is fixed. For any $c,r>0$, we show that $\|T-\mathbb E T\|\le C_{k,r,c}\sqrt...

Zhixin Zhou, Yizhe Zhu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.