paper-with-me

홈 › Papers

Sparseout: Controlling Sparsity in Deep Networks

2019-04-17 · Najeeb Khan, Ian Stavness

Dropout is commonly used to help reduce overfitting in deep neural networks. Sparsity is a potentially important property of neural networks, but is not explicitly controlled by Dropout-based regularization. In this work, we propose Sparseout a simple and efficient variant of Dropout that can be used to control the sparsity of the activations in a neural network. We theoretically prove that Sparseout is equivalent to an $L_q$ penalty on the features of a generalized linear model and that Dropout is a special case of Sparseout for neural networks. We empirically demonstrate that Sparseout is computationally inexpensive and is able to control the desired level of sparsity in the activations. We evaluated Sparseout on image classification and language modelling tasks to see the effect of sparsity on these tasks. We found that sparsity of the activations is favorable for language modelling performance while image classification benefits from denser activations. Sparseout provides a way to investigate sparsity in state-of-the-art deep learning models. Source code for Sparseout could be found at \url{https://github.com/najeebkhan/sparseout}.

📄 PDF Abstract BibTeX arXiv:1904.08050

Code (1)

najeebkhan/sparseout 공식 구현 pytorch

Tasks

General Classificationimage-classificationImage ClassificationLanguage Modelling

Methods 이 논문이 사용한 방법론

Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…

Similar Papers 제목 키워드 기반

Sparsity Emerges Naturally in Neural Language Models

2019-07-22 · ICML Workshop Deep_Phenomen 2019 6 · Naomi Saphra, Adam Lopez

Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural…

Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraints

2022-08-08 · Jose Gallego-Posada, Juan Ramirez, Akram Erraqabi, Yoshua Bengio 외

The performance of trained neural networks is robust to harsh levels of pruning. Coupled with the ever-growing size of deep learning models, this observation has motivated extensive research on learning sparse models. In…

Sparse Learning

Sparsity in Optimal Randomized Classification Trees

2020-02-21 · Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales

Decision trees are popular Classification and Regression tools and, when small-sized, easy to interpret. Traditionally, a greedy approach has been used to build the trees, yielding a very fast training process; however, …

ClassificationGeneral Classification

r-softmax: Generalized Softmax with Controllable Sparsity Rate

2023-04-11 · Klaudia Bałazy, Łukasz Struski, Marek Śmieja, Jacek Tabor

Nowadays artificial neural network models achieve remarkable results in many disciplines. Functions mapping the representation provided by the model to the probability distribution are the inseparable aspect of deep lear…

Language ModelingLanguage Modelling

Selective Factor Extraction in High Dimensions

2014-03-25 · Yiyuan She

This paper studies simultaneous feature selection and extraction in supervised and unsupervised learning. We propose and investigate selective reduced rank regression for constructing optimal explanatory factors from a p…

feature selectionModel SelectionVariable SelectionVocal Bursts Intensity Prediction