Smooth Min-Max Monotonic Networks
Not on the map. Why?
Abstract (arXiv)
Monotonicity constraints are powerful regularizers in statistical modelling. They can support fairness in computer-aided decision making and increase plausibility in data-driven scientific models. The seminal min-max (MM) neural network architecture ensures monotonicity, but often gets stuck in undesired local optima during training because of partial derivatives of the MM nonlinearities being zero. We propose a simple modification of the MM network using strictly-increasing smooth minimum and maximum functions that alleviates this problem. The resulting smooth min-max (SMM) network module inherits the asymptotic approximation properties from the MM architecture. It can be used within larger deep learning systems trained end-to-end. The SMM module is conceptually simple and computationally less demanding than state-of-the-art neural networks for monotonic modelling. Our experiments show that this does not come with a loss in generalization performance compared to alternative neural and non-neural approaches.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 11 of its 30 references that are in the map. First posted on arXiv 1 Jun 2023.
Builds on
11 of 30 references.
References · 11
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2018Sorting out Lipschitz function approximationcited by 211
- 2017Deep Lattice Networks and Partial Monotonic Functionscited by 62
- 2020Counterexample-Guided Learning of Monotonic Neural Networkscited by 34
- 2019How to Incorporate Monotonicity in Deep Networks While Preserving Flexibility?cited by 21
- 2018Monotonic classification: an overview on algorithms, performance measures and data setscited by 18
- 2020Deontological Ethics By Monotonicity Shape Constraintscited by 16
- 2022Size and depth of monotone neural networks: interpolation and approximationcited by 10
- 2017Shifting Mean Activation Towards Zero with Bipolar Activation Functionscited by 4
- 2019Avoiding Resentment Via Monotonic Fairnesscited by 4
Built on by
Citing papers per year: 2025: 1; 2026: 4.
5 papers.
- 2025Learning Monotonic Probabilities with a Generative Cost Modelcited by 1
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Biascited by 1
- 2026Knowledge-informed Bidding with Dual-process Control for Online Advertisingcited by 0
- 2026A CDF-First Framework for Free-Form Density Estimationcited by 0
- 2026SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterizationcited by 0
- 2026SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization27 Sep 2026
- 2026Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias16 Jun 2026
- 2026A CDF-First Framework for Free-Form Density Estimation26 Mar 2026
- 2026Knowledge-informed Bidding with Dual-process Control for Online Advertising5 Mar 2026
- 2025Learning Monotonic Probabilities with a Generative Cost Model4 Jun 2025