Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting.
Wentao YangVipul HarshEdgar SolomonikPublished in: SPAA (2023)
Keyphrases
- sample size
- worst case
- upper bound
- model selection
- small sample
- random sampling
- small samples
- vc dimension
- small sample size
- covariance matrix
- confidence intervals
- progressive sampling
- statistical hypothesis testing
- variance reduction
- optimality conditions
- generalization error
- experimental design
- np hard
- pac learning
- lower bound
- computational complexity
- number of training samples
- statistical power
- data sets
- statistical tests
- evolutionary algorithm
- information criterion
- optimal solution
- random samples
- uniform sampling
- decision trees