Thousands of people will fill Brooklyn's Barclays Center on July 27 and July 28, but not for basketball, not for hockey and not for a concert. They'll be there for the Grand Finals of the Overwatch League, an e-sports league video game developer Blizzard Entertainment runs with its popular team-based, first-person shooter, Overwatch. The sold-out finals will mark an end to the Overwatch League's first season, with teams from Philadelphia and London (city-based teams are a league hallmark) set to compete for $1.4 million in prizes. Matches will be broadcast live on ESPN and Disney XD, marking the first time e-sports have been broadcast live on ESPN's main channel in primetime, Blizzard says. Ahead of the big event, TIME sat down with Blizzard Entertainment President and CEO Michael Morhaime to talk about the tournament, Overwatch, and the gaming industry more broadly.

When it comes to our health, especially in matters of life and death, the promise of artificial intelligence (AI) to improve outcomes is very intriguing. While there is still much to overcome to achieve AI-dependent health care, most notably data privacy concerns and fears of mismanaged care due to machine error and lack of human oversight, there is sufficient potential that governments, tech companies, and healthcare providers are willing to invest and test out AI-powered tools and solutions. Here are five of the AI advances in healthcare that appear to have the most potential. With an estimated value of $40 billion to healthcare, robots can analyze data from pre-op medical records to guide a surgeon's instrument during surgery, which can lead to a 21% reduction in a patient's hospital stay. Robot-assisted surgery is considered "minimally invasive" so patients won't need to heal from large incisions.

It's often been said that the eyes are the window to the soul, revealing what we think and how we feel. Now, new research reveals that your eyes may also be an indicator of your personality type, simply by the way they move. Developed by the University of South Australia in partnership with the University of Stuttgart, Flinders University and the Max Planck Institute for Informatics in Germany, the research uses state-of-the-art machine-learning algorithms to demonstrate a link between personality and eye movements. Findings show that people's eye movements reveal whether they are sociable, conscientious or curious, with the algorithm software reliably recognising four of the Big Five personality traits: neuroticism, extroversion, agreeableness, and conscientiousness. Researchers tracked the eye movements of 42 participants as they undertook everyday tasks around a university campus, and subsequently assessed their personality traits using well-established questionnaires. UniSA's Dr Tobias Loetscher says the study provides new links between previously under-investigated eye movements and personality traits and delivers important insights for emerging fields of social signal processing and social robotics.

Nearly three-quarters of Americans are afraid to ride in self-driving cars, according to the latest survey by the American Automobile Association. There is bad news ahead for the many automobile and technology companies currently developing, and road-testing, self-driving cars: many people are too frightened to ride in driverless vehicles. The American Automobile Association (AAA) May consumer trust survey on autonomous vehicles (AVs) found that 73% of U.S. citizens now fear traveling in an AV, compared with 63% just six months before. In addition, the survey found that two-thirds of millennials--a supposedly tech-loving generation--are also too fearful to ride in self-driving cars. The AAA even has unwelcome news from pedestrians and cyclists, with nearly two-thirds saying they don't trust AVs enough to use roads and sidewalks alongside them.

The state of the art practice in robotics planning is to script behaviors manually, where each behavior is typically generated using trajectory optimization. However, in order for robots to be able to act robustly and adapt to novel situations, they need to plan these activity sequences autonomously. Since the conditions and effects of these behaviors are tightly coupled through time, state and control variables, many problems require that the tasks of activity planning and trajectory optimization are considered together. There are two key issues underlying effective hybrid activity and trajectory planning: the sufficiently accurate modeling of robot dynamics and the capability of planning over long horizons. Hybrid activity and trajectory planners that employ mixed integer programming within a discrete time formulation are able to accurately model complex dynamics for robot vehicles, but are often restricted to relatively short horizons. On the other hand, current hybrid activity planners that employ continuous time formulations can handle longer horizons but they only allow actions to have continuous effects with constant rate of change, and restrict the allowed state constraints to linear inequalities. This is insufficient for many robotic applications and it greatly limits the expressivity of the problems that these approaches can solve. In this work we present the ScottyActivity planner, that is able to generate practical hybrid activity and motion plans over long horizons by employing recent methods in convex optimization combined with methods for planning with relaxed plan graphs and heuristic forward search. Unlike other continuous time planners, ScottyActivity can solve a broad class of robotic planning problems by supporting convex quadratic constraints on state variables and control variables that are jointly constrained and that affect multiple state variables simultaneously. In order to support planning over long horizons, ScottyActivity does not resort to time, state or control variable discretization. While straightforward formulations of consistency checks are not convex and do not scale, we present an efficient convex formulation, in the form of a Second Order Cone Program (SOCP), that is very fast to solve. We also introduce several new realistic domains that demonstrate the capabilities and scalability of our approach, and their simplified linear versions, that we use to compare with other state of the art planners. This work demonstrates the power of integrating advanced convex optimization techniques with discrete search methods and paves the way for extensions dealing with non-convex disjoint constraints, such as obstacle avoidance.

General Video Game Playing (GVGP) aims at designing an agent that is capable of playing multiple video games with no human intervention. In 2014, The General Video Game AI (GVGAI) competition framework was created and released with the purpose of providing researchers a common open-source and easy to use platform for testing their AI methods with potentially infinity of games created using Video Game Description Language (VGDL). The framework has been expanded into several tracks during the last few years to meet the demand of different research directions. The agents are required to either play multiples unknown games with or without access to game simulations, or to design new game levels or rules. This survey paper presents the VGDL, the GVGAI framework, existing tracks, and reviews the wide use of GVGAI framework in research, education and competitions five years after its birth. A future plan of framework improvements is also described.

Latent truth discovery, LTD for short, refers to the problem of aggregating ltiple claims from various sources in order to estimate the plausibility of atements about entities. In the absence of a ground truth, this problem is highly challenging, when some sources provide conflicting claims and others no claims at all. In this work we provide an unsupervised stochastic inference procedure on top of a model that combines restricted Boltzmann machines with feed-forward neural networks to accurately infer the reliability of sources as well as the plausibility of statements about entities. In comparison to prior work our approach stands out (1) by allowing the incorporation of arbitrary features about sources and claims, (2) by generalizing from reliability per source towards a reliability function, and thus (3) enabling the estimation of source reliability even for sources that have provided no or very few claims, (4) by building on efficient and scalable stochastic inference algorithms, and (5) by outperforming the state-of-the-art by a considerable margin.

The class of non-rigid registration methods proposed in the framework of PDE-constrained Large Deformation Diffeomorphic Metric Mapping is a particularly interesting family of physically meaningful diffeomorphic registration methods. PDE-constrained LDDMM methods are formulated as constrained variational problems, where the different physical models are imposed using the associated partial differential equations as hard constraints. Inexact Newton-Krylov optimization has shown an excellent numerical accuracy and an extraordinarily fast convergence rate in this framework. However, the Galerkin representation of the non-stationary velocity fields does not provide proper geodesic paths. In a previous work, we proposed a method for PDE-constrained LDDMM parameterized in the space of initial velocity fields under the EPDiff equation. The proposed method provided geodesics in the framework of PDE-constrained LDDMM, and it showed performance competitive to benchmark PDE-constrained LDDMM and EPDiff-LDDMM methods. However, the major drawback of this method was the large memory load inherent to PDE-constrained LDDMM methods and the increased computational time with respect to the benchmark methods. In this work we optimize the computational complexity of the method using the band-limited vector field parameterization closing the loop with our previous works.

Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out the experimental implementation of this proposal in the Rigetti cloud quantum computer employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders in state-of-the-art superconducting quantum technologies. A quantum autoencoder is a quantum device which can reshuffle and compress the quantum information of a subset of a Hilbert space spanned by initial n -qubit states onto n ′ qubit states with n ′ n [1, 2]. This approach may allow one to employ fewer quantum computing resources [3, 4]. On the other hand, recently it was proven that a general quantum adder performing the equal weight superposition of two unknown quantum states is forbidden in general [5].

We propose a tensor-based model that fuses a more granular representation of user preferences with the ability to take additional side information into account. The model relies on the concept of ordinal nature of utility, which better corresponds to actual user perception. In addition to that, unlike the majority of hybrid recommenders, the model ties side information directly to collaborative data, which not only addresses the problem of extreme data sparsity, but also allows to naturally exploit patterns in the observed behavior for a more meaningful representation of user intents. We demonstrate the effectiveness of the proposed model on several standard benchmark datasets. The general formulation of the approach imposes no restrictions on the type of observed interactions and makes it potentially applicable for joint modelling of context information along with side data.