Black Boxes and Looking Glasses: Multilevel Symmetries, Reflection Planes, and Convex Optimization in Deep Networks
<|reference_start|>Black Boxes and Looking Glasses: Multilevel Symmetries, Reflection Planes, and Convex Optimization in Deep Networks: We show that training deep neural networks (DNNs) with absolute value activation and arbitrary input dimension can be formulated as equivalent convex Lasso problems with novel features expressed using geometric algebra. This formulation reveals geometric structures encoding symmetry in neural networks. Using the equivalent Lasso form of DNNs, we formally prove a fundamental distinction between deep and shallow networks: deep networks inherently favor symmetric structures in their fitted functions, with greater depth enabling multilevel symmetries, i.e., symmetries within symmetries. Moreover, Lasso features represent distances to hyperplanes that are reflected across training points. These reflection hyperplanes are spanned by training data and are orthogonal to optimal weight vectors. Numerical experiments support theory and demonstrate theoretically predicted features when training networks using embeddings generated by Large Language Models.<|reference_end|>
@article{zeger2024black,
    title={Black Boxes and Looking Glasses: Multilevel Symmetries, Reflection
  Planes, and Convex Optimization in Deep Networks},
    author={Emi Zeger and Mert Pilanci},
    journal={arXiv preprint arXiv:2410.04279},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04279},
    primaryClass={cs.LG stat.ML}
}