You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, Thank you so much for this awesome repo. It's the clearest implementation I found out there :)
I have a question regarding the mini-batch sampling. In the code, it is commented that it gives similar performance to (sub-sampling with batch_size=1, i.e., the correct mathematical way). But I'm worried that they are very different.
So I'm curious to know whether there are papers that used this sampling instead and they confirmed its similar performance?
The reason for my doubt is that in general, the expected value of the squared gradients of log-likelihoods which is an estimator for the diagonal of the Fisher matrix is not the same as the expected squared expected gradients of log-likelihoods.
Thank you for your consideration,
Arash
The text was updated successfully, but these errors were encountered:
Thanks for your interest in our repo. You are right. batch_size=1 and batch_size!=1 are different. That's why the default setting in the MNIST demo uses batch_size=1 (see here), although empirically batch_size!=1 gives a similar MNIST performance. It is possible that a different dataset or exp setting may show a different result.
What could make the results similar/dissimilar? The total number of samples may be the major factor. Consider the two cases:
60000 samples with batch_size=1 versus 60000 samples with batch_size=10.
10 samples with batch_size=1 versus 10 samples with batch_size=10.
In case 1, the resulting Fisher diagonals are likely to be similar after multiplied with a scaling factor, while case 2 will be very different.
Please feel free to share your findings with us. Thank you!
Hi, Thank you so much for this awesome repo. It's the clearest implementation I found out there :)
I have a question regarding the mini-batch sampling. In the code, it is commented that it gives similar performance to (sub-sampling with batch_size=1, i.e., the correct mathematical way). But I'm worried that they are very different.
So I'm curious to know whether there are papers that used this sampling instead and they confirmed its similar performance?
The reason for my doubt is that in general, the expected value of the squared gradients of log-likelihoods which is an estimator for the diagonal of the Fisher matrix is not the same as the expected squared expected gradients of log-likelihoods.
Thank you for your consideration,
Arash
The text was updated successfully, but these errors were encountered: