# Deep Learning with Nonsmooth Objectives

arXiv: https://arxiv.org/abs/2107.08800 · HTML: https://mlsanity.com/paper/2107.08800/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 24 references that are in the map.
- First posted on arXiv 14 Jul 2021.

## Builds on (most cited first, 2 of 2)

- [Deep Declarative Networks: A New Hope](https://mlsanity.com/paper/1909.04866/) (2019)
- [DANTE: Deep AlterNations for Training nEural networks](https://mlsanity.com/paper/1902.00491/) (2019)

## Abstract (arXiv)

We explore the potential for using a nonsmooth loss function based on the max-norm in the training of an artificial neural network. We hypothesise that this may lead to superior classification results in some special cases where the training data is either very small or unbalanced. Our numerical experiments performed on a simple artificial neural network with no hidden layers (a setting immediately amenable to standard nonsmooth optimisation techniques) appear to confirm our hypothesis that uniform approximation based approaches may be more suitable for the datasets with reliable training data that either is limited size or biased in terms of relative cluster sizes.