English

An Equal-Probability Partition of the Sample Space: A Non-parametric Inference from Finite Samples

Machine Learning 2025-07-30 v1 Machine Learning Methodology

Abstract

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of NN observations drawn from it. The central finding is that the NN sorted sample points partition the real line into N+1N+1 segments, each carrying an expected probability mass of exactly 1/(N+1)1/(N+1). This non-parametric result, which follows from fundamental properties of order statistics, holds regardless of the underlying distribution's shape. This equal-probability partition yields a discrete entropy of log2(N+1)\log_2(N+1) bits, which quantifies the information gained from the sample and contrasts with Shannon's results for continuous variables. I compare this partition-based framework to the conventional ECDF and discuss its implications for robust non-parametric inference, particularly in density and tail estimation.

Keywords

Cite

@article{arxiv.2507.21712,
  title  = {An Equal-Probability Partition of the Sample Space: A Non-parametric Inference from Finite Samples},
  author = {Urban Eriksson},
  journal= {arXiv preprint arXiv:2507.21712},
  year   = {2025}
}