English
Related papers

Related papers: Isoperimetric Inequalities for Real-Valued Functio…

200 papers

We give a $2^{\tilde{O}(\sqrt{n}/\epsilon)}$-time algorithm for properly learning monotone Boolean functions under the uniform distribution over $\{0,1\}^n$. Our algorithm is robust to adversarial label noise and has a running time nearly…

Data Structures and Algorithms · Computer Science 2023-03-29 Jane Lange , Ronitt Rubinfeld , Arsen Vasilyan

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…

Discrete Mathematics · Computer Science 2015-11-12 Xi Chen , Jinyu Xie

We study monotonicity testing of Boolean functions over the hypergrid $[n]^d$ and design a non-adaptive tester with $1$-sided error whose query complexity is $\tilde{O}(d^{5/6})\cdot \text{poly}(\log n,1/\epsilon)$. Previous to our work,…

Discrete Mathematics · Computer Science 2017-10-31 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…

Computational Complexity · Computer Science 2014-12-19 Xi Chen , Anindya De , Rocco A. Servedio , Li-Yang Tan

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

We study the relative-error property testing model for Boolean functions that was recently introduced in the work of Chen et al. (SODA 2025). In relative-error testing, the testing algorithm gets uniform random satisfying assignments as…

Computational Complexity · Computer Science 2025-04-15 Xi Chen , William Pires , Toniann Pitassi , Rocco A. Servedio

We show a procedure that, given oracle access to a function $f\colon \{0,1\}^n\to\{0,1\}$, produces oracle access to a function $f'\colon \{0,1\}^{n'}\to\{0,1\}$ such that if $f$ is monotone, then $f'$ is monotone, and if $f$ is…

Computational Complexity · Computer Science 2025-12-16 Dor Minzer

Several recent works [DHLNSY25, CPPS25a, CPPS25b] have studied a model of property testing of Boolean functions under a \emph{relative-error} criterion. In this model, the distance from a target function $f: \{0,1\}^n \to \{0,1\}$ that is…

Computational Complexity · Computer Science 2026-03-24 Xi Chen , Anindya De , Yizhi Huang , Shivam Nadimpalli , Rocco A. Servedio , Tianqi Yang

We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…

Computational Complexity · Computer Science 2025-11-10 Mark Chen , Xi Chen , Hao Cui , William Pires , Jonah Stockwell

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…

Probability · Mathematics 2016-08-16 Raphaël Rossignol

We give a $\mathrm{poly}(\log n, 1/\epsilon)$-query adaptive algorithm for testing whether an unknown Boolean function $f: \{-1,1\}^n \to \{-1,1\}$, which is promised to be a halfspace, is monotone versus $\epsilon$-far from monotone. Since…

Computational Complexity · Computer Science 2017-06-20 Xi Chen , Rocco A. Servedio , Li-Yang Tan , Erik Waingarten

The model of relative-error property testing of Boolean functions has been the subject of significant recent research effort [CDH+24][CPPS25a][CPPS25b] In this paper we consider the problem of relative-error testing an unknown and arbitrary…

Computational Complexity · Computer Science 2025-10-27 Xi Chen , Diptaksho Palit , Kabir Peshawaria , William Pires , Rocco A. Servedio , Yiding Zhang

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer

We consider the problem of testing equality of functions $f_j:[0,1]\to \mathbb{R}$ for $j=1,2,...,J$ the basis of $J$ independent samples from possibly different distributions under the assumption that the functions are monotone. We provide…

Statistics Theory · Mathematics 2013-07-02 Cécile Durot , Piet Groeneboom , Hendrik P. Lopuhaä

Various properties of isoperimetric, functional, Transport-Entropy and concentration inequalities are studied on a Riemannian manifold equipped with a measure, whose generalized Ricci curvature is bounded from below. First, stability of…

Functional Analysis · Mathematics 2010-11-11 Emanuel Milman

We study monotonicity testing of high-dimensional distributions on $\{-1,1\}^n$ in the model of subcube conditioning, suggested and studied by Canonne, Ron, and Servedio~\cite{CRS15} and Bhattacharyya and Chakraborty~\cite{BC18}. Previous…

Statistics Theory · Mathematics 2025-02-25 Deeparnab Chakrabarty , Xi Chen , Simeon Ristic , C. Seshadhri , Erik Waingarten

Modern large-scale data analysis increasingly faces the challenge of achieving computational efficiency as well as statistical accuracy, as classical statistically efficient methods often fall short in the first regard. In the context of…

Statistics Theory · Mathematics 2026-02-02 Housen Li , Zhi Liu , Axel Munk

We study coarea inequalities for metric surfaces -- metric spaces that are topological surfaces, without boundary, and which have locally finite Hausdorff 2-measure $\mathcal{H}^2$. For monotone Sobolev functions $u\colon X \to \mathbb{R}…

Metric Geometry · Mathematics 2022-08-15 Behnam Esmayli , Toni Ikonen , Kai Rajala

We deal with monotonic regression of multivariate functions $f: Q \to \mathbb{R}$ on a compact rectangular domain $Q$ in $\mathbb{R}^d$, where monotonicity is understood in a generalized sense: as isotonicity in some coordinate directions…

Optimization and Control · Mathematics 2020-09-07 Jochen Schmid