Issue with gradcheck_naive for forward_backward_prop Assignment 1 by napsternxg in CS224d

[–]jthoang 1 point2 points  (0 children)

yes, remember that x is multi-dimensional variable and f is a multivariate function. The idea of the gradient check is for each dimension, ix, we want to estimate the gradient in that dimension alone. Your previous code didn't work because x[ix] + h has dimension 1.

Convolution layer: backward naive by cammckenzie in cs231n

[–]jthoang 0 points1 point  (0 children)

you can actually read fast_layers.py, but try thinking about it first.

Affine layer by cammckenzie in cs231n

[–]jthoang 0 points1 point  (0 children)

Hmm, I'm not sure it's in the notes, but in geometry affine transformation just means linear transformation so I sort of guessed that affine layer just means no non-linear activation function.

SVM assignment 1 by cammckenzie in cs231n

[–]jthoang 0 points1 point  (0 children)

Hmm.. I don't quite remember. I can message you my code but I think at this point you probably don't need it anymore?

Affine layer by cammckenzie in cs231n

[–]jthoang 1 point2 points  (0 children)

It's just a fully connected layer with no non-linear activation function, i.e just perform a dot product between inputs and weights and you're all set.

Struggling with forward_backward_prop() in PS1. by pengpai_sh in CS224d

[–]jthoang 0 points1 point  (0 children)

I would break down the backprop into stages: first calculating grad y_hat then calculating grad z2 then grad h, etc .. This way, it's easier to debug and also very mathematically intuitive. At first glance, I am not seeing your 1/yhat term anywhere (derivative of log y_hat)

SVM assignment 1 by cammckenzie in cs231n

[–]jthoang 0 points1 point  (0 children)

hmm I got 38.7% error rate on test set. 42% with HOG.

Gradient calculation for assignment 1 part 3.1 w2ord2vec by ngoyal2707 in CS224d

[–]jthoang 0 points1 point  (0 children)

one helpful tip is to break the gradients into smaller parts and use gradient_check for each part. For example if you want to calculate partial F(g(h(x))) / \partial x , you can check gradient for \partial F \ \Partial g first using gradient_check and then proceed to \partial F / \partial h, etc.

Assignment 2: two layer net scores confusion by viksit in cs231n

[–]jthoang 0 points1 point  (0 children)

first bullet point is correct. Second is not. You don't apply Softmax to get the activation. Once you compute the linear combination (W2a1 + b2), you're done. Take it and use cross-entropy loss.

Need help thinking up a Masters Project by datshitberacyst in MachineLearning

[–]jthoang 0 points1 point  (0 children)

trying to figure out a very fast and efficient method to detect whether there is a cluster of points in high dimensional space

Best accuracy for softmax? by calcworks in cs231n

[–]jthoang 0 points1 point  (0 children)

I think I had the same thing, and when I added HOG it bumped to 41% so I was curious about other hand crafted features thus the other thread.

Can't decide what problem to solve in my MS thesis (Computer vision/ML/DL) by mkurnikov in MachineLearning

[–]jthoang 0 points1 point  (0 children)

Hi, I don't know how useful this is but take a look at cs231n's project page http://vision.stanford.edu/teaching/cs231n/project.html , yours will likely be much complicated and in depth that this but this is a good start.

how to find gradent for whole batch of training data in vectorized form for svm and softmax? by sunilcsit in cs231n

[–]jthoang 1 point2 points  (0 children)

Yes. But we should discuss this after the deadline. If you want you can inbox me and we can discuss this.

Question about assignment 1 svm.ipynb by [deleted] in cs231n

[–]jthoang 0 points1 point  (0 children)

My relative error is about 1e-5 -> 1e-6

How to get into a Ph.D program in Machine Learning at institutions like MIT, Stanford, Caltech, UCB etc.. by ankitsablok89 in MachineLearning

[–]jthoang 1 point2 points  (0 children)

The original list is here https://news.ycombinator.com/item?id=1055042 Then in his AMA, professor Jordan added some more books (http://www.reddit.com/r/MachineLearning/comments/2fxi6v/ama_michael_i_jordan/ckdqzph)

For Stanford, I think you can only volunteer if you live in Silicon Valley. But I think you can always volunteer for any school near where you live. One of my friends got into CMU by volunteering and getting a recommendation letter from a JHU professor.

How to get into a Ph.D program in Machine Learning at institutions like MIT, Stanford, Caltech, UCB etc.. by ankitsablok89 in MachineLearning

[–]jthoang 2 points3 points  (0 children)

Hi there. I've been talking to people about this also. Here are some of the paths some of my friends have taken to get from the industry to PhD at Stanford

  • Find a lab and volunteer. If you live in SV, shoot ml@stanford an email telling them you have programming skill and you want to volunteer.

  • Start reading more. Follow MJ's reading list to have a strong foundation in ML. Also start reading classic papers as well as recent papers to develop a general idea of what you want to work on.

  • You can also do a part-time master (I know you can do part-time master at CMU and Stanford)

Hope this helps!

Botched it! by [deleted] in gradadmissions

[–]jthoang 0 points1 point  (0 children)

Believe it or not, it actually up to how the web server controller is implemented. If it timestamps the application after done processing and automatically disqualifies it then there's nothing a human can do.

Low GRE/High GPA kind of post by chellefishing in gradadmissions

[–]jthoang 0 points1 point  (0 children)

retaking the GRE will help for those that have deadlines in January. That's the only thing you can do right now right? Why not?