As the world descends into geopolitical competition, other powers increasingly challenge European countries' ability to defend their interests and values. Russia is willing to weaponise energy supplies, cyber capabilities, and disinformation; China invests strategically and uses state capitalism to skew the market; Turkey instrumentalises migration; Saudi Arabia leverages its energy resources. And the Trump administration is willing to exploit European dependence on the transatlantic security alliance and the dollar to achieve short-term policy goals. What unites these disparate powers is their unwillingness to separate the functioning of the global economy from political and security competition. The EU has the market power, defence spending, and diplomatic heft to end this vulnerability and restore sovereignty to its member states.

Something stood out of the ordinary during a speech by China's president, Xi Jinping, in January 2018. Behind Xi, on a bookshelf, were two books on artificial intelligence (AI). Why were those books there? Similar to 2015, when Russia "accidentally" aired designs for a new weapon, the placement of the books may not have been an accident. Was China sending a message?

Recent progress in separating the speech signals from multiple overlapping speakers using a single audio channel has brought us closer to solving the cocktail party problem. However, most studies in this area use a constrained problem setup, comparing performance when speakers overlap almost completely, at artificially low sampling rates, and with no external background noise. In this paper, we strive to move the field towards more realistic and challenging scenarios. To that end, we created the WSJ0 Hipster Ambient Mixtures (WHAM!) dataset, consisting of two speaker mixtures from the wsj0-2mix dataset combined with real ambient noise samples. The samples were collected in coffee shops, restaurants, and bars in the San Francisco Bay Area, and are made publicly available. We benchmark various speech separation architectures and objective functions to evaluate their robustness to noise. While separation performance decreases as a result of noise, we still observe substantial gains relative to the noisy signals for most approaches.

Time series forecasting is an important problem across many domains, including predictions of solar plant energy output, electricity consumption, and traffic jam situation. In this paper, we propose to tackle such forecasting problem with Transformer. Although impressed by its performance in our preliminary study, we found its two major weaknesses: (1) locality-agnostics: the point-wise dot-product self attention in canonical Transformer architecture is insensitive to local context, which can make the model prone to anomalies in time series; (2) memory bottleneck: space complexity of canonical Transformer grows quadratically with sequence length $L$, making modeling long time series infeasible. In order to solve these two issues, we first propose convolutional self attention by producing queries and keys with causal convolution so that local context can be better incorporated into attention mechanism. Then, we propose LogSparse Transformer with only $O(L(\log L)^{2})$ memory cost, improving the time series forecasting in finer granularity under constrained memory budget. Our experiments on both synthetic data and real-world datasets show that it compares favorably to the state-of-the-art.

Mobile sequential recommendation was originally designed to find a promising route for a single taxicab. Directly applying it for multiple taxicabs may cause an excessive overlap of recommended routes. The multi-taxicab recommendation problem is challenging and has been less studied. In this paper, we first formalize a collective mobile sequential recommendation problem based on a classic mathematical model, which characterizes time-varying influence among competing taxicabs. Next, we propose a new evaluation metric for a collection of taxicab routes aimed to minimize the sum of potential travel time. We then develop an efficient algorithm to calculate the metric and design a greedy recommendation method to approximate the solution. Finally, numerical experiments show the superiority of our methods. In trace-driven simulation, the set of routes recommended by our method significantly outperforms those obtained by conventional methods.

In the spring of 1964, as fighting escalated in Vietnam, several dozen Americans gathered to play a game. They were some of the most powerful men in Washington: the director of Central Intelligence, the Army chief of staff, the national security advisor, and the head of the Strategic Air Command. Senior officials from the State Department and the Navy were also on hand. Players were divided into two teams, red and blue, representing the Cold War superpowers. The teams operated out of separate rooms in the Pentagon, role-playing confrontation in Southeast Asia, simulated in a neutral command center.

WASHINGTON - The Trump administration has moved ahead with a surveillance drone sale to four U.S. allies in the South China Sea region as acting Defense Secretary Patrick Shanahan said Washington will no longer "tiptoe" around Chinese behavior in Asia. The drones would afford greater intelligence gathering capabilities potentially curbing Chinese activity in the region. Shanahan did not directly name China when making accusations of "actors" destabilizing the region in a speech at the annual Shangri-La Dialogue in Singapore on Saturday but went on to say the United States would not ignore Chinese behavior. The Pentagon announced on Friday it would sell 34 ScanEagle drones, made by Boeing Co., to the governments of Malaysia, Indonesia, the Philippines and Vietnam for a total of $47 million. China claims almost all of the strategic South China Sea and frequently lambastes the United States and its allies over naval operations near Chinese-occupied islands.

The Markov decision process (MDP) formulation used to model many real-world sequential decision making problems does not capture the setting where the set of available decisions (actions) at each time step is stochastic. Recently, the stochastic action set Markov decision process (SAS-MDP) formulation has been proposed, which captures the concept of a stochastic action set. In this paper we argue that existing RL algorithms for SAS-MDPs suffer from divergence issues, and present new algorithms for SAS-MDPs that incorporate variance reduction techniques unique to this setting, and provide conditions for their convergence. We conclude with experiments that demonstrate the practicality of our approaches using several tasks inspired by real-life use cases wherein the action set is stochastic.

Traditional approaches focus on finding relationships between two entire time series, however, many interesting relationships exist in small sub-intervals of time and remain feeble during other sub-intervals. We define the notion of a sub-interval relationship (SIR) to capture such interactions that are prominent only in certain sub-intervals of time. To that end, we propose a fast-optimal guaranteed algorithm to find most interesting SIR relationship in a pair of time series. Lastly, we demonstrate the utility of our method in climate science domain based on a real-world dataset along with its scalability scope and obtain useful domain insights.

On Tuesday, in an 8-1 tally, the San Francisco Board of Supervisors voted to ban the use of facial recognition software by city departments, including police. Supporters of the ban cited racial inequality in audits of facial recognition software from companies like Amazon and Microsoft, as well as dystopian surveillance happening now in China. At the core of arguments around the regulation of facial recognition software use is the question of whether a temporary moratorium should be put in place until police and governments adopt policies and standards or it should be permanently banned. Some believe facial recognition software can be used to exonerate the innocent and that more time is needed to gather information. Others, like San Francisco Supervisor Aaron Peskin, believe that even if AI systems achieve racial parity, facial recognition is a "uniquely dangerous and oppressive technology."