Every so often, a technology with the potential to disrupt clinical practice emerges and the medical literature explodes with new studies. These seismic events present a challenge to the peer review process because many reviewers and editorial board members may be unfamiliar with how to evaluate them. Complicating matters, early adopters and thought leaders may not use consistent terminology, may not report results similarly, or may not appreciate fully the potential for inaccurate conclusions based on interpretation errors.

Robots such as Mitra are being used to reduce risk of infection for medical staff. Standing just 5ft tall, Mitra navigates around the hospital wards, guided by facial recognition technology and with a chest-mounted tablet that allows patients and their loved ones to see each other. Developed in recent years by the Bengaluru startup Invento Robotics, Mitra costs around $13,600 (£10,000) and – due to the reduced risk of infection to doctors – has become hugely popular in Indian hospitals during the pandemic. Since making headlines at its debut in 2017 at an international summit, where it greeted Ivanka Trump and interacted with India's prime minister Narendra Modi, Mitra has increasingly been put to use in hospitals treating Covid-19 patients. "Mitra was originally meant for care homes, but was adapted during the pandemic to assist doctors and nurses by taking vital readings, and to help in consultations," says Balaji Viswanathan, chief executive of Invento Robotics, which now exports the robot to five countries including the US and Australia.

We consider the problem of designing policies for Markov decision processes (MDPs) with dynamic coherent risk objectives and constraints. We begin by formulating the problem in a Lagrangian framework. Under the assumption that the risk objectives and constraints can be represented by a Markov risk transition mapping, we propose an optimization-based method to synthesize Markovian policies that lower-bound the constrained risk-averse problem. We demonstrate that the formulated optimization problems are in the form of difference convex programs (DCPs) and can be solved by the disciplined convex-concave programming (DCCP) framework. We show that these results generalize linear programs for constrained MDPs with total discounted expected costs and constraints. Finally, we illustrate the effectiveness of the proposed method with numerical experiments on a rover navigation problem involving conditional-value-at-risk (CVaR) and entropic-value-at-risk (EVaR) coherent risk measures.

Research on notable accomplishments and important events in the life of people of public interest usually requires close reading of long encyclopedic or biographical sources, which is a tedious and time-consuming task. Whereas semantic reference sources, such as the EventKG knowledge graph, provide structured representations of relevant facts, they often include hundreds of events and temporal relations for particular entities. In this paper, we present EventKG+BT - a timeline generation system that creates concise and interactive spatio-temporal representations of biographies from a knowledge graph using distant supervision.

The study of human mobility is crucial due to its impact on several aspects of our society, such as disease spreading, urban planning, well-being, pollution, and more. The proliferation of digital mobility data, such as phone records, GPS traces, and social media posts, combined with the outstanding predictive power of artificial intelligence, triggered the application of deep learning to human mobility. In particular, the literature is focusing on three tasks: next-location prediction, i.e., predicting an individual's future locations; crowd flow prediction, i.e., forecasting flows on a geographic region; and trajectory generation, i.e., generating realistic individual trajectories. Existing surveys focus on single tasks, data sources, mechanistic or traditional machine learning approaches, while a comprehensive description of deep learning solutions is missing. This survey provides: (i) basic notions on mobility and deep learning; (ii) a review of data sources and public datasets; (iii) a description of deep learning models and (iv) a discussion about relevant open challenges. Our survey is a guide to the leading deep learning solutions to next-location prediction, crowd flow prediction, and trajectory generation. At the same time, it helps deep learning scientists and practitioners understand the fundamental concepts and the open challenges of the study of human mobility.

In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In multi-winner approval voting (AV), an agent submits a ballot consisting of approvals for as many candidates as they wish, and winners are chosen by tallying up the votes and choosing the top-$k$ candidates receiving the most approvals. In many scenarios, an agent may manipulate the ballot they submit in order to achieve a better outcome by voting in a way that does not reflect their true preferences. In complex and uncertain situations, agents may use heuristics instead of incurring the additional effort required to compute the manipulation which most favors them. In this paper, we examine voting behavior in single-winner and multi-winner approval voting scenarios with varying degrees of uncertainty using behavioral data obtained from Mechanical Turk. We find that people generally manipulate their vote to obtain a better outcome, but often do not identify the optimal manipulation. There are a number of predictive models of agent behavior in the COMSOC and psychology literature that are based on cognitively plausible heuristic strategies. We show that the existing approaches do not adequately model real-world data. We propose a novel model that takes into account the size of the winning set and human cognitive constraints, and demonstrate that this model is more effective at capturing real-world behaviors in multi-winner approval voting scenarios.

We present a method for learning dynamics of complex physical processes described by time-dependent nonlinear partial differential equations (PDEs). Our particular interest lies in extrapolating solutions in time beyond the range of temporal domain used in training. Our choice for a baseline method is physics-informed neural network (PINN) [Raissi et al., J. Comput. Phys., 378:686--707, 2019] because the method parameterizes not only the solutions but also the equations that describe the dynamics of physical processes. We demonstrate that PINN performs poorly on extrapolation tasks in many benchmark problems. To address this, we propose a novel method for better training PINN and demonstrate that our newly enhanced PINNs can accurately extrapolate solutions in time. Our method shows up to 72% smaller errors than existing methods in terms of the standard L2-norm metric.

Recent works have demonstrated that deep learning on graphs is vulnerable to adversarial attacks, in that imperceptible perturbations on input data can lead to dramatic performance deterioration. In this paper, we focus on the underlying problem of learning robust representations on graphs via mutual information. In contrast to previous works measure the task-specific robustness based on the label space, we here take advantage of the representation space to study a task-free robustness measure given the joint input space w.r.t graph topology and node attributes. We formulate this problem as a constrained saddle point optimization problem and solve it efficiently in a reduced search space. Furthermore, we provably establish theoretical connections between our task-free robustness measure and the robustness of downstream classifiers. Extensive experiments demonstrate that our proposed method is able to enhance robustness against adversarial attacks on graphs, yet even increases natural accuracy.

As machine learning (ML) has been applied to facilitate decision-making in various areas, such as hiring, loan grading etc., there have been and continue to be increasing concerns [3, 31] that ML models will inevitably "learn undesired bias" from the training data and make unfair predictions. From algorithms erroneously detecting suspects of crimes base on the color of their skin [7] and deciding who goes to jail [26], to algorithms used to predict test scores that provide unfairly higher scores to socioeconomically privileged students, allowing them to enter universities at a higher rate [27], the lack of understanding and control of undesired bias in ML models has tangible consequences. To deal with this challenge of biased models, many researchers have devoted their efforts, e.g., [15, 17, 35, 8, 2] to define, detect and mitigate bias in ML over the past decade. These approaches mainly measure and reduce undesired bias with respect to a sensitive attribute, such as age or race, in the training dataset. Although many of them provide various effective approaches, they all focus on centralized ML, where the training dataset is stored in a single place, executing the learning procedure, and hence assume full access to the entire dataset.

New footage of Arecibo Observatory collapsing in the jungle of Puerto Rico shows the moment its main cables snapped and sent a massive platform hurling to the ground - triggering a reaction that led to its destruction. Drones were investigating cables around the telescope when the restraints failed and dropped the 900-ton platform onto to the reflector dish 400 feet below. In one of the videos, the platform begins swaying in the air before letting out a loud roar as it dislodged from the supporting cable and snapping into pieces as it dropped. The second part of the clip is a view of the cables at the top of a support tower, which shows a group of frayed wires and an empty spot where cables were that had previously failed this year. One of the cables begins to strain and then violently flies out of its support, creating a cloud of smoke and debris.