Google is pulling another lever on its influential search engine in an effort to boost voter turnout in November's U.S. presidential election. Beginning Tuesday, Google will provide a summary box detailing state voting laws at the top of the search results whenever a user appears to be looking for that information. The breakdown will focus on the rules particular to the state where the search request originates unless a user asks for another location. Google is introducing the how-to-vote instructions a month after it unveiled a similar feature that explains how to register to vote in states across the U.S. The search giant said its campaign is driven by rabid public interest in the presidential race between Hillary Clinton and Donald Trump. As of last week, it said, the volume of search requests tied to the election, the candidates and key campaign issues had more than quadrupled compared to a similar point in the 2012 presidential race.

SLOUGH, England--(BUSINESS WIRE)--Global business outsourcing provider Arvato has entered a strategic partnership with Blue Prism to offer Robotic Process Automation (RPA) to help councils deliver back-office transformation. The partnership will see Arvato use the cutting-edge automation software to provide local authorities with an end-to-end solution of identifying, designing, building and monitoring automated processes, providing RPA-as-a-service and consultancy and training. Arvato will use the innovative technology to help current and future clients in local government automate transactional back office functions, such as revenues and benefits, HR, payroll and finance, increasing process speed and efficiency while freeing up employees to deliver front-line services. RPA uses software to create an agile, virtual workforce which mimics human processing of repetitive labour-intensive tasks. It follows rule-based business processes and interacts with systems in the same way that people do.

Imagine the difference between a buffalo stampede and a cheeseburger. Both are tasty sources of protein. The difference lies in their requisite culinary tools. Predictive Analytics (PA) is the buffalo stampede of quantitative research: data is big, fast, and shaggy. Interactive Analytics (IA) is a cheeseburger: structured, convenient, and easy to grill.

This thesis uses deep learning algorithms to forecast financial data. The deep learning framework is used to train a neural network. The deep neural network is a Deep Belief Network (DBN) coupled to a Multilayer Perceptron (MLP). It is used to choose stocks to form portfolios. The portfolios have better returns than the median of the stocks forming the list. The stocks forming the S&P 500 are included in the study. The results obtained from the deep neural network are compared to benchmarks from a logistic regression network, a multilayer perceptron and a naive benchmark. The results obtained from the deep neural network are better and more stable than the benchmarks. The findings support that deep learning methods will find their way in finance due to their reliability and good performance.

Tapan Agarwal, Product Council Head at iGTB, has been cited in Global Trade Review in an article discussing the use of AI in the financial services industry. The article describes how financial services provides a fertile ground for AI applications because AI's strength comes from the quality of the data fed to it, and financial institutions themselves are data mines. In trade finance, AI applications can be found particularly in the field of compliance to prevent money laundering and fraud. Banks are currently facing the challenge of increased regulation in these areas, and keeping up with various requirements can be challenging for compliance departments. "Banks are failing to identify threats and fraudulent activities by relying solely on curated databases," commented Agarwal.

Computational biologists answer biological and biomedical questions by using computation in support of--or in place of--laboratory procedures, hoping to obtain more accurate answers at a greatly reduced cost. The past two decades have seen unprecedented technological progress with regard to generating biological data; next-generation sequencing, mass spectrometry, microarrays, cryo-electron microscopy, and other high-throughput approaches have led to an explosion of data. However, this explosion is a mixed blessing. On the one hand, the scale and scope of data should allow new insights into genetic and infectious diseases, cancer, basic biology, and even human migration patterns. On the other hand, researchers are generating datasets so massive that it has become difficult to analyze them to discover patterns that give clues to the underlying biological processes. Certainly, computers are getting faster and more economical; the amount of processing available per dollar of computer hardware is more or less doubling every year or two; a similar claim can be made about storage capacity (Figure 1). In 2002, when the first human genome was sequenced, the growth in computing power was still matching the growth rate of genomic data. However, the sequencing technology used for the Human Genome Project--Sanger sequencing--was supplanted around 2004, with the advent of what is now known as next-generation sequencing. The material costs to sequence a genome have plummeted in the past decade, to the point where a whole human genome can be sequenced for less than US 1,000.

In this paper, we provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different target distribution. On the one hand, we propose an improvement of the previous approach proposed by Germain et al. (2013), that relies on a novel distribution pseudodistance based on a disagreement averaging, allowing us to derive a new tighter PAC-Bayesian domain adaptation bound for the stochastic Gibbs classifier. We specialize it to linear classifiers, and design a learning algorithm which shows interesting results on a synthetic problem and on a popular sentiment annotation task. On the other hand, we generalize these results to multisource domain adaptation allowing us to take into account different source domains. This study opens the door to tackle domain adaptation tasks by making use of all the PAC-Bayesian tools.

This paper addresses classification tasks on a particular target domain in which labeled training data are only available from source domains different from (but related to) the target. Two closely related frameworks, domain adaptation and domain generalization, are concerned with such tasks, where the only difference between those frameworks is the availability of the unlabeled target data: domain adaptation can leverage unlabeled target information, while domain generalization cannot. We propose Scatter Component Analyis (SCA), a fast representation learning algorithm that can be applied to both domain adaptation and domain generalization. SCA is based on a simple geometrical measure, i.e., scatter, which operates on reproducing kernel Hilbert space. SCA finds a representation that trades between maximizing the separability of classes, minimizing the mismatch between domains, and maximizing the separability of data; each of which is quantified through scatter. The optimization problem of SCA can be reduced to a generalized eigenvalue problem, which results in a fast and exact solution. Comprehensive experiments on benchmark cross-domain object recognition datasets verify that SCA performs much faster than several state-of-the-art algorithms and also provides state-of-the-art classification accuracy in both domain adaptation and domain generalization. We also show that scatter can be used to establish a theoretical generalization bound in the case of domain adaptation.

We study the issue of PAC-Bayesian domain adaptation: We want to learn, from a source domain, a majority vote model dedicated to a target one. Our theoretical contribution brings a new perspective by deriving an upper-bound on the target risk where the distributions' divergence-- expressed as a ratio--controls the tradeoff between a source error measure and the target voters' disagreement. Our bound suggests that one has to focus on regions where the source data is informative. From this result, we derive a PAC-Bayesian generalization bound, and specialize it to linear classifiers. Then, we infer a learning algorithm and perform experiments on real data.

The most important thing for humanity to do right now is to invent true artificial intelligence (AI): machines or software that can think and act independently in a wide variety of situations. Once we have artificial intelligence, it can help us solve all manner of other problems. While most of them work on ways of using known AI algorithms to solve new problems, some work on the overarching problem of artificial general intelligence. As I see it, addressing applied problems spur the invention of new algorithms, and the availability of new algorithms make it possible to address new problems. Having concrete problems to try to solve with AI is necessary in order to make progress; if you try to invent AI without having something to use it for, you will not know where to start. My chosen domain is games, and I will explain why this is the most relevant domain to work on if you are serious about AI. I talk about this a lot. All the time, some would say. But first, let us acknowledge that AI has gotten a lot of attention recently, in particular work on "deep learning" is being discussed in mainstream press as well as turned into startups that get bought by giant companies for bizarre amounts of money. There have been some very impressive advances during the past few years in identifying objects in images, understanding speech, matching names to faces, translating text and other such tasks.