English
Related papers

Related papers: Comparison Graphs: a Unified Method for Uniformity…

200 papers

We investigate the problem of jointly testing two hypotheses and estimating a random parameter based on data that is observed sequentially by sensors in a distributed network. In particular, we assume the data to be drawn from a Gaussian…

Signal Processing · Electrical Eng. & Systems 2020-03-04 Dominik Reinhard , Michael Fauß , Abdelhak M. Zoubir

We study experiment design for unique identification of the causal graph of a simple SCM, where the graph may contain cycles. The presence of cycles in the structure introduces major challenges for experiment design as, unlike acyclic…

Machine Learning · Computer Science 2023-12-15 Ehsan Mokhtarian , Saber Salehkaleybar , AmirEmad Ghassami , Negar Kiyavash

A set family ${\cal F}$ is called intersecting if every two members of ${\cal F}$ intersect, and it is called uniform if all members of ${\cal F}$ share a common size. A uniform family ${\cal F} \subseteq \binom{[n]}{k}$ of $k$-subsets of…

Data Structures and Algorithms · Computer Science 2024-07-19 Ishay Haviv , Michal Parnas

The problem of characterizing testable graph properties (properties that can be tested with a number of queries independent of the input size) is a fundamental problem in the area of property testing. While there has been some extensive…

Data Structures and Algorithms · Computer Science 2019-09-25 Artur Czumaj , Christian Sohler

We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the…

Combinatorics · Mathematics 2008-03-11 Laszlo Lovasz , Balazs Szegedy

We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…

Data Structures and Algorithms · Computer Science 2023-08-23 Diptarka Chakraborty , Sourav Chakraborty , Gunjan Kumar

Assessing goodness of fit to a given distribution plays an important role in computational statistics. The Probability integral transformation (PIT) can be used to convert the question of whether a given sample originates from a reference…

Methodology · Statistics 2022-12-22 Teemu Säilynoja , Paul-Christian Bürkner , Aki Vehtari

We study the problem of two-sample comparison with categorical data when the contingency table is sparsely populated. In modern applications, the number of categories is often comparable to the sample size, causing existing methods to have…

Methodology · Statistics 2014-08-14 Hao Chen , Nancy R. Zhang

The problem of out-of-distribution detection for graph classification is far from being solved. The existing models tend to be overconfident about OOD examples or completely ignore the detection task. In this work, we consider this problem…

Machine Learning · Computer Science 2022-06-23 Gleb Bazhenov , Sergei Ivanov , Maxim Panov , Alexey Zaytsev , Evgeny Burnaev

Testing for the equality of two high-dimensional distributions is a challenging problem, and this becomes even more challenging when the sample size is small. Over the last few decades, several graph-based two-sample tests have been…

Methodology · Statistics 2019-11-22 Soham Sarkar , Rahul Biswas , Anil K. Ghosh

In this paper, we revisit the classical goodness-of-fit problems for univariate distributions; we propose a new testing procedure based on a characterisation of the uniform distribution. Asymptotic theory for the simple hypothesis case is…

Methodology · Statistics 2021-08-17 Bruno Ebner , Shawn Liebenberg , Jaco Visagie

A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a "certificate" to the…

Combinatorics · Mathematics 2013-04-09 Lior Gishboliner , Asaf Shapira

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

There is an increasing interest in algorithms to learn invariant correlations across training environments. A big share of the current proposals find theoretical support in the causality literature but, how useful are they in practice? The…

Machine Learning · Computer Science 2021-02-23 Benjamin Aubin , Agnieszka Słowik , Martin Arjovsky , Leon Bottou , David Lopez-Paz

In many fairness and distribution robustness problems, one has access to labeled data from multiple source distributions yet the test data may come from an arbitrary member or a mixture of them. We study the problem of constructing a…

Machine Learning · Computer Science 2026-01-07 Yuqi Yang , Ying Jin

We consider the problem of goodness-of-fit testing for a model that has at least one unknown parameter that cannot be eliminated by transformation. Examples of such problems can be as simple as testing whether a sample consists of…

Methodology · Statistics 2021-04-28 Sean van der Merwe

In this paper we propose a nonparametric graphical test based on optimal matching, for assessing the equality of multiple unknown multivariate probability distributions. Our procedure pools the data from the different classes to create a…

Although several nonparametric tests are available for testing population identical distributions or equal means in multiple groups problem, the Van der Waerden test has asymptotically the same efficiency as the classical one-way analysis…

Methodology · Statistics 2022-03-07 Elsayed Elamir

Hypothesis testing is a statistical method used to draw conclusions about populations from sample data, typically represented in tables. With the prevalence of graph representations in real-life applications, hypothesis testing in graphs is…

Machine Learning · Statistics 2025-02-27 Yun Wang , Chrysanthi Kosyfaki , Sihem Amer-Yahia , Reynold Cheng

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs