Bias detection between two histograms can be done by checking a random subset of bins, with a PAC guarantee that depends on the fraction of violating bins.
Markov processes over denumerable products of spaces, describing large systems of automata,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances
Bias detection between two histograms can be done by checking a random subset of bins, with a PAC guarantee that depends on the fraction of violating bins.