Not nearly enough thought has gone into the tremendous potential AI holds for decision support in governance. One hears a lot of worried talk about the potential of future robots or AGIs "taking over the world." However, while working to avoid negative outcomes is certainly worthwhile, it's equally important to think imaginatively and practically about positive potentials. We humans are not doing a tremendously great job of running our own world at present. The biggest risks concerning AI are situated at the intersection of the current sociopolitical system (wracked as it is with conflict, confusion, and unfairness) with advanced narrow AIs and early-stage AGIs. It seems clear that we could use a helping hand with governance and general management of human society on multiple levels.

Hewlett Packard Enterprise (HPE) announced a container-based software solution, HPE ML Ops, to support the entire machine learning model lifecycle for on-premises, public cloud and hybrid cloud environments. The new solution introduces a DevOps-like process to standardize machine learning workflows and accelerate AI deployments from months to days. The new HPE ML Ops solution extends the capabilities of the BlueData EPIC container software platform, providing data science teams with on-demand access to containerized environments for distributed AI / ML and analytics. BlueData was acquired by HPE in November 2018 to bolster its AI, analytics, and container offerings, and complements HPE's Hybrid IT solutions and HPE Pointnext Services for enterprise AI deployments. Enterprise AI adoption has more than doubled in the last four years, and organizations continue to invest significant time and resources in building machine learning and deep learning models for a wide range of AI use cases such as fraud detection, personalized medicine, and predictive customer analytics.

What are the differences between artificial intelligence and ordinary software? How do intelligent robots work and how exceeds human intelligence? Humans are the smartest creatures we know and artificial intelligence imitates human intelligence. However, in turn, artificial intelligence (AI) is a large area of research within computer science. The goal of the AI area is to create intelligent systems that operate independently of human beings.

Whether it's auto-extracting information from a scanned receipt for an expense report or translating a foreign language using your phone's camera, optical character recognition (OCR) technology can seem mesmerizing. And while it seems miraculous that we have computers that can digitize analog text with a degree of accuracy, the reality is that the accuracy we have come to expect falls short of what's possible. And that's because, despite the perception of OCR as an extraordinary leap forward, it's actually pretty old-fashioned and limited, largely because it's run by an oligopoly that's holding back further innovation. OCR's precursor was invented over 100 years ago in Birmingham, England by the scientist Edmund Edward Fournier d'Albe. Wanting to help blind people "read" text, d'Albe built a device, the Optophone, that used photo sensors to detect black print and convert it into sounds.

One of the main obstacles for developing flexible AI system is the split between data-based learners and model-based solvers. Solvers such as classical planners are very flexible and can deal with a variety of problem instances and goals but require first-order symbolic models. Data-based learners, on the other hand, are robust but do not produce such representations. In this work we address this split by showing how the first-order symbolic representations that are used by planners can be learned from non-symbolic representations alone given by a number of observed system trajectories organized as graphs. The observations can be arbitrary, including raw images. What it is required is that two observations are different iff they proceed from different states. The representation learning problem is formulated as the problem of inferring the simplest planning instances over a common first-order domain that can generate the structures of the observed graphs. A slightly richer version of the problem is also considered where actions are also observed and the graphs are labeled. The problem is expressed and solved via a SAT formulation that is shown to produce first-order representations for domains like Gripper, Blocks, and Hanoi. The work suggests that the target symbolic representations for planning encode the structure of the observed state space, not the observations themselves, as assumed in deep learning approaches.

T raditionally, mathematical formulations of dynamical systems in the context of Signal Processing and Control Theory have been a lynchpin of today's Financial Engineering. More recently, advances in sequential decision making, mainly through the concept of Reinforcement Learning, have been instrumental in the development of multistage stochastic optimization, a key component in sequential portfolio optimization (asset allocation) strategies. In this thesis, we develop a comprehensive account of the expressive power, modelling efficiency, and performance advantages of so called trading agents (i.e., Deep Soft Recurrent Q-Network (DSRQN) and Mixture of Score Machines (MSM)), based on both traditional system identification (model-based approach) as well as on context-independent agents (model-free approach). The analysis provides a conclusive support for the ability of model-free reinforcement learning methods to act as universal trading agents, which are not only capable of reducing the computational and memory complexity (owing to their linear scaling with size of the universe), but also serve as generalizing strategies across assets and markets, regardless of the trading universe on which they have been trained. The relatively low volume of daily returns in financial market data is addressed via data augmentation (a generative approach) and a choice of pre-training strategies, both of which are validated against current state-of-the-art models. For rigour, a risk-sensitive framework which includes transaction costs is considered, and its performance advantages are demonstrated in a variety of scenarios, from synthetic time-series (sinusoidal, sawtooth and chirp waves), ii simulated market series (surrogate data based), through to real market data (S&P 500 and EURO STOXX 50). The analysis and simulations confirm the superiority of universal model-free reinforcement learning agents over current portfolio management model in asset allocation strategies, with the achieved performance advantage of as much as 9.2% in annualized cumulative returns and 13.4% in annualized Sharpe Ratio.

We introduce an approach for imposing physically motivated inductive biases on graph networks to learn interpretable representations and improved zero-shot generalization. Our experiments show that our graph network models, which implement this inductive bias, can learn message representations equivalent to the true force vector when trained on n-body gravitational and spring-like simulations. We use symbolic regression to fit explicit algebraic equations to our trained model's message function and recover the symbolic form of Newton's law of gravitation without prior knowledge. We also show that our model generalizes better at inference time to systems with more bodies than had been experienced during training. Our approach is extensible, in principle, to any unknown interaction law learned by a graph network, and offers a valuable technique for interpreting and inferring explicit causal theories about the world from implicit knowledge captured by deep learning.

Effective and powerful methods for denoising real electrocardiogram (ECG) signals are important for wearable sensors and devices. Deep Learning (DL) models have been used extensively in image processing and other domains with great success but only very recently have been used in processing ECG signals. This paper presents several DL models namely Convolutional Neural Networks (CNNs), Long Short-Term Memory (LSTM), Restricted Boltzmann Machine (RBM) together with the more conventional filtering methods (low pass filtering, high pass filtering, Notch filtering) and the standard wavelet-based technique for denoising EEG signals. These methods are trained, tested and evaluated on different synthetic and real ECG datasets taken from the MIT PhysioNet database and for different simulation conditions (i.e. various lengths of the ECG signals, single or multiple records). The results show the CNN model is a performant model that can be used for off-line denoising ECG applications where it is satisfactory to train on a clean part of an ECG signal from an ECG record, and then to test on the same ECG signal, which would have some high level of noise added to it. However, for real-time applications or near-real time applications, this task becomes more cumbersome, as the clean part of an ECG signal is very probable to be very limited in size. Therefore the solution put forth in this work is to train a CNN model on 1 second ECG noisy artificial multiple heartbeat data (i.e. ECG at effort), which was generated in a first instance based on few sequences of real signal heartbeat ECG data (i.e. ECG at rest). Afterwards it would be possible to use the trained CNN model in real life situations to denoise the ECG signal.

Counterfactual reasoning requires predicting how alternative events, contrary to what actually happened, might have resulted in different outcomes. Despite being considered a necessary component of AI-complete systems, few resources have been developed for evaluating counterfactual reasoning in narratives. In this paper, we propose Counterfactual Story Rewriting: given an original story and an intervening counterfactual event, the task is to minimally revise the story to make it compatible with the given counterfactual event. Solving this task will require deep understanding of causal narrative chains and counterfactual invariance, and integration of such story reasoning capabilities into conditional language generation models. We present TimeTravel, a new dataset of 29,849 counterfactual rewritings, each with the original story, a counterfactual event, and human-generated revision of the original story compatible with the counterfactual event. Additionally, we include 80,115 counterfactual "branches" without a rewritten storyline to support future work on semi- or un-supervised approaches to counterfactual story rewriting. Finally, we evaluate the counterfactual rewriting capacities of several competitive baselines based on pretrained language models, and assess whether common overlap and model-based automatic metrics for text generation correlate well with human scores for counterfactual rewriting.

Each block contains a certain amount of data; and the chain connects these data to form a distributed database. New block needs to be approved by all or some of the network members to become a valid block. Each approved block includes information of the previous block in the chain, therefore if the block is changed, all blocks before this block will be invalid as well. The strategies to reach agreement of the new block (consensus) vary in different types of blockchain. The mathematical structure of the blockchain implies two essential properties: (i) the data (in block) is immutable; (ii) the distributed network with consensus allows users to communicate directly with each other and download a copy of the current ledger, which means that there is continuous monitoring and redundancy of the data in the network.