Concentration Inequalities for Exchangeable Tensors and Matrix-valued Data

We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured weighted sums under exchangeability, extending beyond the classical framework of independent terms. We develop Hoeffding and Bernstein bounds provided with structure-dependent exchangeability. Along the way, we recover known results in weighted sum of exchangeable random variables and i.i.d. sums of random matrices to the optimal constants. Notably, we develop a sharper concentration bound for combinatorial sum of matrix arrays than the results previously derived from Chatterjee’s method of exchangeable pairs. For applications, the richer structures provide us with novel analytical tools for estimating the average effect of multi-factor response models and studying fixed-design sketching methods in federated averaging. We apply our results to these problems, and find that our theoretical predictions are corroborated by numerical evidence.

💡 Research Summary

This paper develops sharp concentration inequalities for two classes of structured random objects under exchangeability: (i) mode‑exchangeable tensors and (ii) sequences of exchangeable matrix‑valued data. The authors consider a fixed weight tensor (W) and a random tensor (X) whose entries are bounded in (