English
Related papers

Related papers: A $d^{1/2+o(1)}$ Monotonicity Tester for Boolean F…

200 papers

We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…

Information Theory · Computer Science 2020-09-08 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of finding a stationary point, which…

Optimization and Control · Mathematics 2025-05-15 Huanjian Zhou , Andi Han , Akiko Takeda , Masashi Sugiyama

This paper explores the connection between classical isoperimetric inequalities, their directed analogues, and monotonicity testing. We study the setting of real-valued functions $f : [0,1]^d \to \mathbb{R}$ on the solid unit cube, where…

Data Structures and Algorithms · Computer Science 2024-10-03 Renato Ferreira Pinto

This paper explores testing unit roots based on least absolute deviations (LAD) regression under unconditional heteroskedasticity. We first derive the asymptotic properties of the LAD estimator for a first-order autoregressive process with…

Methodology · Statistics 2024-10-18 Jilin Wu , Ruike Wu , Zhijie Xiao

We introduce a rigorous and sensitive significance test for hyperuniformity that yields reliable results even from a single sample. Our approach is based on a detailed analysis of the empirical Fourier transform of a stationary point…

Statistics Theory · Mathematics 2026-03-23 Michael A. Klatt , Günter Last , Norbert Henze

The $N=\infty$ vector $O(N)$ model is a solvable, interacting field theory in three dimensions ($D$). In a recent paper with A. Chubukov and J. Ye~\cite{self}, we have computed a universal number, $\tilde{c}$, characterizing the size…

High Energy Physics - Theory · Physics 2009-10-22 Subir Sachdev

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

A new computationally efficient dependence measure, and an adaptive statistical test of independence, are proposed. The dependence measure is the difference between analytic embeddings of the joint distribution and the product of the…

Machine Learning · Statistics 2016-10-18 Wittawat Jitkrittum , Zoltan Szabo , Arthur Gretton

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

Data Structures and Algorithms · Computer Science 2023-08-22 Rohan Ghuge , Anupam Gupta , Viswanath Nagarajan

We propose a nonparametric test of spatial independence for data observed on irregular, non-lattice point clouds $\mathcal{V}_{n}\subset\mathbb{R}^{2}$. For each location $v\in\mathcal{V}_{n}$, we encode the local spatial configuration…

We consider a stochastic nonlinear defocusing Schr\"{o}dinger equation with zero-order linear damping, where the stochastic forcing term is given by a combination of a linear multiplicative noise in the Stratonovich form and a nonlinear…

Probability · Mathematics 2023-07-10 Zdzisław Brzeźniak , Benedetta Ferrario , Margherita Zanella

We develop here several goodness-of-fit tests for testing the k-monotonicity of a discrete density, based on the empirical distribution of the observations. Our tests are non-parametric, easy to implement and are proved to be asymptotically…

Methodology · Statistics 2017-08-30 Jade Giguelay , Sylvie Huet

We prove that for certain positive operators $T$, such as the Hardy-Littlewood maximal function and fractional integrals, there is a constant $D>1$, depending only on the dimension $n$, such that the two weight norm inequality…

Classical Analysis and ODEs · Mathematics 2019-09-13 Tuomas P. Hytönen , Kangwei Li , Eric T. Sawyer

The study of the interplay between the testability of properties of Boolean functions and the invariances acting on their domain which preserve the property was initiated by Kaufman and Sudan (STOC 2008). Invariance with respect to…

Data Structures and Algorithms · Computer Science 2010-10-26 Arnab Bhattacharyya , Elena Grigorescu , Asaf Shapira

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…

Computational Complexity · Computer Science 2026-03-10 Nikolai Chukhin , Alexander S. Kulikov , Ivan Mihajlin , Arina Smirnova

Multi-parameter one-sided hypothesis test problems arise naturally in many applications. We are particularly interested in effective tests for monitoring multiple quality indices in forestry products. Our search reveals that there are many…

Statistics Theory · Mathematics 2017-03-16 Guangyu Zhu , Jiahua Chen

Recently, there has been significant work studying distribution testing under the Conditional Sampling model. In this model, a query specifies a subset $S$ of the domain, and the output received is a sample drawn from the distribution…

Data Structures and Algorithms · Computer Science 2020-11-05 Shyam Narayanan

A recent model for property testing of probability distributions (Chakraborty et al., ITCS 2013, Canonne et al., SICOMP 2015) enables tremendous savings in the sample complexity of testing algorithms, by allowing them to condition the…

Data Structures and Algorithms · Computer Science 2018-12-10 Jayadev Acharya , Clément L. Canonne , Gautam Kamath

A natural problem in high-dimensional inference is to decide if a classifier $f:\mathbb{R}^n \rightarrow \{-1,1\}$ depends on a small number of linear directions of its input data. Call a function $g: \mathbb{R}^n \rightarrow \{-1,1\}$, a…

Computational Complexity · Computer Science 2021-01-14 Anindya De , Elchanan Mossel , Joe Neeman

This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…

Data Structures and Algorithms · Computer Science 2014-07-16 Virendra Sule