English
Related papers

Related papers: Hard-to-Sample Distributions from Robust Extractor…

200 papers

We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the $\ell\_p$ ball for $p \in [1, \infty]$ and Gaussian noise with an arbitrary covariance matrix. We…

Machine Learning · Computer Science 2018-06-25 Jean-Yves Franceschi , Alhussein Fawzi , Omar Fawzi

We construct an explicit distribution $\mathbf{D}$ over $\{0,1\}^N$ that exhibits an essentially optimal separation between adaptive and non-adaptive cell-probe sampling. The distribution can be sampled exactly when each output bit is…

Computational Complexity · Computer Science 2026-05-14 Farzan Byramji , Daniel M. Kane , Jackson Morris , Anthony Ostuni

Diffusion models struggle to produce samples that respect constraints, a common requirement in scientific applications. Recent approaches have introduced regularization terms in the loss or guidance methods during sampling to enforce such…

Machine Learning · Computer Science 2026-02-06 Victor M. Yeom-Song , Severi Rissanen , Arno Solin , Samuel Kaski , Mingfei Sun

We study robust testing and estimation of discrete distributions in the strong contamination model. We consider both the "centralized setting" and the "distributed setting with information constraints" including communication and local…

Information Theory · Computer Science 2021-04-23 Jayadev Acharya , Ziteng Sun , Huanyu Zhang

Model Extraction attacks exploit the target model's prediction API to create a surrogate model in order to steal or reconnoiter the functionality of the target model in the black-box setting. Several recent studies have shown that a…

Machine Learning · Computer Science 2022-02-25 Amir Mahdi Sadeghzadeh , Amir Mohammad Sobhanian , Faezeh Dehghan , Rasool Jalili

In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we…

Data Structures and Algorithms · Computer Science 2016-05-10 Ilias Diakonikolas , Daniel M. Kane

We develop an efficient algorithm for weak recovery in a robust version of the stochastic block model. The algorithm matches the statistical guarantees of the best known algorithms for the vanilla version of the stochastic block model. In…

Machine Learning · Computer Science 2021-11-17 Jingqiu Ding , Tommaso d'Orsi , Rajai Nasser , David Steurer

This paper addresses the issues of conservativeness and computational complexity of probabilistic robustness analysis. We solve both issues by defining a new sampling strategy and robustness measure. The new measure is shown to be much less…

Applications · Statistics 2008-05-12 Xinjia Chen , Kemin Zhou , Jorge L. Aravena

While there has been much recent progress using deep learning techniques to separate speech and music audio signals, these systems typically require large collections of isolated sources during the training process. When extending audio…

Sound · Computer Science 2020-09-01 Fatemeh Pishdadian , Gordon Wichern , Jonathan Le Roux

One-step generators distilled from Masked Diffusion Models (MDMs) compress multiple sampling steps into a single forward pass, enabling efficient text and image synthesis. However, they suffer two key limitations: they inherit modeling bias…

Computer Vision and Pattern Recognition · Computer Science 2026-03-20 Yuanzhi Zhu , Xi Wang , Stéphane Lathuilière , Vicky Kalogeiton

This paper deals with the problem of outliers in high frequency observation data from diffusion processes. Robust estimation methods are needed because the inclusion of outliers can lead to incorrect statistical inference even in the…

Methodology · Statistics 2026-03-06 Tomoyuki Nakagawa , Yusuke Shimizu

A new weak measurement procedure is introduced for finite samples which yields accurate weak values that are outside the range of eigenvalues and which do not require an exponentially rare ensemble. This procedure provides a unique…

Quantum Physics · Physics 2009-11-13 Jeff Tollaksen

Distribution testing deals with what information can be deduced about an unknown distribution over $\{1,\ldots,n\}$, where the algorithm is only allowed to obtain a relatively small number of independent samples from the distribution. In…

Computational Complexity · Computer Science 2016-09-23 Eldar Fischer , Oded Lachish , Yadu Vasudev

Traditional sampling theories consider the problem of reconstructing an unknown signal $x$ from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that $x$ lies in a known subspace.…

Cellular Automata and Lattice Gases · Physics 2009-03-30 Yonina C. Eldar , Moshe Mishali

Sampling from circular distributions is a fundamental task in directional statistics. A key challenge in acceptance-rejection methods lies in selecting an efficient envelope density, as poor choices can lead to low acceptance rates and…

Methodology · Statistics 2025-06-17 Surojit Biswas , Buddhananda Banerjee

The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion…

Quantum Physics · Physics 2019-01-14 Matthew Coudron , Jalex Stark , Thomas Vidick

We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings. The traditional likelihood-based estimators lack resilience against outliers, a critical issue when dealing with high-dimensional…

Methodology · Statistics 2013-07-12 Aurélie C. Lozano , Nicolai Meinshausen

A crucial part of data analysis is the validation of the resulting estimators, in particular, if several competing estimators need to be compared. Whether an estimator can be objectively validated is not a trivial property. If there exists…

Statistics Theory · Mathematics 2024-05-17 Tino Werner

We show that two related classes of algorithms, stable algorithms and Boolean circuits with bounded depth, cannot produce an approximate sample from the uniform measure over the set of solutions to the symmetric binary perceptron model at…

Probability · Mathematics 2025-07-04 Ahmed El Alaoui , David Gamarnik

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal