A max-affine spline approximation of neural networks using the Legendre transform of a convex-concave representation
Adam Perrett, Danny Wood, Gavin Brown

TL;DR
This paper introduces a new algorithm to convert neural networks into spline representations using the Legendre transform, relaxing previous constraints and enabling better visualization and approximation analysis.
Contribution
It presents a novel method for spline approximation of neural networks that relaxes convexity constraints and applies to entire networks, not just individual layers.
Findings
Effective approximation of various neural network architectures.
Visualization of network feature maps.
Low approximation error demonstrated experimentally.
Abstract
This work presents a novel algorithm for transforming a neural network into a spline representation. Unlike previous work that required convex and piecewise-affine network operators to create a max-affine spline alternate form, this work relaxes this constraint. The only constraint is that the function be bounded and possess a well-define second derivative, although this was shown experimentally to not be strictly necessary. It can also be performed over the whole network rather than on each layer independently. As in previous work, this bridges the gap between neural networks and approximation theory but also enables the visualisation of network feature maps. Mathematical proof and experimental investigation of the technique is performed with approximation error and feature maps being extracted from a range of architectures, including convolutional neural networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Neural Networks and Applications · Model Reduction and Neural Networks
