Optimal Sample Complexity of Gradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration.
Paul HandOscar LeongVladislav VoroninskiPublished in: CoRR (2020)
Keyphrases
- sample complexity
- theoretical analysis
- special case
- learning problems
- pac learning
- vc dimension
- learning algorithm
- upper bound
- generalization error
- target function
- concept classes
- lower bound
- dynamic programming
- supervised learning
- worst case
- active learning
- decision trees
- training examples
- optimal solution
- constant factor
- function classes
- semi supervised learning
- data sets
- small number
- computational complexity