%0 Journal Article %1 kolbeinsson2019stochastically %A Kolbeinsson, Arinbjörn %A Kossaifi, Jean %A Panagakis, Yannis %A Anandkumar, Anima %A Tzoulaki, Ioanna %A Matthews, Paul %D 2019 %K deep-learning learning %T Stochastically Rank-Regularized Tensor Regression Networks %U http://arxiv.org/abs/1902.10758 %X Over-parametrization of deep neural networks has recently been shown to be key to their successful training. However, it also renders them prone to overfitting and makes them expensive to store and train. Tensor regression networks significantly reduce the number of effective parameters in deep neural networks while retaining accuracy and the ease of training. They replace the flattening and fully-connected layers with a tensor regression layer, where the regression weights are expressed through the factors of a low-rank tensor decomposition. In this paper, to further improve tensor regression networks, we propose a novel stochastic rank-regularization. It consists of a novel randomized tensor sketching method to approximate the weights of tensor regression layers. We theoretically and empirically establish the link between our proposed stochastic rank-regularization and the dropout on low-rank tensor regression. Extensive experimental results with both synthetic data and real world datasets (i.e., CIFAR-100 and the UK Biobank brain MRI dataset) support that the proposed approach i) improves performance in both classification and regression tasks, ii) decreases overfitting, iii) leads to more stable training and iv) improves robustness to adversarial attacks and random noise.

@article{kolbeinsson2019stochastically, abstract = {Over-parametrization of deep neural networks has recently been shown to be key to their successful training. However, it also renders them prone to overfitting and makes them expensive to store and train. Tensor regression networks significantly reduce the number of effective parameters in deep neural networks while retaining accuracy and the ease of training. They replace the flattening and fully-connected layers with a tensor regression layer, where the regression weights are expressed through the factors of a low-rank tensor decomposition. In this paper, to further improve tensor regression networks, we propose a novel stochastic rank-regularization. It consists of a novel randomized tensor sketching method to approximate the weights of tensor regression layers. We theoretically and empirically establish the link between our proposed stochastic rank-regularization and the dropout on low-rank tensor regression. Extensive experimental results with both synthetic data and real world datasets (i.e., CIFAR-100 and the UK Biobank brain MRI dataset) support that the proposed approach i) improves performance in both classification and regression tasks, ii) decreases overfitting, iii) leads to more stable training and iv) improves robustness to adversarial attacks and random noise.}, added-at = {2019-03-03T01:21:03.000+0100}, author = {Kolbeinsson, Arinbjörn and Kossaifi, Jean and Panagakis, Yannis and Anandkumar, Anima and Tzoulaki, Ioanna and Matthews, Paul}, biburl = {https://www.bibsonomy.org/bibtex/2323d7af9d88a4278ffb312fdd309dad4/kirk86}, description = {Stochastically Rank-Regularized Tensor Regression Networks}, interhash = {d96bf9a2057c360edd34bacb92f27c7d}, intrahash = {323d7af9d88a4278ffb312fdd309dad4}, keywords = {deep-learning learning}, note = {cite arxiv:1902.10758}, timestamp = {2019-03-03T01:21:03.000+0100}, title = {Stochastically Rank-Regularized Tensor Regression Networks}, url = {http://arxiv.org/abs/1902.10758}, year = 2019 }