Alternating Minimization for Regression with Tropical Rational Functions
Alex Dunbar, Lars Ruthotto
TL;DR
The paper tackles regression in the space of tropical rational functions by introducing an alternating minimization heuristic that alternates between fitting the numerator and denominator tropical polynomials, each step solvable in closed form via max-plus/min-plus matrix-vector operations. The approach leverages the structure of tropical polynomials to produce a computationally cheap, nonconvex optimization method for $\,\ell^{\infty}$ regression with fixed exponent set $W$. Empirical results across univariate, bivariate, and higher-dimensional data show the method yields reasonable fits and monotone (nonincreasing) loss across iterations, with insights into degree effects, scaling, and neural-network initialization. The work connects tropical algebra to ReLU networks, demonstrates potential benefits for initialization, and outlines avenues for extending the framework to different norms, sparsity, and monomial selection, while noting the lack of general convergence guarantees and the risk of overfitting in higher dimensions.
Abstract
We propose an alternating minimization heuristic for regression over the space of tropical rational functions with fixed exponents. The method alternates between fitting the numerator and denominator terms via tropical polynomial regression, which is known to admit a closed form solution. We demonstrate the behavior of the alternating minimization method experimentally. Experiments demonstrate that the heuristic provides a reasonable approximation of the input data. Our work is motivated by applications to ReLU neural networks, a popular class of network architectures in the machine learning community which are closely related to tropical rational functions.
