Mehdi2277

16 ms·

121.
by Mehdi2277 6y ago
I find this trained educator comment awkward. For universities the main thing needed to be a professor is a PhD. While graduate programs will often require some amount of TAing (typically two semesters) that's not universally true in t
122.
by Mehdi2277 6y ago
I know that for my oklahoma college friends they often had rent around 250/month for a room in the oklahoma city metro area (norman specifically). 200/month in some small oklahoma town is probably doable for a room.
123.
by Mehdi2277 7y ago
Reading the paper, instead of computing the gradient across the training run they compute the gradient for a hyper parameter after each batch and update the hyper parameter then. That keeps the computational cost pretty light. Stacking grad
124.
by Mehdi2277 9y ago
Math is one place where I think it tends to be nice to be pedantic as you are starting to learn a topic. Generally, when I'm unsure of something proof wise it tells me I should re-read all the relevant definitions from that section&#x2
125.
by Mehdi2277 9y ago
Not the best example. An algorithm that is O(n) is also O(n^3). If you want a tight bound you should use big theta. I also think while it might be a bit of an issue for undergrad, by grad school at latest for math at least you should be abl
126.
by Mehdi2277 9y ago
Roughly, context sensitive can be covered by monadic parsers, while applicative parsers are context free. LR(k) also corresponds to context free parsers. So, at least for monadic combinators they are more powerful. I also think they're
127.
by Mehdi2277 9y ago
Yeah that type is enough to make a monad. In slightly fancy language the type you just wrote is just StateT Input Maybe. Monadic mostly makes me think of bind which is just about chaining (technically also return is needed, but here return