The world's tech powers are sending giant sums of money spinning into Canada, but while many see this as a sign of success, others are worried about researchers and intellectual property being swallowed wholesale. The country is in the midst of an artificial intelligence (AI) boom, with Google, Microsoft, Facebook, Huawei and other global heavyweights spending millions or even hundreds of millions of dollars on research hubs in Quebec, Ontario and Alberta. Canadian doors are open – some fear too open. Jim Hinton, an IP lawyer and founder of the Own Innovation consultancy, reckons that more than half of all AI patents in Canada end up being owned by foreign companies. What we need to be doing is getting money out of our ideas ourselves, instead of seeing foreign talent scoop it all up," said Hinton. "Otherwise we'll never have a Canadian champion." The country is home to hundreds of fledgling AI companies, including much-talked-about start-ups like Element AI and Deep Genomics, but they remain relatively small. "They don't have a strong market position yet," Hinton says. Deep learning pioneers such as Yoshua Bengio and Geoffrey Hinton (no relation to Jim) have nurtured top-notch talent in AI in Canada for years, back when AI was an emerging field. But despite Canadian inheriting this brilliant AI lead from the country's AI "godfathers", big foreign players have an unassailable advantage over homegrown efforts, Hinton said. "It's not an easy go for the average company to make a business out of AI.

In the last 10 years or so, global financial institutions and regulatory bodies have come together to unleash a battery of regulations for Banking, Insurance, and Micro-economies. The advancement of new technologies such as AI, Machine Learning Engineering, Big Data, Cloud and Edge Computing, Blockchain and Crypto, and low-code DevOps, have heavily disrupted the RegTech industry. This primer dives deep into the world of Regulatory Tech, or RegTech which is disrupted by the new emerging technologies. But, first, let's learn some basic definitions and industry trends. In a recent blog, Brian Clark, CEO of Ascent had said that RegTech is slated to become mainstream, even as early adopters begin "to see the actual, tangible benefit" these RegTech tools can provide.

State-of-the-art performance and low system complexity has made deep-learning an increasingly attractive solution for big data analytics. However, limiting assumptions of end-to-end learning regimes hinder the use of neural networks on large application-grade datasets. This work addresses the assumption that output class-labels are defined for all classes in the domain. The amount of data collected by modern-day sensors span over an incomprehensible range of potential classes. Therefore, we propose a new learning regime where only some, but not all, classes of the training data are of interest to the classification system. The semi-supervised learning scenario in big data requires the assumption of a partial class mismatch between labelled and unlabelled training data. With classification systems required to classify source classes indicated by labelled samples while separating novel classes indicated by unlabelled samples, we find ourselves in an open-set case (vs closed set with only source classes). However, introducing samples from novel classes into the training set indicates a more relaxed open-set case. As such, our proposed regime of \textit{quasi-open set semi-supervised learning} is introduced. We propose a suitable method to train under quasi-open set semi-supervised learning that makes use of Wasserstein generative adversarial networks (WGANs). A trained classification certainty estimation within the discriminator (or critic) network is used to enable a reject option for the classifier. By placing a threshold on this certainty estimation, the reject option accepts classifications of source classes and rejects novel classes. Big data end-to-end training is promoted by developing models that recognize input samples do not necessarily belong to output labels. We believe this essential for big data analytics, and urge more work under quasi-open set semi-supervised learning.

Lightning strokes create powerful electromagnetic pulses that routinely cause very low frequency (VLF) waves to propagate across hemispheres along geomagnetic field lines. VLF antenna receivers can be used to detect these whistler waves generated by these lightning strokes. The particular time/frequency dependence of the received whistler wave enables the estimation of electron density in the plasmasphere region of the magnetosphere. Therefore the identification and characterisation of whistlers are important tasks to monitor the plasmasphere in real time and to build large databases of events to be used for statistical studies. The current state of the art in detecting whistler is the Automatic Whistler Detection (A WD) method developed by Lichtenberger (2009) [1]. This method is based on image correlation in 2 dimensions and requires significant computing hardware situated at the VLF receiver antennas (e.g. in Antarctica). The aim of this work is to develop a machine learning based model capable of automatically detecting whistlers in the data provided by the VLF receivers. The approach is to use a combination of image classification and localisation on the spectrogram data generated by the VLF receivers to identify and localise each whistler. The data at hand has around 2300 events identified by A WD at SANAE and Marion and will be used as training, validation, and testing data. Three detector designs have been proposed. The first one using a similar method to A WD, the second using image classification on regions of interest extracted from a spectrogram, and the last one using YOLO, the current state of the art in object detection. It has been shown that these detectors can achieve a misdetection and false alarm of less than 15% on Marion's dataset. 1 Introduction Lightning strokes create powerful electromagnetic pulses that result in Very Low Frequency (VLF) waves propagating along the magnetic field lines of the earth. Due to the dipole shape of the geomagnetic field, these waves travel upward from the stroke location out through portions of the plasmasphere and back to the Earth's surface at the field line foot point in the opposite hemisphere. VLF antenna receivers set up at various high and middle latitude locations can detect whistler waves generated by these lightning strokes. The propagation time delay of these waves is dependent on the plasma density along the propagation path. This enables the use of whistler wave observations for characterising the plasmasphere in terms of particle number and energy density. The dynamics of energetic particle populations in the plasmasphere are an important factor in characterising the risk to spacecraft in orbit around Earth. Annual global lightning flash rates are on the order of 45 flash/s [2].

Today's Daily AI Roundup covers the latest Artificial Intelligence announcements on AI capabilities, AI mobility products, Robotic Service, Technology from Blue Prism, HCL Technologies, Noble.AI, Tata Consultancy Services and 4Cite. To equip young talent with the digital skills and experience needed for the future job market, Blue Prism, a global leader in Robotic Process Automation, has collaborated with the EY Foundation, a UK charity helping young people access employment opportunities, to provide paid work experience and mentors through the EY Foundation ten month Smart Futures programme. HCL Technologies (HCL), a leading global technology company, announced that it has been named a Top Employer 2020 in the United Kingdom, Sweden, Germany, the Netherlands, Poland, France and South Africa. Dentsu Aegis Network has acquired 4Cite Marketing, a leading people-based identification and data services technology company.

As more and more complex AI systems are introduced into our day-to-day lives, it becomes important that everyday users can work and interact with such systems with relative ease. Orchestrating such interactions require the system to be capable of providing explanations and rationale for its decisions and be able to field queries about alternative decisions. A significant hurdle to allowing for such explanatory dialogue could be the mismatch between the complex representations that the systems use to reason about the task and the terms in which the user may be viewing the task. This paper introduces methods that can be leveraged to provide contrastive explanations in terms of user-specified concepts for deterministic sequential decision-making settings where the system dynamics may be best represented in terms of black box simulators. We do this by assuming that system dynamics can at least be partly captured in terms of symbolic planning models, and we provide explanations in terms of these models. We implement this method using a simulator for a popular Atari game (Montezuma's Revenge) and perform user studies to verify whether people would find explanations generated in this form useful.

Knowledge Graphs (KGs) have found many applications in industry and academic settings, which in turn, have motivated considerable research efforts towards large-scale information extraction from a variety of sources. Despite such efforts, it is well known that even state-of-the-art KGs suffer from incompleteness. Link Prediction (LP), the task of predicting missing facts among entities already a KG, is a promising and widely studied task aimed at addressing KG incompleteness. Among the recent LP techniques, those based on KG embeddings have achieved very promising performances in some benchmarks. Despite the fast growing literature in the subject, insufficient attention has been paid to the effect of the various design choices in those methods. Moreover, the standard practice in this area is to report accuracy by aggregating over a large number of test facts in which some entities are over-represented; this allows LP methods to exhibit good performance by just attending to structural properties that include such entities, while ignoring the remaining majority of the KG. This analysis provides a comprehensive comparison of embedding-based LP methods, extending the dimensions of analysis beyond what is commonly available in the literature. We experimentally compare effectiveness and efficiency of 16 state-of-the-art methods, consider a rule-based baseline, and report detailed analysis over the most popular benchmarks in the literature.

With the development of deep representation learning, the domain of reinforcement learning (RL) has become a powerful learning framework now capable of learning complex policies in high dimensional environments. This review summarises deep reinforcement learning (DRL) algorithms, provides a taxonomy of automated driving tasks where (D)RL methods have been employed, highlights the key challenges algorithmically as well as in terms of deployment of real world autonomous driving agents, the role of simulators in training agents, and finally methods to evaluate, test and robustifying existing solutions in RL and imitation learning.

We propose an algorithm to actively estimate the parameters of a linear dynamical system. Given complete control over the system's input, our algorithm adaptively chooses the inputs to accelerate estimation. We show a finite time bound quantifying the estimation rate our algorithm attains and prove matching upper and lower bounds which guarantee its asymptotic optimality, up to constants. In addition, we show that this optimal rate is unattainable when using Gaussian noise to excite the system, even with optimally tuned covariance, and analyze several examples where our algorithm provably improves over rates obtained by playing noise. Our analysis critically relies on a novel result quantifying the error in estimating the parameters of a dynamical system when arbitrary periodic inputs are being played. We conclude with numerical examples that illustrate the effectiveness of our algorithm in practice.

Data-driven approaches, most prominently deep learning, have become powerful tools for prediction in many domains. A natural question to ask is whether data-driven methods could also be used for numerical weather prediction. First studies show promise but the lack of a common dataset and evaluation metrics make inter-comparison between studies difficult. Here we present a benchmark dataset for data-driven medium-range weather forecasting, a topic of high scientific interest for atmospheric and computer scientists alike. We provide data derived from the ERA5 archive that has been processed to facilitate the use in machine learning models. We propose a simple and clear evaluation metric which will enable a direct comparison between different methods. Further, we provide baseline scores from simple linear regression techniques, deep learning models as well as purely physical forecasting models. All data is publicly available and the companion code is reproducible with tutorials for getting started. We hope that this dataset will accelerate research in data-driven weather forecasting.