Why Smooth Stability Assumptions Fail for ReLU Learning
Ronald Katende
TL;DR
The paper shows that global smoothness-based stability proxies fail for ReLU learning because activation boundary crossings induce nonlocal changes in the gradient. It provides a concrete one-neuron counterexample to demonstrate the nonexistence of a uniform $L$- Lipschitz bound on the gradient and argues that a nonsmooth framework based on Clarke generalized Jacobians is the correct lens for stability analysis. By linking the obstruction to boundary geometry and showing that surrogate smooth activations require diverging constants, it clarifies why smooth approximations can be misleading. The work offers a precise, minimal nonsmooth regularity condition under which stability statements can be meaningfully formulated, guiding the development of nonsmooth-aware stability theories for ReLU-based networks.
Abstract
Stability analyses of modern learning systems are frequently derived under smoothness assumptions that are violated by ReLU-type nonlinearities. In this note, we isolate a minimal obstruction by showing that no uniform smoothness-based stability proxy such as gradient Lipschitzness or Hessian control can hold globally for ReLU networks, even in simple settings where training trajectories appear empirically stable. We give a concrete counterexample demonstrating the failure of classical stability bounds and identify a minimal generalized derivative condition under which stability statements can be meaningfully restored. The result clarifies why smooth approximations of ReLU can be misleading and motivates nonsmooth-aware stability frameworks.
