Tag: cs

Halting CAPTCHA

2020 AI papers

Here are the most interesting research papers of the year, in case you missed any of them. In short, it is basically a curated list of the latest breakthroughs in AI and Data Science by release date with a clear video explanation, link to a more in-depth article, and code (if applicable).

Busy Beaver

The goal of the “busy beaver” game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics. The rub is that BB(27) is such an incomprehensibly huge number that even writing it down, much less running the Goldbach-falsifying machine for that many steps, isn’t remotely possible in our physical universe. Nevertheless, that incomprehensibly huge number is still an exact figure whose magnitude represents “a statement about our current knowledge” of number theory.

Indistinguishability Obfuscation

The scheme’s security rests on 4 mathematical assumptions that have been widely used in other cryptographic contexts. And even the assumption that has been studied the least, called the “learning parity with noise” assumption, is related to a problem that has been studied since the 1950s. “You could imagine that maybe 50 years from now the crypto textbooks will basically say, ‘OK, here is a very simple construction of iO, and from that we’ll now derive all of the rest of crypto.’”

DRL sample efficiency

We find considerable progress in the sample efficiency of DRL at rates comparable to progress in algorithmic efficiency in deep learning. If the trends we observed proved to be robust and continued, the huge amounts of simulated data that are currently necessary to achieve state-of-the-art results in DRL might not be required for future applications such that training in real world contexts could become feasible.

Learned sorting

On a 1B item dataset, Learned Sort outperforms the next best competitor, RadixSort, by a factor of 1.49x. What really blew me away, is that this result includes the time taken to train the model used!

RNA Universal Computation

This demonstrates that universal computation is well within the reach of molecular biology. It is therefore reasonable to assume that life has evolved – or possibly began with – a universal computer that yet remains to be discovered.

Speculative Dereferencing

The effect exploited in all of these papers is caused by speculative dereferencing of user-space registers in the kernel. Hence, mitigation techniques such as KAISER do not eliminate this leakage as previously believed.

Individuality information theory

This information theory of individuality offers a very general way to think about biological units. They hope it will inspire algorithms that could allow you to extract figure from ground, organism from environment. Such algorithms could be applied to streams of data collected over time to pinpoint correlations of information that signify the emergence of individuals.

Within this theory, individuals can be cells, tissues, organisms, colonies, companies, political institutions, online groups, artificial intelligence or cities — even ideas or theories. What we’re trying to do is discover a whole zoo of life forms that extend far beyond what we have conventionally called living,

Chocolate Simulations

so awfully specific!