Relative-error monotonicity testing
Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025年份
1被引次数
2顶会引用
摘要
The standard model of Boolean function property testing is not well suited for testing sparse functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the constant-0 function. In this work we propose and investigate a new model for property testing of Boolean functions, called relative-error testing, which provides a natural framework for testing sparse functions.
This new model defines the distance between two functions f, g : 0, 1 n → 0, 1 to be
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Halfspaces are hard to test with relative errorXi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli 等SODA 2026
- Boolean Function Monotonicity Testing Requires (Almost) n1/2 QueriesMark Chen, Xi Chen, Hao Cui, William Pires 等STOC 2026
它引用的顶会 Paper1
相关 Paper
- Testing Fourier Sparsity via Implicit SensingArijit Ghosh, Subhamoy Maitra, Manmatha RoyICLR 2026
- Testing vs Estimation for Index-Invariant Properties in the Huge Object ModelSourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi 等STOC 2025
- Approximating the Distance to Monotonicity of Boolean FunctionsRamesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik WaingartenSODA 2020 · 被引用 6 次
- A Lower Bound on Cycle-Finding in Sparse DigraphsXi Chen, Tim Randolph, Rocco A. Servedio, Timothy SunSODA 2020 · 被引用 2 次
- Optimal Non-adaptive Tolerant Junta Testing via Local EstimatorsShivam Nadimpalli, Shyamal PatelSTOC 2024
