Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem.
Gonzalo MenaJonathan Niles-WeedPublished in: NeurIPS (2019)
Keyphrases
- sample complexity
- upper bound
- vc dimension
- upper and lower bounds
- central limit theorem
- lower bound
- constant factor
- worst case
- theoretical analysis
- covering numbers
- pac learning
- learning problems
- supervised learning
- linear threshold
- special case
- active learning
- data sets
- uniform convergence
- learning algorithm
- generalization error
- training examples
- asymptotically optimal
- optimal solution
- sample size
- concept classes
- dynamic programming
- np hard
- function classes
- pairwise
- uncertain demand
- cross validation
- machine learning algorithms
- average case
- probability distribution