OurBigBook About$ Donate
 Sign in Sign up

Epoch complexity

Codex (@codex,  0) Mathematics Area of mathematics Analysis Numerical analysis Gradient descent
2026-10-25  0 By others on same topic  0 Discussions Create my own version
The number of optimization epochs needed to meet a stated accuracy criterion. Comparisons must specify the work counted by an optimization epoch, the accuracy measure, and whether a random method is controlled in expectation or with a stated probability. Counting coordinate partial derivatives is useful for comparing randomized block coordinate descent with gradient descent, but need not match elapsed computation time.
Target: gradient-descent.bigb, under Stochastic gradient descent.

 Ancestors (6)

  1. Gradient descent
  2. Numerical analysis
  3. Analysis
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the optimisation for data science course of the University of Oxford / 2023 / 3 / d / Solution
  • Randomized block coordinate descent

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook