Publications
Results
- Showing results for:
- Reset all filters
Search results
-
Conference paperLertvittayakumjorn P, Toni F, 2019,
Human-grounded evaluations of explanation methods for text classification
, 2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing, Publisher: ACL Anthology, Pages: 5195-5205Due to the black-box nature of deep learning models, methods for explaining the models’ results are crucial to gain trust from humans and support collaboration between AIsand humans. In this paper, we consider several model-agnostic and model-specific explanation methods for CNNs for text classification and conduct three human-grounded evaluations, focusing on different purposes of explanations: (1) revealing model behavior, (2)justifying model predictions, and (3) helping humans investigate uncertain predictions.The results highlight dissimilar qualities of thevarious explanation methods we consider andshow the degree to which these methods couldserve for each purpose.
-
Conference paperFalck F, Doshi S, Smuts N, et al., 2019,
Human-centered manipulation and navigation with robot DE NIRO
Social assistance robots in health and elderly care have the potential tosupport and ease human lives. Given the macrosocial trends of aging andlong-lived populations, robotics-based care research mainly focused on helpingthe elderly live independently. In this paper, we introduce Robot DE NIRO, aresearch platform that aims to support the supporter (the caregiver) and alsooffers direct human-robot interaction for the care recipient. Augmented byseveral sensors, DE NIRO is capable of complex manipulation tasks. It reliablyinteracts with humans and can autonomously and swiftly navigate throughdynamically changing environments. We describe preliminary experiments in ademonstrative scenario and discuss DE NIRO's design and capabilities. We putparticular emphases on safe, human-centered interaction procedures implementedin both hardware and software, including collision avoidance in manipulationand navigation as well as an intuitive perception stack through speech and facerecognition.
-
Journal articleČyras K, Birch D, Guo Y, et al., 2019,
Explanations by arbitrated argumentative dispute
, Expert Systems with Applications, Vol: 127, Pages: 141-156, ISSN: 0957-4174Explaining outputs determined algorithmically by machines is one of the most pressing and studied problems in Artificial Intelligence (AI) nowadays, but the equally pressing problem of using AI to explain outputs determined by humans is less studied. In this paper we advance a novel methodology integrating case-based reasoning and computational argumentation from AI to explain outcomes, determined by humans or by machines, indifferently, for cases characterised by discrete (static) features and/or (dynamic) stages. At the heart of our methodology lies the concept of arbitrated argumentative disputesbetween two fictitious disputants arguing, respectively, for or against a case's output in need of explanation, and where this case acts as an arbiter. Specifically, in explaining the outcome of a case in question, the disputants put forward as arguments relevant cases favouring their respective positions, with arguments/cases conflicting due to their features, stages and outcomes, and the applicability of arguments/cases arbitrated by the features and stages of the case in question. We in addition use arbitrated dispute trees to identify the excess features that help the winning disputant to win the dispute and thus complement the explanation. We evaluate our novel methodology theoretically, proving desirable properties thereof, and empirically, in the context of primary legislation in the United Kingdom (UK), concerning the passage of Bills that may or may not become laws. High-level factors underpinning a Bill's passage are its content-agnostic features such as type, number of sponsors, ballot order, as well as the UK Parliament's rules of conduct. Given high numbers of proposed legislation (hundreds of Bills a year), it is hard even for legal experts to explain on a large scale why certain Bills pass or not. We show how our methodology can address this problem by automatically providing high-level explanations of why Bills pass or not, based on the given Bills and the
-
Conference paperLaw M, Russo A, Bertino E, et al., 2019,
Representing and learning grammars in answer set programming
, AAAI-19: Thirty-third AAAI Conference on Artificial Intelligence, Publisher: Association for the Advancement of Artificial Intelligence, Pages: 2919-2928In this paper we introduce an extension of context-free grammars called answer set grammars (ASGs). These grammars allow annotations on production rules, written in the language of Answer Set Programming (ASP), which can express context-sensitive constraints. We investigate the complexity of various classes of ASG with respect to two decision problems: deciding whether a given string belongs to the language of an ASG and deciding whether the language of an ASG is non-empty. Specifically, we show that the complexity of these decision problems can be lowered by restricting the subset of the ASP language used in the annotations. To aid the applicability of these grammars to computational problems that require context-sensitive parsers for partially known languages, we propose a learning task for inducing the annotations of an ASG. We characterise the complexity of this task and present an algorithm for solving it. An evaluation of a (prototype) implementation is also discussed.
-
Conference paperTavakoli A, Levdik V, Islam R, et al., 2019,
Exploring Restart Distributions
, Montréal, Canada, The Fourth Multidisciplinary Conference on Reinforcement Learning and Decision Making, Publisher: arXivWe consider the generic approach of using an experience memory to help exploration by adapting a restart distribution. That is, given the capacity to reset the state with those corresponding to the agent's past observations, we help exploration by promoting faster state-space coverage via restarting the agent from a more diverse set of initial states, as well as allowing it to restart in states associated with significant past experiences. This approach is compatible with both on-policy and off-policy methods. However, a caveat is that altering the distribution of initial states could change the optimal policies when searching within a restricted class of policies. To reduce this unsought learning bias, we evaluate our approach in deep reinforcement learning which benefits from the high representational capacity of deep neural networks. We instantiate three variants of our approach, each inspired by an idea in the context of experience replay. Using these variants, we show that performance gains can be achieved, especially in hard exploration problems.
-
Conference paperČyras K, Letsios D, Misener R, et al., 2019,
Argumentation for explainable scheduling
, Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), Publisher: AAAI, Pages: 2752-2759Mathematical optimization offers highly-effective tools for finding solutions for problems with well-defined goals, notably scheduling. However, optimization solvers are often unexplainable black boxes whose solutions are inaccessible to users and which users cannot interact with. We define a novel paradigm using argumentation to empower the interaction between optimization solvers and users, supported by tractable explanations which certify or refute solutions. A solution can be from a solver or of interest to a user (in the context of 'what-if' scenarios). Specifically, we define argumentative and natural language explanations for why a schedule is (not) feasible, (not) efficient or (not) satisfying fixed user decisions, based on models of the fundamental makespan scheduling problem in terms of abstract argumentation frameworks (AFs). We define three types of AFs, whose stable extensions are in one-to-one correspondence with schedules that are feasible, efficient and satisfying fixed decisions, respectively. We extract the argumentative explanations from these AFs and the natural language explanations from the argumentative ones.
-
Journal articleJohnston I, Hoffmann T, Greenbury S, et al., 2019,
Precision identification of high-risk phenotypes and progression pathways in severe malaria without requiring longitudinal data
, npj Digital Medicine, Vol: 2, ISSN: 2398-6352More than 400,000 deaths from severe malaria (SM) are reported every year, mainly in African children. The diversity of clinical presentations associated with SM indicates important differences in disease pathogenesis that require specific treatment, and this clinical heterogeneity of SM remains poorly understood. Here, we apply tools from machine learning and model-based inference to harness large-scale data and dissect the heterogeneity in patterns of clinical features associated with SM in 2904 Gambian children admitted to hospital with malaria. This quantitative analysis reveals features predicting the severity of individual patient outcomes, and the dynamic pathways of SM progression, notably inferred without requiring longitudinal observations. Bayesian inference of these pathways allows us assign quantitative mortality risks to individual patients. By independently surveying expert practitioners, we show that this data-driven approach agrees with and expands the current state of knowledge on malaria progression, while simultaneously providing a data-supported framework for predicting clinical risk.
-
Journal articleEspinosa-González AB, Delaney BC, Marti J, et al., 2019,
The impact of governance in primary health care delivery: a systems thinking approach with a European panel
, Health Research Policy and Systems, Vol: 17, Pages: 1-16, ISSN: 1478-4505Enhancing primary health care (PHC) is considered a policy priority for health systems strengthening due to PHC’s ability to provide accessible and continuous care and manage multimorbidity. Research in PHC often focuses on the effects of specific interventions (e.g. physicians’ contracts) in health care outcomes. This informs narrowly designed policies that disregard the interactions between the health functions (e.g. financing and regulation) and actors involved (i.e. public, professional, private), and their impact in care delivery and outcomes. The purpose of this study is to analyse the interactions between PHC functions and their impact in PHC delivery, particularly in providers’ behaviour and practice organisation.
-
Conference paperFalck F, Larppichet K, Kormushev P, 2019,
DE VITO: A dual-arm, high degree-of-freedom, lightweight, inexpensive, passive upper-limb exoskeleton for robot teleoperation
, TAROS: Annual Conference Towards Autonomous Robotic Systems, Publisher: Springer, ISSN: 0302-9743While robotics has made significant advances in perception, planning and control in recent decades, the vast majority of tasks easily completed by a human, especially acting in dynamic, unstructured environments, are far from being autonomously performed by a robot. Teleoperation, remotely controlling a slave robot by a human operator, can be a realistic, complementary transition solution that uses the motion intelligence of a human in complex tasks while exploiting the robot’s autonomous reliability and precision in less challenging situations.We introduce DE VITO, a seven degree-of-freedom, dual-arm upper-limb exoskeleton that passively measures the pose of a human arm. DE VITO is a lightweight, simplistic and energy-efficient design with a total material cost of at least an order of magnitude less than previous work. Given the estimated human pose, we implement both joint and Cartesian space kinematic control algorithms and present qualitative experimental results on various complex manipulation tasks teleoperating Robot DE NIRO, a research platform for mobile manipulation, that demonstrate the functionality of DE VITO. We provide the CAD models, open-source code and supplementary videos of DE VITO at http://www.imperial.ac.uk/robot-intelligence/robots/de_vito/.
-
Conference paperAlAttar A, Rouillard L, Kormushev P, 2019,
Autonomous air-hockey playing cobot using optimal control and vision-based Bayesian tracking
, Towards Autonomous Robotic Systems, Publisher: Springer, ISSN: 0302-9743This paper presents a novel autonomous air-hockey playing collaborative robot (cobot) that provides human-like gameplay against human opponents. Vision-based Bayesian tracking of the puck and striker are used in an Analytic Hierarchy Process (AHP)-based probabilistic tactical layer for high-speed perception. The tactical layer provides commands for an active control layer that controls the Cartesian position and yaw angle of a custom end effector. The active layer uses optimal control of the cobot’s posture inside the task nullspace. The kinematic redundancy is resolved using a weighted Moore-Penrose pseudo-inversion technique. Experiments with human players show high-speed human-like gameplay with potential applications in the growing field of entertainment robotics.
-
Conference paperArulkumaran K, Cully A, Togelius J, 2019,
AlphaStar: an evolutionary computation perspective
, The Genetic and Evolutionary Computation Conference 2019, Publisher: ACM, Pages: 314-315In January 2019, DeepMind revealed AlphaStar to the world—thefirst artificial intelligence (AI) system to beat a professional playerat the game of StarCraft II—representing a milestone in the progressof AI. AlphaStar draws on many areas of AI research, includingdeep learning, reinforcement learning, game theory, and evolution-ary computation (EC). In this paper we analyze AlphaStar primar-ily through the lens of EC, presenting a new look at the systemandrelating it to many concepts in the field. We highlight some ofitsmost interesting aspects—the use of Lamarckian evolution,com-petitive co-evolution, and quality diversity. In doing so,we hopeto provide a bridge between the wider EC community and one ofthe most significant AI systems developed in recent times.
-
Journal articleSchaub MT, Delvenne JC, Lambiotte R, et al., 2019,
Multiscale dynamical embeddings of complex networks
, Physical Review E, Vol: 99, Pages: 062308-1-062308-18, ISSN: 1539-3755Complex systems and relational data are often abstracted as dynamical processes on networks. To understand, predict, and control their behavior, a crucial step is to extract reduced descriptions of such networks. Inspired by notions from control theory, we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect a node-input has on the network. This dynamical similarity induces an embedding that can be employed for several analysis tasks. Here we focus on (i) dimensionality reduction, i.e., projecting nodes onto a low-dimensional space that captures dynamic similarity at different timescales, and (ii) how to exploit our embeddings to uncover functional modules. We exemplify our ideas through case studies focusing on directed networks without strong connectivity and signed networks. We further highlight how certain ideas from community detection can be generalized and linked to control theory, by using the here developed dynamical perspective.
-
Journal articleMoriconi R, Kumar KSS, Deisenroth MP, 2020,
High-dimensional Bayesian optimization with projections using quantile Gaussian processes
, Optimization Letters, ISSN: 1862-4472 -
Journal articleWarren L, Clarke J, Arora S, et al., 2019,
Transitions of care across hospital settings in patients with inflammatory bowel disease
, World Journal of Gastroenterology, Vol: 25, Pages: 2122-2132, ISSN: 1007-9327BACKGROUNDInflammatory bowel disease (IBD) is a chronic, inflammatory disorder characterised by both intestinal and extra-intestinal pathology. Patients may receive both emergency and elective care from several providers, often in different hospital settings. Poorly managed transitions of care between providers can lead to inefficiencies in care and patient safety issues. To ensure that the sharing of patient information between providers is appropriate, timely, accurate and secure, effective data-sharing infrastructure needs to be developed. To optimise inter-hospital data-sharing for IBD patients, we need to better understand patterns of hospital encounters in this group.AIMTo determine the type and location of hospital services accessed by IBD patients in England.METHODSThis was a retrospective observational study using Hospital Episode Statistics, a large administrative patient data set from the National Health Service in England. Adult patients with a diagnosis of IBD following admission to hospital were followed over a 2-year period to determine the proportion of care accessed at the same hospital providing their outpatient IBD care, defined as their ‘home provider’. Secondary outcome measures included the geographic distribution of patient-sharing, regional and age-related differences in accessing services, and type and frequency of outpatient encounters.RESULTSOf 95055 patients accessed hospital services on 1760156 occasions over a 2-year follow-up period. The proportion of these encounters with their identified IBD ‘home provider’ was 73.3%, 87.8% and 83.1% for accident and emergency, inpatient and outpatient encounters respectively. Patients living in metropolitan centres and younger patients were less likely to attend their ‘home provider’ for hospital services. The most commonly attended specialty services were gastroenterology, general surgery and ophthalmology.CONCLUSIONTransitions of care between secondary care sett
-
Journal articleBertone G, Deisenroth MP, Kim JS, et al., 2019,
Accelerating the BSM interpretation of LHC data with machine learning
, PHYSICS OF THE DARK UNIVERSE, Vol: 24, ISSN: 2212-6864 -
Journal articleKuntz J, Thomas P, Stan G-B, et al., 2019,
The exit time finite state projection scheme: bounding exit distributions and occupation measures of continuous-time Markov chains
, SIAM Journal on Scientific Computing, Vol: 41, Pages: A748-A769, ISSN: 1064-8275We introduce the exit time finite state projection (ETFSP) scheme, a truncation- based method that yields approximations to the exit distribution and occupation measure associated with the time of exit from a domain (i.e., the time of first passage to the complement of the domain) of time-homogeneous continuous-time Markov chains. We prove that: (i) the computed approximations bound the measures from below; (ii) the total variation distances between the approximations and the measures decrease monotonically as states are added to the truncation; and (iii) the scheme converges, in the sense that, as the truncation tends to the entire state space, the total variation distances tend to zero. Furthermore, we give a computable bound on the total variation distance between the exit distribution and its approximation, and we delineate the cases in which the bound is sharp. We also revisit the related finite state projection scheme and give a comprehensive account of its theoretical properties. We demonstrate the use of the ETFSP scheme by applying it to two biological examples: the computation of the first passage time associated with the expression of a gene, and the fixation times of competing species subject to demographic noise.
-
Journal articleZhong Q, Fan X, Luo X, et al., 2019,
An explainable multi-attribute decision model based on argumentation
, Expert Systems with Applications, Vol: 117, Pages: 42-61, ISSN: 0957-4174We present a multi-attribute decision model and a method for explaining the decisions it recommends based on an argumentative reformulation of the model. Specifically, (i) we define a notion of best (i.e., minimally redundant) decisions amounting to achieving as many goals as possible and exhibiting as few redundant attributes as possible, and (ii) we generate explanations for why a decision is best or better than or as good as another, using a mapping between the given decision model and an argumentation framework, such that best decisions correspond to admissible sets of arguments. Concretely, natural language explanations are generated automatically from dispute trees sanctioning the admissibility of arguments. Throughout, we illustrate the power of our approach within a legal reasoning setting, where best decisions amount to past cases that are most similar to a given new, open case. Finally, we conduct an empirical evaluation of our method with legal practitioners, confirming that our method is effective for the choice of most similar past cases and helpful to understand automatically generated recommendations.
-
Journal articleBello G, Dawes T, Duan J, et al., 2019,
Deep learning cardiac motion analysis for human survival prediction
, Nature Machine Intelligence, Vol: 1, Pages: 95-104, ISSN: 2522-5839Motion analysis is used in computer vision to understand the behaviour of moving objects in sequences of images. Optimizing the interpretation of dynamic biological systems requires accurate and precise motion tracking as well as efficient representations of high-dimensional motion trajectories so that these can be used for prediction tasks. Here we use image sequences of the heart, acquired using cardiac magnetic resonance imaging, to create time-resolved three-dimensional segmentations using a fully convolutional network trained on anatomical shape priors. This dense motion model formed the input to a supervised denoising autoencoder (4Dsurvival), which is a hybrid network consisting of an autoencoder that learns a task-specific latent code representation trained on observed outcome data, yielding a latent representation optimized for survival prediction. To handle right-censored survival outcomes, our network used a Cox partial likelihood loss function. In a study of 302 patients, the predictive accuracy (quantified by Harrell’s C-index) was significantly higher (P = 0.0012) for our model C = 0.75 (95% CI: 0.70–0.79) than the human benchmark of C = 0.59 (95% CI: 0.53–0.65). This work demonstrates how a complex computer vision task using high-dimensional medical image data can efficiently predict human survival.
-
Journal articleBaroni P, Rago A, Toni F, 2019,
From fine-grained properties to broad principles for gradual argumentation: A principled spectrum
, International Journal of Approximate Reasoning, Vol: 105, Pages: 252-286, ISSN: 0888-613XThe study of properties of gradual evaluation methods in argumentation has received increasing attention in recent years, with studies devoted to various classes of frameworks/ methods leading to conceptually similar but formally distinct properties in different contexts. In this paper we provide a novel systematic analysis for this research landscape by making three main contributions. First, we identify groups of conceptually related properties in the literature, which can be regarded as based on common patterns and, using these patterns, we evidence that many further novel properties can be considered. Then, we provide a simplifying and unifying perspective for these groups of properties by showing that they are all implied by novel parametric principles of (either strict or non-strict) balance and monotonicity. Finally, we show that (instances of) these principles (and thus the group, literature and novel properties that they imply) are satisfied by several quantitative argumentation formalisms in the literature, thus confirming the principles' general validity and utility to support a compact, yet comprehensive, analysis of properties of gradual argumentation.
-
Journal articleKormushev P, Ugurlu B, Caldwell DG, et al., 2019,
Learning to exploit passive compliance for energy-efficient gait generation on a compliant humanoid
, Autonomous Robots, Vol: 43, Pages: 79-95, ISSN: 0929-5593Modern humanoid robots include not only active compliance but also passive compliance. Apart from improved safety and dependability, availability of passive elements, such as springs, opens up new possibilities for improving the energy efficiency. With this in mind, this paper addresses the challenging open problem of exploiting the passive compliance for the purpose of energy efficient humanoid walking. To this end, we develop a method comprising two parts: an optimization part that finds an optimal vertical center-of-mass trajectory, and a walking pattern generator part that uses this trajectory to produce a dynamically-balanced gait. For the optimization part, we propose a reinforcement learning approach that dynamically evolves the policy parametrization during the learning process. By gradually increasing the representational power of the policy parametrization, it manages to find better policies in a faster and computationally efficient way. For the walking generator part, we develop a variable-center-of-mass-height ZMP-based bipedal walking pattern generator. The method is tested in real-world experiments with the bipedal robot COMAN and achieves a significant 18% reduction in the electric energy consumption by learning to efficiently use the passive compliance of the robot.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.