Sparse Approximate Solutions to Max-Plus Equations with Application to Multivariate Convex Regression

11/06/2020
by   Nikos Tsilivis, et al.
0

In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial time for any ℓ_p approximation error. Based on these results, we propose a novel method for piecewise-linear fitting of convex multivariate functions, with optimality guarantees for the model parameters and an approximately minimum number of affine regions.

READ FULL TEXT
research
12/09/2019

Tropical Geometry and Piecewise-Linear Approximation of Curves and Surfaces on Weighted Lattices

Tropical Geometry and Mathematical Morphology share the same max-plus an...
research
05/26/2023

Representing Piecewise Linear Functions by Functions with Small Arity

A piecewise linear function can be described in different forms: as an a...
research
04/11/2023

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)

We show that the big-O problem for max-plus automata is decidable and PS...
research
03/12/2021

Max-Linear Regression by Scalable and Guaranteed Convex Programming

We consider the multivariate max-linear regression problem where the mod...
research
01/15/2023

Max-min Learning of Approximate Weight Matrices from Fuzzy Data

In this article, we study the approximate solutions set Λ_b of an incons...
research
04/21/2018

A Fluid-Flow Interpretation of SCED Scheduling

We show that a fluid-flow interpretation of Service Curve Earliest Deadl...
research
03/24/2022

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs

This paper studies a variant of the minimum-cost flow problem in a graph...

Please sign up or login with your details

Forgot password? Click here to reset