English
Related papers

Related papers: Testing Determinantal Point Processes

200 papers

Application of ensemble of neural networks is becoming an imminent tool for advancing the state-of-the-art in deep reinforcement learning algorithms. However, training these large numbers of neural networks in the ensemble has an…

Machine Learning · Computer Science 2022-05-18 Hassam Sheikh , Kizza Frisbee , Mariano Phielipp

Given samples from an unknown distribution $p$, is it possible to distinguish whether $p$ belongs to some class of distributions $\mathcal{C}$ versus $p$ being far from every distribution in $\mathcal{C}$? This fundamental question has…

Data Structures and Algorithms · Computer Science 2015-12-09 Jayadev Acharya , Constantinos Daskalakis , Gautam Kamath

We introduce topological differential testing (TDT), an approach to extracting the consensus behavior of a set of programs on a corpus of inputs. TDT uses the topological notion of a simplicial complex (and implicitly draws on richer…

Software Engineering · Computer Science 2020-03-06 Kristopher Ambrose , Steve Huntsman , Michael Robinson , Matvey Yutin

The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…

Probability · Mathematics 2015-06-26 Alexander Soshnikov

We consider the problem of approximating a function from $L^2$ by an element of a given $m$-dimensional space $V_m$, associated with some feature map $\boldsymbol{\varphi}$, using evaluations of the function at random points $x_1,…

Numerical Analysis · Mathematics 2025-08-01 Anthony Nouy , Bertrand Michel

For a property $P$ and a sub-property $P'$, we say that $P$ is $P'$-partially testable with $q$ queries if there exists an algorithm that distinguishes, with high probability, inputs in $P'$ from inputs $\epsilon$-far from $P$ by using $q$…

Computational Complexity · Computer Science 2013-06-07 Eldar Fischer , Yonatan Goldhirsh , Oded Lachish

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

DPPs were introduced by Macchi as a model in quantum optics the 1970s. Since then, they have been widely used as models and subsampling tools in statistics and computer science. Most applications require sampling from a DPP, and given their…

Computation · Statistics 2023-11-23 Rémi Bardenet , Michaël Fanuel , Alexandre Feller

Reliable uncertainty estimates are crucial in modern machine learning. Deep Gaussian Processes (DGPs) and Deep Sigma Point Processes (DSPPs) extend GPs hierarchically, offering promising methods for uncertainty quantification grounded in…

Machine Learning · Statistics 2025-04-25 Matthijs van der Lende , Jeremias Lino Ferrao , Niclas Müller-Hof

Deep neural networks have made tremendous gains in emulating human-like intelligence, and have been used increasingly as ways of understanding how the brain may solve the complex computational problems on which this relies. However, these…

Machine Learning · Computer Science 2024-01-24 Shanka Subhra Mondal , Steven Frankland , Taylor Webb , Jonathan D. Cohen

We study the general problem of testing whether an unknown distribution belongs to a specified family of distributions. More specifically, given a distribution family $\mathcal{P}$ and sample access to an unknown discrete distribution…

Data Structures and Algorithms · Computer Science 2017-08-09 Clément L. Canonne , Ilias Diakonikolas , Alistair Stewart

The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…

Data Structures and Algorithms · Computer Science 2015-04-27 Clément L. Canonne

Denoising Diffusion Probabilistic Models (DDPMs) are a very popular class of deep generative model that have been successfully applied to a diverse range of problems including image and video generation, protein and material synthesis,…

We investigate the problem of identity testing for multidimensional histogram distributions. A distribution $p: D \rightarrow \mathbb{R}_+$, where $D \subseteq \mathbb{R}^d$, is called a $k$-histogram if there exists a partition of the…

Data Structures and Algorithms · Computer Science 2019-02-20 Ilias Diakonikolas , Daniel M. Kane , John Peebles

Motivated by the question of data quantization and "binning," we revisit the problem of identity testing of discrete probability distributions. Identity testing (a.k.a. one-sample testing), a fundamental and by now well-understood problem…

Data Structures and Algorithms · Computer Science 2020-04-28 Clément L. Canonne , Karl Wimmer

Denoising diffusion probabilistic models (DDPM) are a class of generative models which have recently been shown to produce excellent samples. We show that with a few simple modifications, DDPMs can also achieve competitive log-likelihoods…

Machine Learning · Computer Science 2021-02-22 Alex Nichol , Prafulla Dhariwal

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

In recent years, there has been a growing interest in statistical methods that exhibit robust performance under distribution changes between training and test data. While most of the related research focuses on point predictions with the…

Methodology · Statistics 2024-06-18 Alexander Henzi , Xinwei Shen , Michael Law , Peter Bühlmann

The problem of detecting anomalies in multiple processes is considered. We consider a composite hypothesis case, in which the measurements drawn when observing a process follow a common distribution with an unknown parameter (vector), whose…

Information Theory · Computer Science 2020-04-22 Bar Hemo , Tomer Gafni , Kobi Cohen , Qing Zhao

A $k$-modal probability distribution over the discrete domain $\{1,...,n\}$ is one whose histogram has at most $k$ "peaks" and "valleys." Such distributions are natural generalizations of monotone ($k=0$) and unimodal ($k=1$) probability…

Data Structures and Algorithms · Computer Science 2014-09-16 Constantinos Daskalakis , Ilias Diakonikolas , Rocco A. Servedio