On the expectation of the maximum of IID geometric random variables

By B. Eisenberg. 2008

102 citations recorded by the source corpus.

Subfields: Environmental Engineering, Finance, Signal Processing

View Paper: https://www.semanticscholar.org/paper/d5d791b81bf138dcd2f7d2d11319180afab1788d

Citations in the corpus

• More Iterations per Second, Same Quality - Why Asynchronous Algorithms may Drastically Outperform Traditional Ones (2017, unknown): “Because all nodes must finish updating for the next iteration to start, the iteration time P is given by: Hence we have (using [9]): Let’s now look at the time T ( K ) required for K epochs, which corresponds to Km/p iterations.”