Nations sell goods and services to each other because this exchange is generally mutually beneficial. It's easy to understand that Iceland should not be growing its own oranges, given its climate. Instead, Iceland should buy oranges from Spain, which can grow them more cheaply, and sell Spaniards fish, which are abundant in its waters. That's why the explosion in free trade since the first bilateral deal was penned between Britain and France in the mid-1800s has generated unprecedented wealth and prosperity for the vast majority of the world's population. Hundreds of trade agreements later, the United States and several other countries established an international rules-based trading system after World War II. But now the U.S., which has played an integral role in bolstering this system, is actively trying to subvert it.

Following the backlash over its Project Maven plans to develop AI for the US military, Google has since withdrawn and published its ethical principles. Project Maven was Google's collaboration with the US Department of Defense. In March, leaks indicated that Google supplied AI technology to the Pentagon to help analyse drone footage. The following month, over 4,000 employees signed a petition demanding that Google's management cease work on Project Maven and promise to never again "build warfare technology." In April 2018, Google's infamous'Don't be evil' motto was removed from the code of conduct's preface -- but retained in its last sentence.

Fifa 19 will include the Champions League, as part of a major break with tradition. The move was announced during E3, where companies including Fifa developer EA revealed their plans for the future. The tournament has been Fifa's most glaring omission among what is otherwise an incredibly detailed and highly-licensed game. It includes most of the world's leagues and has even introduced a special mode for the World Cup, which this year came as a free update. The I.F.O. is fuelled by eight electric engines, which is able to push the flying object to an estimated top speed of about 120mph.

Xbox has unveiled a huge range of games coming to its platform this year – and a new Xbox that is in the works. Microsoft's Xbox boss Phil Spencer said this year was shaping up to be its biggest ever. It showed off an unprecedented number of games: 50 in total, including new updates to the Halo and Gears of War series. The company also gave intriguing hints about the future of the Xbox in general, including an entirely new console and a streaming service for games. The I.F.O. is fuelled by eight electric engines, which is able to push the flying object to an estimated top speed of about 120mph.

If you could improve your health by using data-powered advice based on your body's nutritional input, wouldn't that be something you would want to do? That seems to be the viewpoint of an investor from the New York Angels group, who has given nutrition analytics and data startup Nutrino $8 million to complete its Series A funding. In a field of science where we find out how food affects the human body so we can focus on healing, disease prevention, and chronic condition management, this San Francisco and Tel Aviv-based startup is leading the way through an easy-to-use app. One day eggs are bad for you, and the next day they are recommended? Within a complex science where dietitians sometimes contradict one another on what is the best nutritional recourse for their patients, the clear path through the differences in advice are the hard facts that you can derive from machine learning. Like all industries that data analytics is applied to the answers are more correct and at the same time more personalized, as well.

Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting. There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science. The book has two parts.

This paper proposes an inexpensive way to learn an effective dissimilarity function to be used for $k$-nearest neighbor ($k$-NN) classification. Unlike Mahalanobis metric learning methods that map both query (unlabeled) objects and labeled objects to new coordinates by a single transformation, our method learns a transformation of labeled objects to new points in the feature space whereas query objects are kept in their original coordinates. This method has several advantages over existing distance metric learning methods: (i) In experiments with large document and image datasets, it achieves $k$-NN classification accuracy better than or at least comparable to the state-of-the-art metric learning methods. (ii) The transformation can be learned efficiently by solving a standard ridge regression problem. For document and image datasets, training is often more than two orders of magnitude faster than the fastest metric learning methods tested. This speed-up is also due to the fact that the proposed method eliminates the optimization over "negative" object pairs, i.e., objects whose class labels are different. (iii) The formulation has a theoretical justification in terms of reducing hubness in data.

In this study, we present a machine learning approach to infer the worker and student mobility flows on daily basis from static censuses. The rapid urbanization has made the estimation of the human mobility flows a critical task for transportation and urban planners. The primary objective of this paper is to complete individuals' census data with working and studying trips, allowing its merging with other mobility data to better estimate the complete origin-destination matrices. Worker and student mobility flows are among the most weekly regular displacements and consequently generate road congestion problems. Estimating their round-trips eases the decision-making processes for local authorities. Worker and student censuses often contain home location, work places and educational institutions. We thus propose a neural network model that learns the temporal distribution of displacements from other mobility sources and tries to predict them on new censuses data. The inclusion of multi-task learning in our neural network results in a significant error rate control in comparison to single task learning.

In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent. This condition is a special case of the \L{}ojasiewicz inequality proposed in the same year, and it does not require strong convexity (or even convexity). In this work, we show that this much-older Polyak-\L{}ojasiewicz (PL) inequality is actually weaker than the main conditions that have been explored to show linear convergence rates without strong convexity over the last 25 years. We also use the PL inequality to give new analyses of randomized and greedy coordinate descent methods, sign-based gradient descent methods, and stochastic gradient methods in the classic setting (with decreasing or constant step-sizes) as well as the variance-reduced setting. We further propose a generalization that applies to proximal-gradient methods for non-smooth optimization, leading to simple proofs of linear convergence of these methods. Along the way, we give simple convergence results for a wide variety of problems in machine learning: least squares, logistic regression, boosting, resilient backpropagation, L1-regularization, support vector machines, stochastic dual coordinate ascent, and stochastic variance-reduced gradient methods.

Feature selection is an important challenge in machine learning. It plays a crucial role in the explainability of machine-driven decisions that are rapidly permeating throughout modern society. Unfortunately, the explosion in the size and dimensionality of real-world datasets poses a severe challenge to standard feature selection algorithms. Today, it is not uncommon for datasets to have billions of dimensions. At such scale, even storing the feature vector is impossible, causing most existing feature selection methods to fail. Workarounds like feature hashing, a standard approach to large-scale machine learning, helps with the computational feasibility, but at the cost of losing the interpretability of features. In this paper, we present MISSION, a novel framework for ultra large-scale feature selection that performs stochastic gradient descent while maintaining an efficient representation of the features in memory using a Count-Sketch data structure. MISSION retains the simplicity of feature hashing without sacrificing the interpretability of the features while using only O(log^2(p)) working memory. We demonstrate that MISSION accurately and efficiently performs feature selection on real-world, large-scale datasets with billions of dimensions.