English
Related papers

Related papers: Sharp Thresholds for Monotone Non Boolean Function…

200 papers

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

Machine Learning · Computer Science 2024-10-23 Alexandros Eskenazis , Paata Ivanisvili , Lauritz Streck

Stationary points or derivative zero crossings of a regression function correspond to points where a trend reverses, making their estimation scientifically important. Existing approaches to uncertainty quantification for stationary points…

Methodology · Statistics 2025-12-10 Michael Price , Debdeep Pati , Ning Ning

We give sharp, uniform estimates for the probability that the empirical distribution function for n uniform-[0,1] random variables stays to one side of a given line.

Probability · Mathematics 2008-05-02 Kevin Ford

Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…

Numerical Analysis · Mathematics 2012-07-13 Tong Sun

We describe a $\tilde{O}(d^{5/6})$-query monotonicity tester for Boolean functions $f:[n]^d \to \{0,1\}$ on the $n$-hypergrid. This is the first $o(d)$ monotonicity tester with query complexity independent of $n$. Motivated by this…

Discrete Mathematics · Computer Science 2019-12-11 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

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

Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…

Computational Complexity · Computer Science 2015-08-14 Xi Chen , Igor C. Oliveira , Rocco A. Servedio

We study the $p$-\emph{torsion function} and the corresponding $p$-\emph{torsional rigidity} associated with $p$-Laplacians and, more generally, $p$-Schr\"odinger operators, for $1<p<\infty$, on possibly infinite combinatorial graphs. We…

Spectral Theory · Mathematics 2024-10-14 Patrizio Bifulco , Delio Mugnolo

Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…

Computational Complexity · Computer Science 2010-11-23 Florian Richoux

Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\{1,\dots,x\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field…

Number Theory · Mathematics 2016-08-15 Paul Balister , Béla Bollobás , Robert Morris

We introduce a new notion of influence for symmetric convex sets over Gaussian space, which we term "convex influence". We show that this new notion of influence shares many of the familiar properties of influences of variables for monotone…

Computational Complexity · Computer Science 2021-09-08 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

We consider a nonparametric Bayesian approach to estimation and testing for a multivariate monotone density. Instead of following the conventional Bayesian route of putting a prior distribution complying with the monotonicity restriction,…

Statistics Theory · Mathematics 2023-06-09 Kang Wang , Subhashis Ghosal

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson

We consider sequences of symmetric $U$-statistics, not necessarily Hoeffding-degenerate, both in a one- and multi-dimensional setting, and prove quantitative central limit theorems (CLTs) based on the use of {\it contraction operators}. Our…

Probability · Mathematics 2021-04-01 Christian Döbler , Giovanni Peccati

We use geometric methods to obtain a sharp exponential integrability result for boundary traces of monotone Sobolev functions defined on the unit ball.

Analysis of PDEs · Mathematics 2007-05-23 Pekka Pankka , Pietro Poggi-Corradini , Kai Rajala

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…

Computational Complexity · Computer Science 2025-11-19 Daniel M. Kane , Anthony Ostuni , Kewen Wu

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

Classical Analysis and ODEs · Mathematics 2016-09-08 Adrian Fellhauer

Consider a real-valued function that can only be observed with stochastic noise at a finite set of design points within a Euclidean space. We wish to determine whether there exists a convex function that goes through the true function…

Other Statistics · Statistics 2018-07-30 Nanjing Jian , Shane G. Henderson

A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption…

Optimization and Control · Mathematics 2014-06-23 Achill Schürmann