Abstract
Effective regularisation of neural networks is essential to combat overfitting due to the large number of parameters involved. We present an empirical analogue to the Lipschitz constant of a feed-forward neural network, which we refer to as the maximum gain. We hypothesise that constraining the gain of a network will have a regularising effect, similar to how constraining the Lipschitz constant of a network has been shown to improve generalisation. A simple algorithm is provided that involves rescaling the weight matrix of each layer after each parameter update. We conduct a series of studies on common benchmark datasets, and also a novel dataset that we introduce to enable easier significance testing for experiments using convolutional networks. Performance on these datasets compares favourably with other common regularisation techniques. Data related to this paper is available at: https://www.cs.waikato.ac.nz/textasciitildeml/sins10/.
Original language | English |
---|---|
Title of host publication | ECML PKDD 2018: Machine Learning and Knowledge Discovery in Databases |
Editors | Michele Berlingerio, Francesco Bonchi, Thomas Gärtner, Neil Hurley, Georgiana Ifrim |
Place of Publication | Cham |
Publisher | Springer |
Pages | 541-556 |
Number of pages | 16 |
Volume | 11051 |
ISBN (Electronic) | 978-3-030-10925-7 |
ISBN (Print) | 978-3-030-10924-0 |
DOIs | |
Publication status | Published - 2019 |
Event | European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - Dublin, Ireland Duration: 10 Sept 2018 → 14 Sept 2018 http://www.ecmlpkdd2018.org/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 11051 |
ISSN (Print) | 0302-9743 |
Conference
Conference | European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases |
---|---|
Abbreviated title | ECML PKDD |
Country/Territory | Ireland |
City | Dublin |
Period | 10/09/18 → 14/09/18 |
Internet address |