Testing piecewise functions

From MaRDI portal
Publication:1786590

DOI10.1016/J.TCS.2018.05.019zbMATH Open1400.68260arXiv1706.07669OpenAlexW2963411165MaRDI QIDQ1786590FDOQ1786590


Authors: Steve Hanneke, Liu Yang Edit this on Wikidata


Publication date: 24 September 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: This work explores the query complexity of property testing for general piecewise functions on the real line, in the active and passive property testing settings. The results are proven under an abstract zero-measure crossings condition, which has as special cases piecewise constant functions and piecewise polynomial functions. We find that, in the active testing setting, the query complexity of testing general piecewise functions is independent of the number of pieces. We also identify the optimal dependence on the number of pieces in the query complexity of passive testing in the special case of piecewise constant functions.


Full work available at URL: https://arxiv.org/abs/1706.07669




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Testing piecewise functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786590)