Sparsity in Max-Plus Algebra and Applications in Multivariate Convex Regression
Lists
Only you see this
Abstract
In this paper, we study concepts of sparsity in the max-plus algebra and apply them to the problem of multivariate convex regression. We show how to efficiently find sparse (containing many −∞ elements) approximate solutions to max-plus equations by leveraging notions from submodular optimization. Subsequently, we propose a novel method for piecewise-linear surface fitting of convex multivariate functions, with optimality guarantees for the model parameters and an approximately minimum number of affine regions.
BibTeX
@inproceedings{tsilivis2021sparsity,
author = {Nikos Tsilivis and Anastasios Tsiamis and Petros Maragos},
title = {{Sparsity in Max-Plus Algebra and Applications in Multivariate Convex Regression}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2021},
doi = {10.1109/icassp39728.2021.9414139},
}