Near-optimal query bounds for linearity testing under online adversarial corruptions, and an O(1/ε) query tester for real-valued linearity, improving prior O(1/ε log(1/ε)) bounds.
Improved non-approximability results
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Optimal Testing of Linearity
Near-optimal query bounds for linearity testing under online adversarial corruptions, and an O(1/ε) query tester for real-valued linearity, improving prior O(1/ε log(1/ε)) bounds.