# Resilience of Rademacher chaos of low degree

arXiv: https://arxiv.org/abs/2402.10504 · HTML: https://mlsanity.com/paper/2402.10504/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 39 references that are in the map.
- First posted on arXiv 16 Feb 2024.

## Builds on (most cited first, 1 of 1)

- [Restricted Isometry Property under High Correlations](https://mlsanity.com/paper/1904.05510/) (2019)

## Abstract (arXiv)

The em resilience of a Rademacher chaos is the maximum number of adversarial sign-flips that the chaos can sustain without having its largest atom probability significantly altered. Inspired by probabilistic lower-bound guarantees for the resilience of linear Rademacher chaos (aka. resilience of the Littlewood-Offord problem), obtained by Bandeira, Ferber, and Kwan (Advances in Mathematics, Vol. 319, 2017), we provide probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree; these being most meaningful provided that the degree is constant.