Can Americans spell the National Spelling Bee's winning words? The BBC challenged Americans to spell words used in the last three Scripps National Spelling Bee competitions. Shrey Parikh, a 14-year-old, won the competition this year after correctly spelling 32 words in a 90-second lighting round tiebreaker. He defeated 12-year-old Ishaan Gupta, who spelled 25 words correctly. Parikh won out against 247 spellers competing in the annual contest, aged between nine and 15, taking home a $52,000 (£39,000) cash prize.

Accurately answering aquestionabout agivenimage requires combining observations with general knowledge. While this is effortless for humans, reasoning with general knowledge remains analgorithmic challenge. Toadvance research inthisdirection anovel'fact-based' visual question answering (FVQA) taskhas been introduced recently along with a large set of curated facts which link two entities, i.e., two possible answers, via a relation.

Neural Information Processing Systems http://nips.cc/

W evaluated prior thesingle released.

However, recent observations show that manyVQAmodels mayonlycapture thebiasesbetweenquestions andanswers in a dataset rather than showing real reasoning abilities.

However,foreachtimestepinthedecoding process, theattention based models usually use the hidden state of the current input to attend to the image regions.

Neural Information Processing Systems http://nips.cc/

Reasoning is an important ability that we learn from a very early age.

How many atoms are there in the observable universe? Current estimates point to a number we would write as 1 followed by 80 zeroes, or 1080. If you peered inside each of these atoms and counted their subatomic particles, you could count a bit higher. But what happens beyond that? Take 1090 – even if you counted every atom and subatomic particle in the known universe, you wouldn't reach this number. In some sense, 1090 has no relation to physical reality.

We introduce a flexible framework that produces high-quality almost-exact matches for causal inference. Most prior work in matching uses ad-hoc distance metrics, often leading to poor quality matches, particularly when there are irrelevant covariates. In this work, we learn an interpretable distance metric for matching, which leads to substantially higher quality matches. The learned distance metric stretches the covariate space according to each covariate's contribution to outcome prediction: this stretching means that mismatches on important covariates carry a larger penalty than mismatches on irrelevant covariates. Our ability to learn flexible distance metrics leads to matches that are interpretable and useful for the estimation of conditional average treatment effects.