English
Related papers

Related papers: Optimal Unateness Testers for Real-Valued Function…

200 papers

We study the fundamental problem of learning the parameters of a high-dimensional Gaussian in the presence of noise -- where an $\varepsilon$-fraction of our samples were chosen by an adversary. We give robust estimators that achieve…

Data Structures and Algorithms · Computer Science 2017-11-07 Ilias Diakonikolas , Gautam Kamath , Daniel M. Kane , Jerry Li , Ankur Moitra , Alistair Stewart

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on score functions derived from nearest neighbor graphs on $n$-point nominal data. Anomalies are declared whenever the score of a test…

Machine Learning · Computer Science 2009-10-29 Manqi Zhao , Venkatesh Saligrama

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Computational Complexity · Computer Science 2014-03-28 Prahladh Harsha , Adam Klivans , Raghu Meka

In this paper, we investigate the adequacy testing problem of high-dimensional factor-augmented regression model. Existing test procedures perform not well under dense alternatives. To address this critical issue, we introduce a novel…

Methodology · Statistics 2025-04-04 Yanmei Shi , Leheng Cai , Xu Guo , Shurong Zheng

Assessing forecasting performance is a time intensive activity, often requiring months or years before we know whether or not the reported forecasts were accurate. Cognitive tests can be quickly administered and are predictive of…

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

For any Boolean function $f:\{0,1\}^n \to \{0,1\}$ with a complexity measure having value $k \ll n$, is it possible to restrict the function $f$ to $\Theta(k)$ variables while keeping the complexity preserved at $\Theta(k)$? This question,…

Computational Complexity · Computer Science 2026-05-22 Chandrima Kayal , Rajat Mittal , Sai Soumya Nalli , Manaswi Paraashar , Karthikeya Polisetty , Jayalal Sarma , Nitin Saurabh

Over the last decade, approximating functions in infinite dimensions from samples has gained increasing attention in computational science and engineering, especially in computational uncertainty quantification. This is primarily due to the…

Numerical Analysis · Mathematics 2023-10-18 Ben Adcock , Nick Dexter , Sebastian Moraga

In this paper, I construct a new test of conditional moment inequalities, which is based on studentized kernel estimates of moment functions with many different values of the bandwidth parameter. The test automatically adapts to the unknown…

Applications · Statistics 2012-01-06 Denis Chetverikov

In this paper, we investigate score function-based tests to check the significance of an ultrahigh-dimensional sub-vector of the model coefficients when the nuisance parameter vector is also ultrahigh-dimensional in linear models. We first…

Methodology · Statistics 2024-11-12 Weichao Yang , Xu Guo , Lixing Zhu

The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…

Numerical Analysis · Mathematics 2025-07-24 Carlos Beltrán

We provide general adaptive upper bounds for estimating nonparametric functionals based on second order U-statistics arising from finite dimensional approximation of the infinite dimensional models. We then provide examples of functionals…

Statistics Theory · Mathematics 2021-06-07 Lin Liu , Rajarshi Mukherjee , James Robins , Eric Tchetgen Tchetgen

We study the problem of adaptive variable selection in a Gaussian white noise model of intensity $\varepsilon$ under certain sparsity and regularity conditions on an unknown regression function $f$. The $d$-variate regression function $f$…

Statistics Theory · Mathematics 2024-03-04 Natalia Stepanova , Marie Turcicova

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

Data Structures and Algorithms · Computer Science 2018-11-02 Nathaniel Harms

Estimating properties of unknown unitary operations is a fundamental task in quantum information science. While full unitary tomography requires a number of samples to the unknown unitary scaling linearly with the dimension (implying…

Quantum Physics · Physics 2025-09-10 Daiki Suruga

Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \emph{known}…

Data Structures and Algorithms · Computer Science 2019-02-07 Domagoj Bradac , Sahil Singla , Goran Zuzic

We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of…

Computational Complexity · Computer Science 2015-06-24 Sheela Devadas , Ronitt Rubinfeld

Given $n$ samples of a function $f\colon D\to\mathbb C$ in random points drawn with respect to a measure $\varrho_S$ we develop theoretical analysis of the $L_2(D, \varrho_T)$-approximation error. For a parituclar choice of $\varrho_S$…

Numerical Analysis · Mathematics 2024-08-29 Felix Bartel

We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, based on any lossless data compression method even if the…

Information Theory · Computer Science 2007-07-13 Boris Ryabko , Jaakko Astola

Due to the broad applications of elliptical models, there is a long line of research on goodness-of-fit tests for empirically validating them. However, the existing literature on this topic is generally confined to low-dimensional settings,…

Statistics Theory · Mathematics 2025-03-04 Siyao Wang , Miles E. Lopes