Hyperplane Arrangements and Fixed Points in Iterated PWL Neural Networks
<|reference_start|>Hyperplane Arrangements and Fixed Points in Iterated PWL Neural Networks: We leverage the framework of hyperplane arrangements to analyze potential regions of (stable) fixed points. We provide an upper bound on the number of fixed points for multi-layer neural networks equipped with piecewise linear (PWL) activation functions with arbitrary many linear pieces. The theoretical optimality of the exponential growth in the number of layers of the latter bound is shown. Specifically, we also derive a sharper upper bound on the number of stable fixed points for one-hidden-layer networks with hard tanh activation.<|reference_end|>
@article{beise2024hyperplane,
    title={Hyperplane Arrangements and Fixed Points in Iterated PWL Neural Networks},
    author={Hans-Peter Beise},
    journal={arXiv preprint arXiv:2405.09878},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.09878},
    primaryClass={cs.LG cs.AI stat.ML}
}