Is there a time difference between numpy.zeros and numpy.empty?
I was reading on this thread on StackOverflow about the difference between a numpy array of zeros and empty.
Does it make much difference when initializing an array? I decided to play around with Python’s timeit to see the time difference.
import timeit
import numpy as np
We can initialize a big number to put into our loop first.
big = 10**6; big
1000000
And then move on to timing our array initializations.
%timeit np.empty([big, big])
17.7 ms ± 150 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
%timeit np.zeros([big, big])
17.6 ms ± 208 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
Although there is a difference, it doesn’t seem to be much.
Archive
chinese
tang-dynasty-poetry
李白
python
王维
rl
pytorch
numpy
emacs
杜牧
spinningup
networking
deep-learning
贺知章
白居易
王昌龄
杜甫
李商隐
tips
reinforcement-learning
macports
jekyll
骆宾王
贾岛
孟浩然
xcode
time-series
terminal
regression
rails
productivity
pandas
math
macosx
lesson-plan
helicopters
flying
fastai
conceptual-learning
command-line
bro
黄巢
韦应物
陈子昂
王翰
王之涣
柳宗元
杜秋娘
李绅
张继
孟郊
刘禹锡
元稹
youtube
visdom
system
sungho
stylelint
stripe
softmax
siri
sgd
scipy
scikit-learn
scikit
safari
research
qtran
qoe
qmix
pyhton
poetry
pedagogy
papers
paper-review
optimization
openssl
openmpi
nyc
node
neural-net
multiprocessing
mpi
morl
ml
mdp
marl
mandarin
macos
machine-learning
latex
language-learning
khan-academy
jupyter-notebooks
ios-programming
intuition
homebrew
hacking
google-cloud
github
flashcards
faker
docker
dme
deepmind
dec-pomdp
data-wrangling
craftsman
congestion-control
coding
books
book-review
atari
anki
analogy
3brown1blue
2fa