English
Related papers

Related papers: Improved Monotonicity Testers via Hypercube Embedd…

200 papers

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 establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…

Functional Analysis · Mathematics 2019-12-10 Andrea Cianchi , Luboš Pick , Lenka Slavíková

A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in…

Computational Complexity · Computer Science 2018-06-05 Elena Grigorescu , Akash Kumar , Karl Wimmer

We give the first agnostic, efficient, proper learning algorithm for monotone Boolean functions. Given $2^{\tilde{O}(\sqrt{n}/\varepsilon)}$ uniformly random examples of an unknown function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$, our…

Data Structures and Algorithms · Computer Science 2023-05-25 Jane Lange , Arsen Vasilyan

We investigate adaptive sublinear algorithms for detecting monotone patterns in an array. Given fixed $2 \leq k \in \mathbb{N}$ and $\varepsilon > 0$, consider the problem of finding a length-$k$ increasing subsequence in an array $f \colon…

Data Structures and Algorithms · Computer Science 2019-11-05 Omri Ben-Eliezer , Shoham Letzter , Erik Waingarten

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

Sobolev-type embeddings on metric measure spaces encode a subtle interaction between the analytic regularity of functions and the geometry of the underlying domain space. In this paper we develop an embedding theory for variable…

Functional Analysis · Mathematics 2026-03-20 Ryan Alvarado , Michał Dymek , Przemysław Górka , Nijjwal Karak

Monotonicity is a key qualitative prediction of a wide array of economic models derived via robust comparative statics. It is therefore important to design effective and practical econometric methods for testing this prediction in empirical…

Statistics Theory · Mathematics 2019-07-10 Denis Chetverikov

We study the problem of testing whether a symmetric $d \times d$ input matrix $A$ is symmetric positive semidefinite (PSD), or is $\epsilon$-far from the PSD cone, meaning that $\lambda_{\min}(A) \leq - \epsilon \|A\|_p$, where $\|A\|_p$ is…

Data Structures and Algorithms · Computer Science 2023-10-26 Deanna Needell , William Swartworth , David P. Woodruff

We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$…

Data Structures and Algorithms · Computer Science 2019-10-07 Omri Ben-Eliezer , Clément L. Canonne , Shoham Letzter , Erik Waingarten

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Probability · Mathematics 2026-05-20 Saba Lepsveridze , Allen Lin

A construction of $p$-parameter Brownian sheet on the hypercube $C=[0,1]^p$ as a sum of $2^p$ independent Gaussian processes is obtained. The terms are closely related to Brownian pillows, and the probability laws of their $L^2(C)$ squared…

Statistics Theory · Mathematics 2025-10-09 A. Cabaña , E. M. Cabaña

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

Data Structures and Algorithms · Computer Science 2007-05-23 Yair Bartal , Manor Mendel

Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…

Functional Analysis · Mathematics 2013-11-04 Andrea Cianchi , Luboš Pick , Lenka Slavíková

Today, machine learning (ML) models are increasingly applied in decision making. This induces an urgent need for quality assurance of ML models with respect to (often domain-dependent) requirements. Monotonicity is one such requirement. It…

Machine Learning · Computer Science 2020-02-28 Arnab Sharma , Heike Wehrheim

The (low soundness) linearity testing problem for the middle slice of the Boolean cube is as follows. Let $\varepsilon>0$ and $f$ be a function on the middle slice on the Boolean cube, such that when choosing a uniformly random quadruple…

Combinatorics · Mathematics 2024-08-02 Gil Kalai , Noam Lifshitz , Dor Minzer , Tamar Ziegler

While raw cosine similarity in pretrained embedding spaces exhibits strong rank correlation with human judgments, anisotropy induces systematic miscalibration of absolute values: scores concentrate in a narrow high-similarity band…

Machine Learning · Computer Science 2026-01-26 Nicolas Tacheny

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…

Data Structures and Algorithms · Computer Science 2019-07-09 Maryam Aliakbarpour , Themis Gouleakis , John Peebles , Ronitt Rubinfeld , Anak Yodpinyanee

Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function…

Emerging Technologies · Computer Science 2014-08-19 Mathias Soeken , Robert Wille , Oliver Keszocze , D. Michael Miller , Rolf Drechsler