Search or filter publications

Filter by type:

Filter by publication type

Filter by year:



  • Showing results for:
  • Reset all filters

Search results

  • Journal article
    Kormushev P, Ugurlu B, Caldwell DG, Tsagarakis NGet al., 2019,

    Learning to exploit passive compliance for energy-efficient gait generation on a compliant humanoid

    , Autonomous Robots, Vol: 43, Pages: 79-95, ISSN: 1573-7527

    Modern 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.

  • Conference paper
    Kotonya N, Toni F, 2019,

    Gradual Argumentation Evaluation for Stance Aggregation in Automated Fake News Detection

    , 6th Workshop on Argument Mining (ArgMining), Publisher: ASSOC COMPUTATIONAL LINGUISTICS-ACL, Pages: 156-166
  • Journal article
    Eyerich K, Brown S, Perez White B, Tanaka RJ, Bissonette R, Dhar S, Bieber T, Hijnen DJ, Guttman-Yassky E, Irvine A, Thyssen JP, Vestergaard C, Werfel T, Wollenberg A, Paller A, Reynolds NJet al., 2019,

    Human and computational models of atopic dermatitis: A review and perspectives by an expert panel of the International Eczema Council

    , Journal of Allergy and Clinical Immunology, Vol: 143, Pages: 36-45, ISSN: 0091-6749

    Atopic dermatitis (AD) is a prevalent disease worldwide and is associated with systemic comorbidities representing a significant burden on patients, their families, and society. Therapeutic options for AD remain limited, in part because of a lack of well-characterized animal models. There has been increasing interest in developing experimental approaches to study the pathogenesis of human AD in vivo, in vitro, and in silico to better define pathophysiologic mechanisms and identify novel therapeutic targets and biomarkers that predict therapeutic response. This review critically appraises a range of models, including genetic mutations relevant to AD, experimental challenge of human skin in vivo, tissue culture models, integration of “omics” data sets, and development of predictive computational models. Although no one individual model recapitulates the complex AD pathophysiology, our review highlights insights gained into key elements of cutaneous biology, molecular pathways, and therapeutic target identification through each approach. Recent developments in computational analysis, including application of machine learning and a systems approach to data integration and predictive modeling, highlight the applicability of these methods to AD subclassification (endotyping), therapy development, and precision medicine. Such predictive modeling will highlight knowledge gaps, further inform refinement of biological models, and support new experimental and systems approaches to AD.

  • Conference paper
    Cyras K, Domínguez J, Karamlou A, Prociuk D, Curcin V, Delaney B, Toni F, Chalkidou K, Darzi Aet al., 2019,

    ROAD2H: Learning Decision Support System for Low- and Middle-Income Countries.

    , Publisher: AMIA
  • Journal article
    Cocarascu O, Toni F, 2018,

    Combining deep learning and argumentative reasoning for the analysis of social media textual content using small datasets

    , Computational Linguistics, Vol: 44, Pages: 833-858, ISSN: 0891-2017

    The use of social media has become a regular habit for many and has changed the way people interact with each other. In this article, we focus on analysing whether news headlines support tweets and whether reviews are deceptive by analysing the interaction or the influence that these texts have on the others, thus exploiting contextual information. Concretely, we define a deep learning method for Relation-based Argument Mining to extract argumentative relations of attack and support. We then use this method for determining whether news articles support tweets, a useful task in fact-checking settings, where determining agreement towards a statement is a useful step towards determining its truthfulness. Furthermore we use our method for extracting Bipolar Argumentation Frameworks from reviews to help detect whether they are deceptive. We show experimentally that our method performs well in both settings. In particular, in the case of deception detection, our method contributes a novel argumentative feature that, when used in combination with other features in standard supervised classifiers, outperforms the latter even on small datasets.

  • Journal article
    Clarke JM, Warren LR, Arora S, Barahona M, Darzi AW, Clarke JM, Warren LR, Arora S, Barahona M, Darzi AW, Clarke J, Warren L, Barahona M, Darzi Aet al., 2018,

    Guiding interoperable electronic health records through patient-sharing networks.

    , NPJ digital medicine, Vol: 1, Pages: 65-65, ISSN: 2398-6352

    Effective sharing of clinical information between care providers is a critical component of a safe, efficient health system. National data-sharing systems may be costly, politically contentious and do not reflect local patterns of care delivery. This study examines hospital attendances in England from 2013 to 2015 to identify instances of patient sharing between hospitals. Of 19.6 million patients receiving care from 155 hospital care providers, 130 million presentations were identified. On 14.7 million occasions (12%), patients attended a different hospital to the one they attended on their previous interaction. A network of hospitals was constructed based on the frequency of patient sharing between hospitals which was partitioned using the Louvain algorithm into ten distinct data-sharing communities, improving the continuity of data sharing in such instances from 0 to 65-95%. Locally implemented data-sharing communities of hospitals may achieve effective accessibility of clinical information without a large-scale national interoperable information system.

  • Conference paper
    Dutordoir V, Salimbeni HR, Hensman J, Deisenroth MPet al., 2018,

    Gaussian process conditional density estimation

    , Advances in Neural Information Processing Systems, Publisher: Neural Information Processing Systems Conference

    Conditional Density Estimation (CDE) models deal with estimating conditional distributions. The conditions imposed on the distribution are the inputs of the model. CDE is a challenging task as there is a fundamental trade-off between model complexity, representational capacity and overfitting. In this work, we propose to extend the model's input with latent variables and use Gaussian processes (GP) to map this augmented input onto samples from the conditional distribution. Our Bayesian approach allows for the modeling of small datasets, but we also provide the machinery for it to be applied to big data using stochastic variational inference. Our approach can be used to model densities even in sparse data regions, and allows for sharing learned structure between conditions. We illustrate the effectiveness and wide-reaching applicability of our model on a variety of real-world problems, such as spatio-temporal density estimation of taxi drop-offs, non-Gaussian noise modeling, and few-shot learning on omniglot images.

  • Conference paper
    Wang K, Shah A, Kormushev P, 2018,

    SLIDER: A Bipedal Robot with Knee-less Legs and Vertical Hip Sliding Motion

    , 21st International Conference on Climbing and Walking Robots and Support Technologies for Mobile Machines (CLAWAR 2018)
  • Conference paper
    Russo A, Law M, Broda K, 2018,

    AAAI 2019, Proceedings pf the 33rd AAAI Conference on Artificial Intelligence

    , AAAI-19: Thirty-Third AAAI Conference on Artificial intelligence
  • Conference paper
    Cyras K, Delaney B, Prociuk D, Toni F, Chapman M, Dominguez J, Curcin Vet al., 2018,

    Argumentation for explainable reasoning with conflicting medical recommendations

    , Reasoning with Ambiguous and Conflicting Evidence and Recommendations in Medicine (MedRACER 2018), Pages: 14-22

    Designing a treatment path for a patient suffering from mul-tiple conditions involves merging and applying multiple clin-ical guidelines and is recognised as a difficult task. This isespecially relevant in the treatment of patients with multiplechronic diseases, such as chronic obstructive pulmonary dis-ease, because of the high risk of any treatment change havingpotentially lethal exacerbations. Clinical guidelines are typi-cally designed to assist a clinician in treating a single condi-tion with no general method for integrating them. Addition-ally, guidelines for different conditions may contain mutuallyconflicting recommendations with certain actions potentiallyleading to adverse effects. Finally, individual patient prefer-ences need to be respected when making decisions.In this work we present a description of an integrated frame-work and a system to execute conflicting clinical guidelinerecommendations by taking into account patient specific in-formation and preferences of various parties. Overall, ourframework combines a patient’s electronic health record datawith clinical guideline representation to obtain personalisedrecommendations, uses computational argumentation tech-niques to resolve conflicts among recommendations while re-specting preferences of various parties involved, if any, andyields conflict-free recommendations that are inspectable andexplainable. The system implementing our framework willallow for continuous learning by taking feedback from thedecision makers and integrating it within its pipeline.

  • Conference paper
    Saputra RP, Kormushev P, 2018,

    Casualty detection from 3D point cloud data for autonomous ground mobile rescue robots

    , SSRR 2018, Publisher: IEEE

    One of the most important features of mobilerescue robots is the ability to autonomously detect casualties,i.e. human bodies, which are usually lying on the ground. Thispaper proposes a novel method for autonomously detectingcasualties lying on the ground using obtained 3D point-clouddata from an on-board sensor, such as an RGB-D camera ora 3D LIDAR, on a mobile rescue robot. In this method, theobtained 3D point-cloud data is projected onto the detectedground plane, i.e. floor, within the point cloud. Then, thisprojected point cloud is converted into a grid-map that isused afterwards as an input for the algorithm to detecthuman body shapes. The proposed method is evaluated byperforming detections of a human dummy, placed in differentrandom positions and orientations, using an on-board RGB-Dcamera on a mobile rescue robot called ResQbot. To evaluatethe robustness of the casualty detection method to differentcamera angles, the orientation of the camera is set to differentangles. The experimental results show that using the point-clouddata from the on-board RGB-D camera, the proposed methodsuccessfully detects the casualty in all tested body positions andorientations relative to the on-board camera, as well as in alltested camera angles.

  • Conference paper
    Wilson J, Hutter F, Deisenroth MP, 2018,

    Maximizing acquisition functions for Bayesian optimization

    , Advances in Neural Information Processing Systems (NIPS) 2018, ISSN: 1049-5258

    Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions are frequently non-trivial to optimize. This statement is especially true when evaluating queries in parallel, where acquisition functions are routinely non-convex, high-dimensional, and intractable. We first show that acquisition functions estimated via Monte Carlo integration are consistently amenable to gradient-based optimization. Subsequently, we identify a common family of acquisition functions, including EI and UCB, whose characteristics not only facilitate but justify use of greedy approaches for their maximization.

  • Conference paper
    Salimbeni HR, Cheng C-A, Boots B, Deisenroth MPet al., 2018,

    Orthogonally decoupled variational Gaussian processes

    , Advances in Neural Information Processing Systems (NIPS) 2018, Publisher: Massachusetts Institute of Technology Press, ISSN: 1049-5258

    Gaussian processes (GPs) provide a powerful non-parametric framework for rea-soning over functions. Despite appealing theory, its superlinear computational andmemory complexities have presented a long-standing challenge. State-of-the-artsparse variational inference methods trade modeling accuracy against complexity.However, the complexities of these methods still scale superlinearly in the numberof basis functions, implying that that sparse GP methods are able to learn fromlarge datasets only when a small model is used. Recently, a decoupled approachwas proposed that removes the unnecessary coupling between the complexitiesof modeling the mean and the covariance functions of a GP. It achieves a linearcomplexity in the number of mean parameters, so an expressive posterior meanfunction can be modeled. While promising, this approach suffers from optimizationdifficulties due to ill-conditioning and non-convexity. In this work, we propose analternative decoupled parametrization. It adopts an orthogonal basis in the meanfunction to model the residues that cannot be learned by the standard coupled ap-proach. Therefore, our method extends, rather than replaces, the coupled approachto achieve strictly better performance. This construction admits a straightforwardnatural gradient update rule, so the structure of the information manifold that islost during decoupling can be leveraged to speed up learning. Empirically, ouralgorithm demonstrates significantly faster convergence in multiple experiments.

  • Journal article
    Schulz C, Toni F, 2018,

    On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation

    , Artificial Intelligence, Vol: 262, Pages: 301-335, ISSN: 1872-7921

    Different semantics of abstract Argumentation Frameworks (AFs) provide different levels of decisiveness for reasoning about the acceptability of conflicting arguments. The stable semantics is useful for applications requiring a high level of decisiveness, as it assigns to each argument the label “accepted” or the label “rejected”. Unfortunately, stable labellings are not guaranteed to exist, thus raising the question as to which parts of AFs are responsible for the non-existence. In this paper, we address this question by investigating a more general question concerning preferred labellings (which may be less decisive than stable labellings but are always guaranteed to exist), namely why a given preferred labelling may not be stable and thus undecided on some arguments. In particular, (1) we give various characterisations of parts of an AF, based on the given preferred labelling, and (2) we show that these parts are indeed responsible for the undecisiveness if the preferred labelling is not stable. We then use these characterisations to explain the non-existence of stable labellings. We present two types of characterisations, based on labellings that are more (or equally) committed than the given preferred labelling on the one hand, and based on the structure of the given AF on the other, and compare the respective AF parts deemed responsible. To prove that our characterisations indeed yield responsible parts, we use a notion of enforcement of labels through structural revision, by means of which the preferred labelling of the given AF can be turned into a stable labelling of the structurally revised AF. Rather than prescribing how this structural revision is carried out, we focus on the enforcement of labels and leave the engineering of the revision open to fulfil differing requirements of applications and information available to users.

  • Conference paper
    Sæmundsson S, Hofmann K, Deisenroth MP, 2018,

    Meta reinforcement learning with latent variable Gaussian processes

    , Uncertainty in Artificial Intelligence (UAI) 2018, Publisher: Association for Uncertainty in Artificial Intelligence (AUAI)

    Learning from small data sets is critical inmany practical applications where data col-lection is time consuming or expensive, e.g.,robotics, animal experiments or drug design.Meta learning is one way to increase the dataefficiency of learning algorithms by general-izing learned concepts from a set of trainingtasks to unseen, but related, tasks. Often, thisrelationship between tasks is hard coded or re-lies in some other way on human expertise.In this paper, we frame meta learning as a hi-erarchical latent variable model and infer therelationship between tasks automatically fromdata. We apply our framework in a model-based reinforcement learning setting and showthat our meta-learning model effectively gen-eralizes to novel tasks by identifying how newtasks relate to prior ones from minimal data.This results in up to a60%reduction in theaverage interaction time needed to solve taskscompared to strong baselines.

  • Conference paper
    Saputra RP, Kormushev P, 2018,

    Casualty detection for mobile rescue robots via ground-projected point clouds

    , Towards Autonomous Robotic Systems (TAROS) 2018, Publisher: Springer, Cham, Pages: 473-475, ISSN: 0302-9743

    In order to operate autonomously, mobile rescue robots needto be able to detect human casualties in disaster situations. In this paper,we propose a novel method for autonomous detection of casualties lyingdown on the ground based on point-cloud data. This data can be obtainedfrom different sensors, such as an RGB-D camera or a 3D LIDAR sensor.The method is based on a ground-projected point-cloud (GPPC) imageto achieve human body shape detection. A preliminary experiment hasbeen conducted using the RANSAC method for floor detection and, theHOG feature and the SVM classifier to detect human body shape. Theresults show that the proposed method succeeds to identify a casualtyfrom point-cloud data in a wide range of viewing angles.

  • Conference paper
    Alrajeh D, Russo A, 2018,

    Logic-based learning: theory and application

    , International Dagstuhl Seminar 16172, Publisher: Springer, Pages: 219-256, ISSN: 0302-9743

    In recent years, research efforts have been directed towards the use of Machine Learning (ML) techniques to support and automate activities such as specification mining, risk assessment, program analysis, and program repair. The focus has largely been on the use of machine learning black box methods whose inference mechanisms are not easily interpretable and whose outputs are not declarative and guaranteed to be correct. Hence, they cannot readily be used to inform the elaboration and revision of declarative software models identified to be incorrect or incomplete. On the other hand, recent advances in ML have witnessed the emergence of new logic-based machine learning approaches that overcome such limitations and which have been proven to be well-suited for many software engineering tasks. In this chapter, we present a survey of the state-of-the-art of logic-based machine learning techniques, highlight their expressivity, define their different underlying semantics, and discuss their efficiency and the heuristics they adopt to guide the search for solutions. We then demonstrate the application of this type of machine learning to (declarative) specification refinement and revision as a complementary task to program analysis.

  • Conference paper
    Cocarascu O, Cyras K, Toni F, 2018,

    Explanatory predictions with artificial neural networks and argumentation

    , Workshop on Explainable Artificial Intelligence (XAI)

    Data-centric AI has proven successful in severaldomains, but its outputs are often hard to explain.We present an architecture combining ArtificialNeural Networks (ANNs) for feature selection andan instance of Abstract Argumentation (AA) forreasoning to provide effective predictions, explain-able both dialectically and logically. In particular,we train an autoencoder to rank features in input ex-amples, and select highest-ranked features to gen-erate an AA framework that can be used for mak-ing and explaining predictions as well as mappedonto logical rules, which can equivalently be usedfor making predictions and for explaining.Weshow empirically that our method significantly out-performs ANNs and a decision-tree-based methodfrom which logical rules can also be extracted.

  • Conference paper
    Rago A, Cocarascu O, Toni F, 2018,

    Argumentation-based recommendations: fantastic explanations and how to find them

    , The Twenty-Seventh International Joint Conference on Artificial Intelligence, (IJCAI 2018), Pages: 1949-1955

    A significant problem of recommender systems is their inability to explain recommendations, resulting in turn in ineffective feedback from users and the inability to adapt to users’ preferences. We propose a hybrid method for calculating predicted ratings, built upon an item/aspect-based graph with users’ partially given ratings, that can be naturally used to provide explanations for recommendations, extracted from user-tailored Tripolar Argumentation Frameworks (TFs). We show that our method can be understood as a gradual semantics for TFs, exhibiting a desirable, albeit weak, property of balance. We also show experimentally that our method is competitive in generating correct predictions, compared with state-of-the-art methods, and illustrate how users can interact with the generated explanations to improve quality of recommendations.

  • Conference paper
    Olofsson S, Deisenroth M, Misener R, 2018,

    Design of experiments for model discrimination hybridising analytical and data-driven approaches

    , 35th International Conference on Machine Learning (ICML), Publisher: ICML

    Healthcare companies must submit pharmaceuti-cal drugs or medical devices to regulatory bodiesbefore marketing new technology. Regulatorybodies frequently require transparent and inter-pretable computational modelling to justify a newhealthcare technology, but researchers may haveseveral competing models for a biological sys-tem and too little data to discriminate betweenthe models. In design of experiments for modeldiscrimination, the goal is to design maximallyinformative physical experiments in order to dis-criminate between rival predictive models. Priorwork has focused either on analytical approaches,which cannot manage all functions, or on data-driven approaches, which may have computa-tional difficulties or lack interpretable marginalpredictive distributions. We develop a method-ology introducing Gaussian process surrogatesin lieu of the original mechanistic models. Wethereby extend existing design and model discrim-ination methods developed for analytical modelsto cases of non-analytical models in a computa-tionally efficient manner.

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.

Request URL: Request URI: /respub/WEB-INF/jsp/search-t4-html.jsp Query String: id=989&limit=20&page=4&respub-action=search.html Current Millis: 1614586035346 Current Time: Mon Mar 01 08:07:15 GMT 2021