Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting.
Wentao YangVipul HarshEdgar SolomonikPublished in: CoRR (2022)
Keyphrases
- sample size
- worst case
- upper bound
- model selection
- small sample size
- random sampling
- small sample
- number of training samples
- statistical power
- progressive sampling
- covariance matrix
- computational complexity
- np hard
- sorting algorithms
- statistical hypothesis testing
- statistical tests
- confidence intervals
- small samples
- random samples
- generalization error
- experimental design
- lower bound
- random sample
- knowledge acquisition
- special case
- optimality conditions
- data sets
- hypothesis tests
- optimal solution