On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons.
Wenbo RenJia LiuNess B. ShroffPublished in: CoRR (2019)
Keyphrases
- upper and lower bounds
- sample complexity
- marginal probabilities
- upper bound
- theoretical analysis
- pac learning
- learning algorithm
- vc dimension
- lower bound
- learning problems
- special case
- supervised learning
- training examples
- concept classes
- active learning
- generalization error
- sample size
- irrelevant features
- uniform convergence
- noisy data
- worst case
- np hard
- dnf formulas
- data sets
- semi supervised learning
- data mining