High-Dimensional Neural Feature Using Rectified Linear Unit And Random Matrix Instance
Alireza M. Javid, Arun Venkitaraman, Mikael Skoglund, Saikat Chatterjee
Abstract
We design a ReLU-based multilayer neural network to generate a rich high-dimensional feature vector. The feature guarantees a monotonically decreasing training cost as the number of layers increases. We design the weight matrix in each layer to extend the feature vectors to a higher dimensional space while providing a richer representation in the sense of training cost. Linear projection to the target in the higher dimensional space leads to a lower training cost if a convex cost is minimized. An ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> -norm convex constraint is used in the minimization to improve the generalization error and avoid overfitting. The regularization hyperparameters of the network are derived analytically to guarantee a monotonic decrement of the training cost and therefore, it eliminates the need for cross-validation to find the regularization hyperparameter in each layer.
BibTeX
@inproceedings{icassp2020_highdimensionaln,
title = {High-Dimensional Neural Feature Using Rectified Linear Unit And Random Matrix Instance},
author = {Alireza M. Javid and Arun Venkitaraman and Mikael Skoglund and Saikat Chatterjee},
booktitle = {ICASSP 2020},
year = {2020}
}