English

Optimal lower Lipschitz bounds for ReLU layers, saturation, and phase retrieval

Machine Learning 2025-02-17 v1 Numerical Analysis Functional Analysis Numerical Analysis

Abstract

The injectivity of ReLU layers in neural networks, the recovery of vectors from clipped or saturated measurements, and (real) phase retrieval in Rn\mathbb{R}^n allow for a similar problem formulation and characterization using frame theory. In this paper, we revisit all three problems with a unified perspective and derive lower Lipschitz bounds for ReLU layers and clipping which are analogous to the previously known result for phase retrieval and are optimal up to a constant factor.

Keywords

Cite

@article{arxiv.2502.09898,
  title  = {Optimal lower Lipschitz bounds for ReLU layers, saturation, and phase retrieval},
  author = {Daniel Freeman and Daniel Haider},
  journal= {arXiv preprint arXiv:2502.09898},
  year   = {2025}
}

Comments

22 pages

R2 v1 2026-06-28T21:44:01.923Z