This work examines the problem of exact data interpolation via sparse (neuron count), infinitely wide, single hidden layer neural networks with leaky rectified linear unit activations. Using the atomic norm framework of [Chandrasekaran et al. 2012], we derive simple characterizations of the convex hulls of the corresponding atomic sets for this problem under several different constraints on the weights and biases of the network, thus obtaining equivalent convex formulations for these problems. A modest extension of our proposed framework to a binary classification problem is also presented. We explore the efficacy of the resulting formulations experimentally, and compare with networks trained via gradient descent.
Bibliographical noteFunding Information:
Manuscript received July 14, 2020; revised October 30, 2020; accepted November 1, 2020. Date of publication November 19, 2020; date of current version December 18, 2020. The work of Akshay Kumar was supported in part by the 3M Science and Technology Doctoral Fellowship. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Ananda S. Chowdhury. (Corresponding author: Jarvis Haupt.) The authors are with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 USA (e-mail: firstname.lastname@example.org; email@example.com).
© 1994-2012 IEEE.
- Atomic norm
- binary classification
- convex optimization
- single hidden layer neural networks