Comparison of the Runtime of two Algorithms for the Linear Decomposition of ReLU Networks Supplementary

Read full text Summarise with VIRAT
Authors: anonymous, anonymous
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This is the supplementary code for the paper "Comparison of the Runtime of two Algorithms for the Linear Decomposition of ReLU Networks".

Fields of Study & Subjects

Neural Networks and Applications Advanced Neural Network Applications Stochastic Gradient Optimization Techniques

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
20 March 2026
Language
EN