Numerically more stable computation of the p-values for the two-sample Kolmogorov-Smirnov test

02/16/2021
by   Thomas Viehmann, et al.
0

The two-sample Kolmogorov-Smirnov test is a widely used statistical test for detecting whether two samples are likely to come from the same distribution. Implementations typically recur on an article of Hodges from 1957. The advances in computation speed make it feasible to compute exact p-values for a much larger range of problem sizes, but these run into numerical stability problems from floating point operations. We provide a simple transformation of the defining recurrence for the two-side two-sample KS test that avoids this.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2019

Study on upper limit of sample sizes for a two-level test in NIST SP800-22

NIST SP800-22 is one of the widely used statistical testing tools for ps...
research
11/13/2020

Why Not to Use Binary Floating Point Datatypes in RDF

The XSD binary floating point datatypes are regularly used for precise n...
research
11/08/2022

Summation Problem Revisited – More Robust Computation

Numerical data processing is a key task across different fields of compu...
research
09/20/2018

FFT Convolutions are Faster than Winograd on Modern CPUs, Here is Why

Winograd-based convolution has quickly gained traction as a preferred ap...
research
02/27/2018

Reproducible Floating-Point Aggregation in RDBMSs

Industry-grade database systems are expected to produce the same result ...
research
07/03/2023

A numerical variability approach to results stability tests and its application to neuroimaging

Ensuring the long-term reproducibility of data analyses requires results...
research
05/29/2022

Bayes Classification using an approximation to the Joint Probability Distribution of the Attributes

The Naive-Bayes classifier is widely used due to its simplicity, speed a...

Please sign up or login with your details

Forgot password? Click here to reset