sinwave

Lol - the code example seems to imply that Zuckerburg's user id is 4.

Thought I'd chime in that for image compression (e.g in the JPEG2000 standard), the 2D discrete wavelet transform takes advantage of similar pixel intensities for neighboring pixels at various scales (i.e. "transformed magnitudes all nice and grouped for you"). The 2D-DWT is actually pretty cool under the hood. And, asymptotically, a bit faster than the FFT (DWT runs in O(N), and in 2D, O(width*height)).

May I please have your faster than nlogn sorting algorithm

This is actually some really great advice to hear upon graduating from college. Thank you.

This is really cool work. There is a lackluster theano feature which allows you to print a flowchart figure for the "computation graph" corresponding to the symbolic representation of your model.

@ajtulloch's library provides what I imagined the feature would be at first glance - a comprehensible, elegant graphical representation of your NN model. And on top of that, all in Haskell, with Haskell DSL for running torch - so cool.

Yeah, imagining him touring while writing his thesis has been a source of inspiration lately.

Am I wrong that the title seems to imply something negative about word vectors? But the article is super pumped about them!