Median trick, the Glossary
The median trick is a generic approach that increases the chances of a probabilistic algorithm to succeed.[1]
Table of Contents
8 relations: Approximate counting algorithm, Chernoff bound, Hash function, Median, Number, Randomized algorithm, Regression analysis, Time complexity.
- Statistical randomness
Approximate counting algorithm
The approximate counting algorithm allows the counting of a large number of events using a small amount of memory.
See Median trick and Approximate counting algorithm
Chernoff bound
In probability theory, a Chernoff bound is an exponentially decreasing upper bound on the tail of a random variable based on its moment generating function.
See Median trick and Chernoff bound
Hash function
A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support variable length output.
See Median trick and Hash function
The median of a set of numbers is the value separating the higher half from the lower half of a data sample, a population, or a probability distribution.
Number
A number is a mathematical object used to count, measure, and label.
Randomized algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure.
See Median trick and Randomized algorithm
Regression analysis
In statistical modeling, regression analysis is a set of statistical processes for estimating the relationships between a dependent variable (often called the 'outcome' or 'response' variable, or a 'label' in machine learning parlance) and one or more independent variables (often called 'predictors', 'covariates', 'explanatory variables' or 'features').
See Median trick and Regression analysis
Time complexity
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.
See Median trick and Time complexity
See also
Statistical randomness
- Accuracy and precision
- Algebra of random variables
- Alignments of random points
- Clustering illusion
- Complete spatial randomness
- Concentration dimension
- Control variates
- Differential entropy
- Entropy (information theory)
- Entropy estimation
- Exchangeable random variables
- Gaussian process emulator
- Index of dispersion
- Infinite monkey theorem
- Information fluctuation complexity
- Low-discrepancy sequences
- Martingale theory
- Median trick
- Monte Carlo methods
- Poisson random measure
- Proofs of convergence of random variables
- Pseudorandomness
- Random binary tree
- Random compact set
- Random element
- Random matrices
- Random number generation
- Random sequence
- Random variable
- Random variate
- Randomized algorithms
- Randomness
- Randomness test
- Seven states of randomness
- Statistical fluctuations
- Statistical randomness
- Stochastic computing
- Stochastic processes