Provably efficient neural network representation for image classification
Yichen Huang

TL;DR
This paper establishes conditions under which neural networks can efficiently represent image classification functions, providing a theoretical foundation for their success in tasks like digit recognition.
Contribution
It proves that, under certain assumptions, neural networks can have provably efficient representations for image classification functions.
Findings
Neural networks can represent image classification functions efficiently under specific assumptions.
The assumptions made are intuitive and applicable to common tasks like handwritten digit recognition.
Provides a theoretical basis for the effectiveness of neural networks in image classification.
Abstract
The state-of-the-art approaches for image classification are based on neural networks. Mathematically, the task of classifying images is equivalent to finding the function that maps an image to the label it is associated with. To rigorously establish the success of neural network methods, we should first prove that the function has an efficient neural network representation, and then design provably efficient training algorithms to find such a representation. Here, we achieve the first goal based on a set of assumptions about the patterns in the images. The validity of these assumptions is very intuitive in many image classification problems, including but not limited to, recognizing handwritten digits.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Model Reduction and Neural Networks · Neural Networks and Applications
