Zen monks have been using a tool called a'koan' for hundreds of years to assist them in reaching enlightenment. These koans are like riddles or stories that can only be solved by letting go of ones narrowing believes and stories about how things should be. Zen students sit in silent meditation and observe how the koan is working on them, slowly transforming their way of looking at the world and revealing a tiny piece of the path to nirvana, that place of no suffering. "Zen is like a man hanging by his teeth in a tree over a precipice. His hands grasp no branch, his feet rest on no limb, and under the tree another man asks him, 'Why did Bodhidharma come to China from the West?' If the man in the tree does not answer, he misses the question, and if he answers, he falls and loses his life. Now what shall he do?" -- Zen Koan -- Case 5 of the Gateless Gate Collection.

IN THE UK, essential workers are now among those being sent home testing kits for coronavirus. This involves swabbing the inside of your own nose and the back of your throat, but how useful are the results? Studies from early in the outbreak in China have suggested that swabs taken by healthcare professionals may give a 30 per cent "false negative" rate, where infected people are told they don't have the virus (NEJM, doi.org/ggmzsp; medRxiv, doi.org/dvfr). This has prompted claims that self-testing will give even more false negatives and could raise the risk of infected people spreading the virus. No test is perfect – swabbing technique and analysis errors can lead to inaccurate results.

We study the problem usually referred to as group testing in the context of COVID-19. Given $n$ samples taken from patients, how should we select mixtures of samples to be tested, so as to maximize information and minimize the number of tests? We consider both adaptive and non-adaptive strategies, and take a Bayesian approach with a prior both for infection of patients and test errors. We start by proposing a mathematically principled objective, grounded in information theory. We then optimize non-adaptive optimization strategies using genetic algorithms, and leverage the mathematical framework of adaptive sub-modularity to obtain theoretical guarantees for the greedy-adaptive method.

Dynamic networks are used in a wide range of fields, including social network analysis, recommender systems and epidemiology. Representing complex networks as structures changing over time allow network models to leverage not only structural but also temporal patterns. However, as dynamic network literature stems from diverse fields and makes use of inconsistent terminology, it is challenging to navigate. Meanwhile, graph neural networks (GNNs) have gained a lot of attention in recent years for their ability to perform well on a range of network science tasks, such as link prediction and node classification. Despite the popularity of graph neural networks and the proven benefits of dynamic network models, there has been little focus on graph neural networks for dynamic networks. We aim to provide a review that demystifies dynamic networks, introduces dynamic graph neural networks (DGNNs) and appeals to researchers with a background in either network science or data science. We contribute: (i) a comprehensive dynamic network taxonomy, (ii) a survey of dynamic graph neural networks and (iii) an overview of how dynamic graph neural networks can be used for dynamic link prediction.

On April 3, the U.S. Centers for Disease Control and Prevention (CDC) recommended "wearing cloth face coverings in public settings where other social distancing measures are difficult to maintain (e.g., grocery stores and pharmacies) especially in areas of significant community-based transmission" of COVID-19. Despite a plethora of health experts telling it to do so since then, the White House only complied with this health guidance Monday. It sent an email to staffers ordering all of them to wear face masks inside the building. White House staffers can take-off their masks while they're seated at their desks and are able to maintain six feet of distance from others. Incredibly, President Donald Trump is exempted from this order, aides told The Washington Post.

In new plans that offer a national reimagining of how to fight wildfires amid the risk of the coronavirus spreading through crews, it's not clear how officials will get the testing and equipment needed to keep firefighters safe in what's expected to be a difficult fire season. A U.S. group instead put together broad guidelines to consider when sending crews to blazes, with agencies and firefighting groups in different parts of the country able to tailor them to fit their needs. The wildfire season has largely begun, and states in the American West that have suffered catastrophic blazes in recent years could see higher-than-normal levels of wildfire because of drought. "This plan is intended to provide a higher-level framework of considerations and not specific operational procedures," the National Multi-Agency Coordination Group, made up of representatives from federal agencies who worked with state and local officials, wrote in each of the regional plans. "It is not written in terms of'how to' but instead provides considerations of'what,' 'why,' and'where.'"

The rapidly developing AI systems and applications still require human involvement in practically all parts of the analytics process. Human decisions are largely based on visualizations, providing data scientists details of data properties and the results of analytical procedures. Different visualizations are used in the different steps of the Machine Learning (ML) process. The decision which visualization to use depends on factors, such as the data domain, the data model and the step in the ML process. In this chapter, we describe the seven steps in the ML process and review different visualization techniques that are relevant for the different steps for different types of data, models and purposes.

This paper addresses the learning task of estimating driver drowsiness from the signals of car acceleration sensors. Since even drivers themselves cannot perceive their own drowsiness in a timely manner unless they use burdensome invasive sensors, obtaining labeled training data for each timestamp is not a realistic goal. To deal with this difficulty, we formulate the task as a weakly supervised learning. We only need to add labels for each complete trip, not for every timestamp independently. By assuming that some aspects of driver drowsiness increase over time due to tiredness, we formulate an algorithm that can learn from such weakly labeled data. We derive a scalable stochastic optimization method as a way of implementing the algorithm. Numerical experiments on real driving datasets demonstrate the advantages of our algorithm against baseline methods.

A key objective in multi-view learning is to model the information common to multiple parallel views of a class of objects/events to improve downstream learning tasks. In this context, two open research questions remain: How can we model hundreds of views per event? Can we learn robust multi-view embeddings without any knowledge of how these views are acquired? We present a neural method based on multi-view correlation to capture the information shared across a large number of views by subsampling them in a view-agnostic manner during training. To provide an upper bound on the number of views to subsample for a given embedding dimension, we analyze the error of the bootstrapped multi-view correlation objective using matrix concentration theory. Our experiments on spoken word recognition, 3D object classification and pose-invariant face recognition demonstrate the robustness of view bootstrapping to model a large number of views. Results underscore the applicability of our method for a view-agnostic learning setting.

Goal recognition is the problem of recognizing the intended goal of autonomous agents or humans by observing their behavior in an environment. Over the past years, most existing approaches to goal and plan recognition have been ignoring the need to deal with imperfections regarding the domain model that formalizes the environment where autonomous agents behave. In this thesis, we introduce the problem of goal recognition over imperfect domain models, and develop solution approaches that explicitly deal with two distinct types of imperfect domains models: (1) incomplete discrete domain models that have possible, rather than known, preconditions and effects in action descriptions; and (2) approximate continuous domain models, where the transition function is approximated from past observations and not well-defined. We develop novel goal recognition approaches over imperfect domains models by leveraging and adapting existing recognition approaches from the literature. Experiments and evaluation over these two types of imperfect domains models show that our novel goal recognition approaches are accurate in comparison to baseline approaches from the literature, at several levels of observability and imperfections.