Closing the gap between the upper bound and lower bound of Adam's iteration complexity.
Bohan WangJingwen FuHuishuai ZhangNanning ZhengWei ChenPublished in: NeurIPS (2023)
Keyphrases
- upper bound
- lower bound
- worst case
- objective function
- branch and bound algorithm
- lower and upper bounds
- generalization error
- upper and lower bounds
- branch and bound
- complexity analysis
- sample size
- decision problems
- space complexity
- average case
- error probability
- upper bounding
- neural network
- average case complexity
- computational cost
- np hard
- computational complexity
- data structure
- optimal solution
- case study