Nonparametric Learning of Two-Layer ReLU Residual Units

We describe an algorithm that learns two-layer residual units using rectified linear unit (ReLU) activation: suppose the input x is from a distribution with support space R^d and the]ground truth generative model is a residual unit of this type, given by y = B [(A^∗∗x)⁺ + x, where ground-truth network parameters A^∗ ∈ R^d×d represent a full-rank matrix with nonnegative entries and B^∗ ∈ R^m×d is full-rank with m ≥ d and for c ∈ R^d, [c⁺]_i = max{0, c_i}. We design layer-wise objectives as functionals whose analytic minimizers express the exact ground-truth network in terms of its parameters and nonlinearities. Following this objective landscape, learning residual units from finite samples can be formulated using convex optimization of a nonparametric function: for each layer, we first formulate the corresponding empirical risk minimization (ERM) as a positive semi-definite quadratic program (QP), then we show the solution space of the QP can be equivalently determined by a set of linear inequalities, which can then be efficiently solved by linear programming (LP). We further prove the strong statistical consistency of our algorithm, and demonstrate its robustness and sample efficiency through experimental results on synthetic data and a set of benchmark regression datasets.