Goto

Collaborating Authors

 Europe


Game over? New Artificial Intelligence challenge to human smarts

#artificialintelligence

"AlphaGo is really more interesting than either Deep Blue or Watson, because the algorithms it uses are potentially more general-purpose," said Nick Bostrom of Oxford University's Future of Humanity Institute. Creating "general" or multi-purpose, rather than "narrow", task-specific intelligence, is the ultimate goal in AI -- something resembling human reasoning based on a variety of inputs, and self-learning from experience. "So, if the machine can do new things when needed, then it has'true' intelligence'," Bostrom's colleague Anders Sandberg told AFP. In the case of Go, Google developers realised a more "human-like" approach would win over brute computing power. AlphaGo uses two sets of "deep neural networks" containing millions of connections similar to neurons in the brain.


VIDEO: Six things in the office of the future?

BBC News

The rainwater collection system, solar panel farm and security robot are already up and running at The Edge building in Amsterdam. The interactive desk is a research project by Arup called "It's All About The Desk." The digital algae canopy is developed by the London-based ecoLogicStudio, who provided the footage. The system of surgically-implanted chips is operate by Epicenter, a hi-tech office block in Stockholm.


How Google DeepMind Plans to Solve Intelligence

MIT Technology Review

It doesn't look like a place to make groundbreaking discoveries that change the trajectory of society. But in these simulated, claustrophobic corridors, Demis Hassabis thinks he can lay the foundations for software that's smart enough to solve humanity's biggest problems. "Our goal's very big," says Hassabis, whose level-headed manner can mask the audacity of his ideas. He leads a team of roughly 200 computer scientists and neuroscientists at Google's DeepMind, the London-based group behind the AlphaGo software that defeated the world champion at Go in a five-game series earlier this month, setting a milestone in computing. It's supposed to be just an early checkpoint in an effort Hassabis describes as the Apollo program of artificial intelligence, aimed at "solving intelligence, and then using that to solve everything else."


The Artificial Intelligence Revolution: Part 1 - Wait But Why

#artificialintelligence

Note: The reason this post took three weeks to finish is that as I dug into research on Artificial Intelligence, I could not believe what I was reading. It hit me pretty quickly that what's happening in the world of AI is not just an important topic, but by far THE most important topic for our future. So I wanted to learn as much as I could about it, and once I did that, I wanted to make sure I wrote a post that really explained this whole situation and why it matters so much. Not shockingly, that became outrageously long, so I broke it into two parts. This is Part 1--Part 2 is here. We are on the edge of change comparable to the rise of human life on Earth. It seems like a pretty intense place to be standing--but then you have to remember something about what it's like to stand on a time graph: you can't see what's to your right. So here's how it actually feels to stand there: Imagine taking a time machine back to 1750--a time when the world was in a permanent power outage, long-distance communication meant either yelling loudly or firing a cannon in the air, and all transportation ran on hay. When you get there, you retrieve a dude, bring him to 2015, and then walk him around and watch him react to everything. It's impossible for us to understand what it would be like for him to see shiny capsules racing by on a highway, talk to people who had been on the other side of the ocean earlier in the day, watch sports that were being played 1,000 miles away, hear a musical performance that happened 50 years ago, and play with my magical wizard rectangle that he could use to capture a real-life image or record a living moment, generate a map with a paranormal moving blue dot that shows him where he is, look at someone's face and chat with them even though they're on the other side of the country, and worlds of other inconceivable sorcery. This is all before you show him the internet or explain things like the International Space Station, the Large Hadron Collider, nuclear weapons, or general relativity.


DOD's Work: Automated data can help beat ISIS -- FCW

#artificialintelligence

"We are absolutely certain that the use of deep-learning machines is going to allow us to have a better understanding of ISIS as a network, and a better understanding of how we can target it precisely and lead to its defeat," Work said March 30 at an event hosted by The Washington Post. Work said he recently met with a firm in Silicon Valley that can crunch vast amounts of social media data to deliver insights. The firm used its analytics capability to recount in real time how a Malaysia Airlines flight was shot down, according to Work. An official investigation concluded that a Russian Buk missile downed the airplane over Ukraine on July 17, 2014, killing 298 people. Courtney Hillson, told FCW the company he referred to is Orbital Insight, a geospatial data firm.


What it takes to work at Google DeepMind -- a London startup no one has ever left

#artificialintelligence

DeepMind was a relatively unknown artificial intelligence (AI) startup in London up until 2014, when it was bought by Google for around 400 million. Today some of the smartest people in the world are queuing up to work at DeepMind, according to an article by Celemency Burton-Hill in The Guardian in February. Interestingly, the same article states that no one has ever left DeepMind, which has created a series of algorithms that can learn for themselves and beat the best humans at games like Go and "Space Invaders." Based in up-and-coming King's Cross, DeepMind now employs around 250 people. However, as Burton-Hill points out, getting a job there is far from easy.


Will tomorrow's office be friend or foe?

BBC News

Over the next six weeks the BBC will examine how our built environment is changing. Tomorrow's Buildings will look at how technology is making our offices smarter, our homes more affordable and even transforming building sites. Ask someone what they dislike about working in an office and the list will probably be long. It is likely to include: workload, the boss, colleagues, uncomfortable chairs, lack of light, no decent food in the canteen and Arctic air-conditioning. Technology may soon be able to ease the last of these, offering a better working environment by allowing workers to control their heating via a smartphone app.


An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

Journal of Artificial Intelligence Research

Recently, MaxSAT reasoning is shown very effective in computing a tight upper bound for a Maximum Clique (MC) of a (unweighted) graph. In this paper, we apply MaxSAT reasoning to compute a tight upper bound for a Maximum Weight Clique (MWC) of a wighted graph. We first study three usual encodings of MWC into weighted partial MaxSAT dealing with hard clauses, which must be satisfied in all solutions, and soft clauses, which are weighted and can be falsified. The drawbacks of these encodings motivate us to propose an encoding of MWC into a special weighted partial MaxSAT formalism, called LW (Literal-Weighted) encoding and dedicated for upper bounding an MWC, in which both soft clauses and literals in soft clauses are weighted. An optimal solution of the LW MaxSAT instance gives an upper bound for an MWC, instead of an optimal solution for MWC. We then introduce two notions called the Top-k literal failed clause and the Top-k empty clause to extend classical MaxSAT reasoning techniques, as well as two sound transformation rules to transform an LW MaxSAT instance. Successive transformations of an LW MaxSAT instance driven by MaxSAT reasoning give a tight upper bound for the encoded MWC. The approach is implemented in a branch-and-bound algorithm called MWCLQ. Experimental evaluations on the broadly used DIMACS benchmark, BHOSLIB benchmark, random graphs and the benchmark from the winner determination problem show that our approach allows MWCLQ to reduce the search space significantly and to solve MWC instances effectively. Consequently, MWCLQ outperforms state-of-the-art exact algorithms on the vast majority of instances. Moreover, it is surprisingly effective in solving hard and dense instances.


Kernel Methods for the Approximation of Some Key Quantities of Nonlinear Systems

arXiv.org Machine Learning

We introduce a data-based approach to estimating key quantities which arise in the study of nonlinear control systems and random nonlinear dynamical systems. Our approach hinges on the observation that much of the existing linear theory may be readily extended to nonlinear systems - with a reasonable expectation of success - once the nonlinear system has been mapped into a high or infinite dimensional feature space. In particular, we develop computable, non-parametric estimators approximating controllability and observability energy functions for nonlinear systems, and study the ellipsoids they induce. In all cases the relevant quantities are estimated from simulated or observed data. It is then shown that the controllability energy estimator provides a key means for approximating the invariant measure of an ergodic, stochastically forced nonlinear system.


Sparse Representation of Multivariate Extremes with Applications to Anomaly Ranking

arXiv.org Machine Learning

Extremes play a special role in Anomaly Detection. Beyond inference and simulation purposes, probabilistic tools borrowed from Extreme Value Theory (EVT), such as the angular measure, can also be used to design novel statistical learning methods for Anomaly Detection/ranking. This paper proposes a new algorithm based on multivariate EVT to learn how to rank observations in a high dimensional space with respect to their degree of 'abnormality'. The procedure relies on an original dimension-reduction technique in the extreme domain that possibly produces a sparse representation of multivariate extremes and allows to gain insight into the dependence structure thereof, escaping the curse of dimensionality. The representation output by the unsupervised methodology we propose here can be combined with any Anomaly Detection technique tailored to non-extreme data. As it performs linearly with the dimension and almost linearly in the data (in O(dn log n)), it fits to large scale problems. The approach in this paper is novel in that EVT has never been used in its multivariate version in the field of Anomaly Detection. Illustrative experimental results provide strong empirical evidence of the relevance of our approach.