Representing Piecewise-Linear Functions by Functions with Minimal Arity

Christoph Koutschan, Anton Ponomarchuk, Josef Schicho
{"title":"Representing Piecewise-Linear Functions by Functions with Minimal Arity","authors":"Christoph Koutschan, Anton Ponomarchuk, Josef Schicho","doi":"arxiv-2406.02421","DOIUrl":null,"url":null,"abstract":"Any continuous piecewise-linear function $F\\colon \\mathbb{R}^{n}\\to\n\\mathbb{R}$ can be represented as a linear combination of $\\max$ functions of\nat most $n+1$ affine-linear functions. In our previous paper [``Representing\npiecewise linear functions by functions with small arity'', AAECC, 2023], we\nshowed that this upper bound of $n+1$ arguments is tight. In the present paper,\nwe extend this result by establishing a correspondence between the function $F$\nand the minimal number of arguments that are needed in any such decomposition.\nWe show that the tessellation of the input space $\\mathbb{R}^{n}$ induced by\nthe function $F$ has a direct connection to the number of arguments in the\n$\\max$ functions.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"66 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.02421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear functions by functions with small arity'', AAECC, 2023], we showed that this upper bound of $n+1$ arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function $F$ and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space $\mathbb{R}^{n}$ induced by the function $F$ has a direct connection to the number of arguments in the $\max$ functions.
用具有最小 Arity 的函数表示片线性函数
任何连续的片断线性函数 $F\colon \mathbb{R}^{n}\to\mathbb{R}$ 都可以表示为最多 $n+1$ 仿真线性函数的 $\max$ 函数的线性组合。在我们之前的论文["Representingpiecewise linear functions by functions with small arity'', AAECC, 2023]中,我们证明了这个 $n+1$ 参数的上限是很紧的。在本文中,我们通过建立函数 $F$ 与任何此类分解所需的最小参数数之间的对应关系来扩展这一结果。我们证明,函数 $F$ 所诱导的输入空间 $\mathbb{R}^{n}$ 的细分与 $\max$ 函数中的参数数有直接联系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信