Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexity.
Bohan WangJingwen FuHuishuai ZhangNanning ZhengWei ChenPublished in: CoRR (2023)
Keyphrases
- upper bound
- lower bound
- worst case
- complexity analysis
- objective function
- branch and bound algorithm
- upper and lower bounds
- branch and bound
- lower and upper bounds
- np hard
- computational complexity
- average case complexity
- lower bounding
- generalization error
- error probability
- optimal cost
- upper bounding
- optimal solution
- morphological operators
- sample size
- theoretical analysis
- lagrangian relaxation
- search algorithm