Near-optimal sample complexity for convex tensor completion.
Navid GhadermarzyYaniv PlanÖzgür YilmazPublished in: CoRR (2017)
Keyphrases
- sample complexity
- theoretical analysis
- pac learning
- learning problems
- supervised learning
- learning algorithm
- generalization error
- special case
- upper bound
- active learning
- lower bound
- vc dimension
- pac learnability
- training examples
- sample size
- concept classes
- covering numbers
- dimensionality reduction
- irrelevant features
- risk minimization
- uniform convergence
- number of irrelevant features
- learning tasks
- feature vectors
- machine learning
- concept class
- sample complexity bounds