Login / Signup
On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions.
Yossi Arjevani
Amit Daniely
Stefanie Jegelka
Hongzhou Lin
Published in:
CoRR (2020)
Keyphrases
</>
convex functions
convex hull
computational cost
decision problems
convex optimization
continuous functions
real valued functions
data sets
dynamic programming
worst case
higher level
complexity analysis
finite automata
penalty functions