A Google interview candidate recently asked me: “What are three big science questions that keep you up at night?” This was a great question because one’s answer reveals so much about one’s intellectual interests – here are mine:
Q1: Can we imitate “th…
In 1984, a panel at the AAAI conference discussed whether the field was approaching an “AI Winter”. Mitch Waldrop wrote a transcript of the discussion, and much of it reads exactly like something written 35 years into the future.
Below are s…
Artificial intelligence is not only changing the face of technology as we know it but also causing a seismic shift in the workforce and the talent and skills that the younger workforce, in particular, needs to own and exhibit in order to survive an eve…
Xiaoyi Yin has graciously translated this blog post to 中文.
I often hear the remark around the proverbial AI watering hole that there are no examples of reinforcement learning (RL) deployed in commercial settings that couldn’t be replaced by simpl…
Github repo here: https://github.com/ericjang/maml-jax
Adaptive behavior in humans and animals occurs at many time scales: when I use a new shower handle for the first time, it takes me a few seconds to figure out how to adjust the water temperat…
Some thoughts on the interesting BagNet paper (accepted at ICLR 2019) currently being circulated around the Machine Learning Twitter Community.
Disclaimer: I wasn’t a reviewer of this paper for ICLR. I think it was worthy of acceptance to the c…
A PDF version of this post can be found here.
Chinese translation by Xiaoyi Yin
Notions of uncertainty are tossed around in conversations around AI safety, risk management, portfolio optimization, scientific measurement, and insurance. Here are a few …
A periodically-updated list of my favorite Deep Learning memes. Enjoy!
content warning: may contain crude humor.
Caption: The Gary Marcus/Yoshua Bengio debate. (Thanks Jackie Kay for sending me this)
…
You can find a PDF version of this blog post here.
A weighted graph is a data structure consisting of some vertices and edges, and each edge has an associated cost of traversal. Let’s suppose we want to compute the shortest distance from vertex $u$ …