02 MAR 2019 by ideonexus

## New Kind of Memory for AI

AI researchers have typically tried to get around the issues posed by by Montezuma’s Revenge and Pitfall! by instructing reinforcement-learning algorithms to explore randomly at times, while adding rewards for exploration—what’s known as “intrinsic motivation.” But the Uber researchers believe this fails to capture an important aspect of human curiosity. “We hypothesize that a major weakness of current intrinsic motivation algorithms is detachment,” they write. “Wherein the a...29 MAY 2013 by ideonexus

## Simple Explanation of Big O Part II

So if you want to find a name in a phone book of a million names you can actually find any name by doing this at most 20 times. In comparing search algorithms we decide that this comparison is our 'n'. For a phone book of 3 names it takes 2 comparisons (at most).For 7 it takes at most 3.For 15 it takes 4....For 1,000,000 it takes 20. That is staggeringly good isn't it? In Big-O terms this is O(log n) or logarithmic complexity. Now the logarithm in question could be ln (base e), log10, l...Second part of the explanation.