C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Tight Lower Complexity Bounds for Strongly Convex Finite-Sum Optimization.
Min Zhang
Yao Shu
Kun He
Published in:
CoRR (2020)
Keyphrases
</>
lower complexity
lower bound
upper bound
low complexity
worst case
objective function
data complexity
generalization error bounds
convex relaxation
convex optimization
compression ratio
computational complexity
risk minimization
semidefinite
image processing
vc dimension
convex sets