English
Related papers

Related papers: Isoperimetric Inequalities for Real-Valued Functio…

200 papers

In this paper, we propose a new test for the equality of several covariance functions for functional data. Its test statistic is taken as the supremum value of the sum of the squared differences between the estimated individual covariance…

Methodology · Statistics 2016-09-16 Jia Guo , Bu Zhou , Jin-Ting Zhang

We give an adaptive algorithm which tests whether an unknown Boolean function $f\colon \{0, 1\}^n \to\{0, 1\}$ is unate, i.e. every variable of $f$ is either non-decreasing or non-increasing, or $\epsilon$-far from unate with one-sided…

Computational Complexity · Computer Science 2017-08-22 Xi Chen , Erik Waingarten , Jinyu Xie

We define a measure for the complexity of Boolean functions related to their implementation in neural networks, and in particular close related to the generalization ability that could be obtained through the learning process. The measure…

Disordered Systems and Neural Networks · Physics 2007-05-23 Leonardo Franco

The ill-posedness of the inverse problem of recovering a regression function in a nonparametric instrumental variable model leads to estimators that may suffer from a very slow, logarithmic rate of convergence. In this paper, we show that…

Applications · Statistics 2017-09-27 Denis Chetverikov , Daniel Wilhelm

We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…

Quantum Physics · Physics 2016-07-01 Scott Aaronson , Andris Ambainis , Jānis Iraids , Martins Kokainis , Juris Smotrovs

Affine isoperimetric inequalities for the functional radial mean bodies are derived from the new affine chord Sobolev inequalities, which extend the recent affine isoperimetric inequalities of Haddad and Ludwig from convex bodies to…

Metric Geometry · Mathematics 2026-02-17 Fernanda M. Baêta , Xiaxing Cai

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…

Computational Complexity · Computer Science 2020-01-08 Susanna F. de Rezende , Or Meir , Jakob Nordström , Toniann Pitassi , Robert Robere , Marc Vinyals

We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…

Computational Complexity · Computer Science 2013-01-07 Adam Klivans , Raghu Meka

We consider the nonparametric regression problem with multiple predictors and an additive error, where the regression function is assumed to be coordinatewise nondecreasing. We propose a Bayesian approach to make an inference on the…

Statistics Theory · Mathematics 2022-11-24 Kang Wang , Subhashis Ghosal

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…

Data Structures and Algorithms · Computer Science 2011-12-30 Eric Blais , Amit Weinstein , Yuichi Yoshida

An inequality by Samorodnitsky states that if $f : \mathbb{F}_2^n \to \mathbb{R}$ is a nonnegative boolean function, and $S \subseteq [n]$ is chosen by randomly including each coordinate with probability a certain $\lambda = \lambda(q,\rho)…

Information Theory · Computer Science 2025-08-12 Olakunle S. Abawonse , Jan Hazla , Ryan O'Donnell

We study the problem of {\sl certification}: given queries to a function $f : \{0,1\}^n \to \{0,1\}$ with certificate complexity $\le k$ and an input $x^\star$, output a size-$k$ certificate for $f$'s value on $x^\star$. This abstractly…

Data Structures and Algorithms · Computer Science 2022-04-08 Guy Blanc , Caleb Koch , Jane Lange , Li-Yang Tan

The degree-$d$ Chow parameters of a Boolean function $f: \{-1,1\}^n \to \mathbb{R}$ are its degree at most $d$ Fourier coefficients. It is well-known that degree-$d$ Chow parameters uniquely characterize degree-$d$ polynomial threshold…

Machine Learning · Computer Science 2018-11-09 Ilias Diakonikolas , Daniel M. Kane

We study the asymptotic behavior of three classes of nonlocal functionals in complete metric spaces equipped with a doubling measure and supporting a Poincar\'e inequality. We show that the limits of these nonlocal functionals are…

Functional Analysis · Mathematics 2023-10-16 Panu Lahti , Andrea Pinamonti , Xiaodan Zhou

This paper studies the hazard-free formula complexity of Boolean functions. Our first result shows that unate functions are the only Boolean functions for which the monotone formula complexity of the hazard-derivative equals the hazard-free…

Computational Complexity · Computer Science 2025-06-17 Leah London Arazi , Amir Shpilka

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…

Optimization and Control · Mathematics 2026-05-08 Nicholas Pischke , Thomas Powell

In this paper, we investigate the minimization of a functional in which the usual perimeter is competing with a nonlocal singular term comparable (but not necessarily equal to) a fractional perimeter. The motivation for this problem is a…

Analysis of PDEs · Mathematics 2020-09-09 Antoine Mellet , Yijing Wu

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

Probability · Mathematics 2023-12-25 Thomas Anton , Sutanuka Roy , Rabee Tourky

We present the proof of several inequalities using the technique introduced by Alexandroff, Bakelman, and Pucci to establish their ABP estimate. First, we give a new and simple proof of a lower bound of Berestycki, Nirenberg, and Varadhan…

Analysis of PDEs · Mathematics 2015-10-20 Xavier Cabre