Results
- Showing results for:
- Reset all filters
Search results
-
Conference paperPotyka N, Yin X, Toni F, 2022,
On the tradeoff between correctness and completeness in argumentative explainable AI
, 1st International Workshop on Argumentation for eXplainable AI, Publisher: CEUR Workshop Proceedings, Pages: 1-8, ISSN: 1613-0073Explainable AI aims at making the decisions of autonomous systems human-understandable. Argumentation frameworks are a natural tool for this purpose. Among them, bipolar abstract argumentation frameworks seem well suited to explain the effect of features on a classification decision and their formal properties can potentially be used to derive formal guarantees for explanations. Two particular interesting properties are correctness (if the explanation says that X affects Y, then X affects Y ) and completeness (if X affects Y, then the explanation says that X affects Y ). The reinforcement property of bipolar argumentation frameworks has been used as a natural correctness counterpart in previous work. Applied to the classification context, it basically states that attacking features should decrease and supporting features should increase the confidence of a classifier. In this short discussion paper, we revisit this idea, discuss potential limitations when considering reinforcement without a corresponding completeness property and how these limitations can potentially be overcome.
-
Journal articleZhuang Y, Cheng S, Kovalchuk N, et al., 2022,
Ensemble latent assimilation with deep learning surrogate model: application to drop interaction in a microfluidics device
, Lab on a Chip: miniaturisation for chemistry, physics, biology, materials science and bioengineering, Vol: 22, Pages: 3187-3202, ISSN: 1473-0189A major challenge in the field of microfluidics is to predict and control drop interactions. This work develops an image-based data-driven model to forecast drop dynamics based on experiments performed on a microfluidics device. Reduced-order modelling techniques are applied to compress the recorded images into low-dimensional spaces and alleviate the computational cost. Recurrent neural networks are then employed to build a surrogate model of drop interactions by learning the dynamics of compressed variables in the reduced-order space. The surrogate model is integrated with real-time observations using data assimilation. In this paper we developed an ensemble-based latent assimilation algorithm scheme which shows an improvement in terms of accuracy with respect to the previous approaches. This work demonstrates the possibility to create a reliable data-driven model enabling a high fidelity prediction of drop interactions in microfluidics device. The performance of the developed system is evaluated against experimental data (i.e., recorded videos), which are excluded from the training of the surrogate model. The developed scheme is general and can be applied to other dynamical systems.
-
Journal articleCheng S, Prentice IC, Huang Y, et al., 2022,
Data-driven surrogate model with latent data-assimilation: application to wildfire forecasting
, Journal of Computational Physics, Vol: 464, ISSN: 0021-9991The large and catastrophic wildfires have been increasing across the globe in the recent decade, highlighting the importance of simulating and forecasting fire dynamics in near real-time. This is extremely challenging due to the complexities of physical models and geographical features. Running physics-based simulations for large wildfire events in near real-time are computationally expensive, if not infeasible. In this work, we develop and test a novel data-model integration scheme for fire progression forecasting, that combines Reduced-order modelling, recurrent neural networks (Long-Short-Term Memory), data assimilation, and error covariance tuning. The Reduced-order modelling and the machine learning surrogate model ensure the efficiency of the proposed approach while the data assimilation enables the system to adjust the simulation with observations. We applied this algorithm to simulate and forecast three recent large wildfire events in California from 2017 to 2020. The deep-learning-based surrogate model runs around 1000 times faster than the Cellular Automata simulation which is used to generate training data-sets. The daily fire perimeters derived from satellite observation are used as observation data in Latent Assimilation to adjust the fire forecasting in near real-time. An error covariance tuning algorithm is also performed in the reduced space to estimate prior simulation and observation errors. The evolution of the averaged relative root mean square error (R-RMSE) shows that data assimilation and covariance tuning reduce the RMSE by about 50% and considerably improves the forecasting accuracy. As a first attempt at a reduced order wildfire spread forecasting, our exploratory work showed the potential of data-driven machine learning models to speed up fire forecasting for various applications.
-
Conference paperIrwin B, Rago A, Toni F, 2022,
Forecasting argumentation frameworks
, 19th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022), Publisher: IJCAI Organisation, Pages: 533-543, ISSN: 2334-1033We introduce Forecasting Argumentation Frameworks(FAFs), a novel argumentation-based methodology forforecasting informed by recent judgmental forecastingresearch. FAFs comprise update frameworks which empower(human or artificial) agents to argue over time about theprobability of outcomes, e.g. the winner of a politicalelection or a fluctuation in inflation rates, whilst flaggingperceived irrationality in the agents’ behaviour with a viewto improving their forecasting accuracy. FAFs include fiveargument types, amounting to standard pro/con arguments,as in bipolar argumentation, as well as novel proposalarguments and increase/decrease amendment arguments. Weadapt an existing gradual semantics for bipolar argumen-tation to determine the aggregated dialectical strength ofproposal arguments and define irrational behaviour. We thengive a simple aggregation function which produces a finalgroup forecast from rational agents’ individual forecasts.We identify and study properties of FAFs and conductan empirical evaluation which signals FAFs’ potential toincrease the forecasting accuracy of participants.
-
Conference paperJiang J, Rago A, Toni F, 2022,
Should counterfactual explanations always be data instances?
, XLoKR 2022: The Third Workshop on Explainable Logic-Based Knowledge RepresentationCounterfactual explanations (CEs) are an increasingly popular way of explaining machine learning classifiers. Predominantly, they amount to data instances pointing to potential changes to the inputs that would lead to alternative outputs. In this position paper we question the widespread assumption that CEs should always be data instances, and argue instead that in some cases they may be better understood in terms of special types of relations between input features and classification variables. We illustrate how a special type of these relations, amounting to critical influences, can characterise and guide the search for data instances deemed suitable as CEs. These relations also provide compact indications of which input features - rather than their specific values in data instances - have counterfactual value.
-
Conference paperWard F, Toni F, Belardinelli F, 2022,
A causal perspective on AI deception in games
, AI Safety 2022 (IJCAI-ECAI-22), Publisher: CEUR Workshop Proceedings, Pages: 1-16Deception is a core challenge for AI safety and we focus on the problem that AI agents might learndeceptive strategies in pursuit of their objectives. We define the incentives one agent has to signal toand deceive another agent. We present several examples of deceptive artificial agents and show that ourdefinition has desirable properties.
-
Conference paperRago A, Baroni P, Toni F, 2022,
Explaining causal models with argumentation: the case of bi-variate reinforcement
, 19th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022), Publisher: IJCAI Organisation, Pages: 505-509, ISSN: 2334-1033Causal models are playing an increasingly important role inmachine learning, particularly in the realm of explainable AI.We introduce a conceptualisation for generating argumenta-tion frameworks (AFs) from causal models for the purposeof forging explanations for the models’ outputs. The concep-tualisation is based on reinterpreting desirable properties ofsemantics of AFs as explanation moulds, which are meansfor characterising the relations in the causal model argumen-tatively. We demonstrate our methodology by reinterpretingthe property of bi-variate reinforcement as an explanationmould to forge bipolar AFs as explanations for the outputs ofcausal models. We perform a theoretical evaluation of theseargumentative explanations, examining whether they satisfy arange of desirable explanatory and argumentative propertie
-
Conference paperGaskell A, Miao Y, Toni F, et al., 2022,
Logically consistent adversarial attacks for soft theorem provers
, 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence, Publisher: International Joint Conferences on Artificial Intelligence, Pages: 4129-4135Recent efforts within the AI community haveyielded impressive results towards “soft theoremproving” over natural language sentences using lan-guage models. We propose a novel, generativeadversarial framework for probing and improvingthese models’ reasoning capabilities. Adversarialattacks in this domain suffer from the logical in-consistency problem, whereby perturbations to theinput may alter the label. Our Logically consis-tent AdVersarial Attacker, LAVA, addresses this bycombining a structured generative process with asymbolic solver, guaranteeing logical consistency.Our framework successfully generates adversarialattacks and identifies global weaknesses commonacross multiple target models. Our analyses revealnaive heuristics and vulnerabilities in these mod-els’ reasoning capabilities, exposing an incompletegrasp of logical deduction under logic programs.Finally, in addition to effective probing of thesemodels, we show that training on the generatedsamples improves the target model’s performance.
-
Journal articleLever J, Arcucci R, 2022,
Sentimental wildfire: a social-physics machine learning model for wildfire nowcasting
, Journal of Computational Social Science, Vol: 5, Pages: 1427-1465, ISSN: 2432-2717The intensity of wildfires and wildfire season length is increasing due to climate change, causing a greater threat to the local population. Much of this population are increasingly adopting social media, and sites like Twitter are increasingly being used as a real-time human-sensor network during natural disasters; detecting, tracking and documenting events. The human-sensor concept is currently largely omitted by wildfire models, representing a potential loss of information. By including Twitter data as a source in our models, we aim to help disaster managers make more informed, socially driven decisions, by detecting and monitoring online social media sentiment over the course of a wildfire event. This paper implements machine learning in a wildfire prediction model, using social media and geophysical data sources with Sentiment Analysis to predict wildfire characteristics with high accuracy. We also use wildfire-specific attributes to predict online social dynamics, as this has been shown to be indicative of localised disaster severity. This may be useful for disaster management teams in identifying areas of immediate danger. We combine geophysical satellite data from the Global Fire Atlas with social data provided by Twitter. We perform data collection and subsequent analysis & visualisation, and compare regional differences in online social sentiment expression. Following this, we compare and contrast different machine learning models for predicting wildfire attributes. We demonstrate social media is a predictor of wildfire activity, and present models which accurately model wildfire attributes. This work develops the concept of the human sensor in the context of wildfires, using users’ Tweets as noisy subjective sentimental accounts of current localised conditions. This work contributes to the development of more socially conscious wildfire models, by incorporating social media data into wildfire prediction and modelling.
-
Conference paperSukpanichnant P, Rago A, Lertvittayakumjorn P, et al., 2022,
Neural QBAFs: explaining neural networks under LRP-based argumentation frameworks
, International Conference of the Italian Association for Artificial Intelligence, Publisher: Springer International Publishing, Pages: 429-444, ISSN: 0302-9743In recent years, there have been many attempts to combine XAI with the field of symbolic AI in order to generate explanations for neural networks that are more interpretable and better align with human reasoning, with one prominent candidate for this synergy being the sub-field of computational argumentation. One method is to represent neural networks with quantitative bipolar argumentation frameworks (QBAFs) equipped with a particular semantics. The resulting QBAF can then be viewed as an explanation for the associated neural network. In this paper, we explore a novel LRP-based semantics under a new QBAF variant, namely neural QBAFs (nQBAFs). Since an nQBAF of a neural network is typically large, the nQBAF must be simplified before being used as an explanation. Our empirical evaluation indicates that the manner of this simplification is all important for the quality of the resulting explanation.
-
Conference paperLim B, Allard M, Grillotti L, et al., 2022,
QDax: on the benefits of massive parallelization for quality-diversity
, Genetic and Evolutionary Computation Conference (GECCO), Publisher: Association for Computing Machinery, Pages: 128-131Quality-Diversity (QD) algorithms are a well-known approach to generate large collections of diverse and high-quality policies. However, QD algorithms are also known to be data-inefficient, requiring large amounts of computational resources and are slow when used in practice for robotics tasks. Policy evaluations are already commonly performed in parallel to speed up QD algorithms but have limited capabilities on a single machine as most physics simulators run on CPUs. With recent advances in simulators that run on accelerators, thousands of evaluations can be performed in parallel on single GPU/TPU. In this paper, we present QDax, an implementation of MAP-Elites which leverages massive parallelism on accelerators to make QD algorithms more accessible. We show that QD algorithms are ideal candidates and can scale with massive parallelism to be run at interactive timescales. The increase in parallelism does not significantly affect the performance of QD algorithms, while reducing experiment runtimes by two factors of magnitudes, turning days of computation into minutes. These results show that QD can now benefit from hardware acceleration, which contributed significantly to the bloom of deep learning.
-
Conference paperSchupp S, Leofante F, Behr L, et al., 2022,
Robot swarms as hybrid systems: modelling and verification
, Publisher: Open Publishing Association, Pages: 61-77, ISSN: 2075-2180A swarm robotic system consists of a team of robots performing cooperative tasks without any centralized coordination. In principle, swarms enable flexible and scalable solutions; however, designing individual control algorithms that can guarantee a required global behavior is difficult. Formal methods have been suggested by several researchers as a mean to increase confidence in the behavior of the swarm. In this work, we propose to model swarms as hybrid systems and use reachability analysis to verify their properties. We discuss challenges and report on the experience gained from applying hybrid formalisms to the verification of a swarm robotic system.
-
Conference paperLim BWT, Grillotti L, Bernasconi L, et al., 2022,
Dynamics-aware quality-diversity for efficient learning of skill repertoires
, IEEE International Conference on Robotics and Automation, Publisher: IEEE, Pages: 5360-5366Quality-Diversity (QD) algorithms are powerful exploration algorithms that allow robots to discover large repertoires of diverse and high-performing skills. However, QD algorithms are sample inefficient and require millionsof evaluations. In this paper, we propose Dynamics-Aware Quality-Diversity (DA-QD), a framework to improve the sample efficiency of QD algorithms through the use of dynamics models. We also show how DA-QD can then be used for continual acquisition of new skill repertoires. To do so, weincrementally train a deep dynamics model from experience obtained when performing skill discovery using QD. We can then perform QD exploration in imagination with an imagined skill repertoire. We evaluate our approach on three robotic experiments. First, our experiments show DA-QD is 20 timesmore sample efficient than existing QD approaches for skill discovery. Second, we demonstrate learning an entirely new skill repertoire in imagination to perform zero-shot learning. Finally, we show how DA-QD is useful and effective for solving a long horizon navigation task and for damage adaptation in the real world. Videos and source code are available at: https://sites.google.com/view/da-qd.
-
Conference paperLim BWT, Reichenbach A, Cully A, 2022,
Learning to walk autonomously via reset-free quality-diversity
, The Genetic and Evolutionary Computation Conference (GECCO)Quality-Diversity (QD) algorithms can discover large and complex behavioural repertoires consisting of both diverse and high-performing skills. However, the generation of behavioural repertoires has mainly been limited to simulation environments instead of real-world learning. This is because existing QD algorithms need large numbers of evaluations as well as episodic resets, which require manual human supervision and interventions. This paper proposes Reset-Free Quality-Diversity optimization (RF-QD) as a step towards autonomous learning for robotics in open-ended environments. We build on Dynamics-Aware Quality-Diversity (DA-QD) and introduce a behaviour selection policy that leverages the diversity of the imagined repertoire and environmental information to intelligently select of behaviours that can act as automatic resets. We demonstrate this through a task of learning to walk within defined training zones with obstacles. Our experiments show that we can learn full repertoires of legged locomotion controllers autonomously without manual resets with high sample efficiency in spite of harsh safety constraints. Finally, using an ablation of different target objectives, we show that it is important for RF-QD to have diverse types solutions available for the behaviour selection policy over solutions optimised with a specific objective. Videos and code available at this https URL.
-
Conference paperPierrot T, Macé V, Chalumeau F, et al., 2022,
Diversity Policy Gradient for Sample Efficient Quality-Diversity Optimization
, The Genetic and Evolutionary Computation Conference (GECCO) -
Conference paperAllard M, Smith Bize S, Chatzilygeroudis K, et al., 2022,
Hierarchical Quality-Diversity For Online Damage Recovery
, The Genetic and Evolutionary Computation Conference, Publisher: ACMAdaptation capabilities, like damage recovery, are crucial for the deployment of robots in complex environments. Several works have demonstrated that using repertoires of pre-trained skills can enable robots to adapt to unforeseen mechanical damages in a few minutes. These adaptation capabilities are directly linked to the behavioural diversity in the repertoire. The more alternatives the robot has to execute a skill, the better are the chances that it can adapt to a new situation. However, solving complex tasks, like maze navigation, usually requires multiple different skills. Finding a large behavioural diversity for these multiple skills often leads to an intractable exponential growth of the number of required solutions.In this paper, we introduce the Hierarchical Trial and Error algorithm, which uses a hierarchical behavioural repertoire to learn diverse skills and leverages them to make the robot more adaptive to different situations. We show that the hierarchical decomposition of skills enables the robot to learn more complex behaviours while keeping the learning of the repertoire tractable. The experiments with a hexapod robot show that our method solves maze navigation tasks with 20% less actions in the most challenging scenarios than the best baseline while having 57% less complete failures.
-
Journal articleCheng S, Jin Y, Harrison S, et al., 2022,
Parameter flexible wildfire prediction using machine learning techniques: forward and inverse modelling
, Remote Sensing, Vol: 14, ISSN: 2072-4292Parameter identification for wildfire forecasting models often relies on case-by-case tuning or posterior diagnosis/analysis, which can be computationally expensive due to the complexity of the forward prediction model. In this paper, we introduce an efficient parameter flexible fire prediction algorithm based on machine learning and reduced order modelling techniques. Using a training dataset generated by physics-based fire simulations, the method forecasts burned area at different time steps with a low computational cost. We then address the bottleneck of efficient parameter estimation by developing a novel inverse approach relying on data assimilation techniques (latent assimilation) in the reduced order space. The forward and the inverse modellings are tested on two recent large wildfire events in California. Satellite observations are used to validate the forward prediction approach and identify the model parameters. By combining these forward and inverse approaches, the system manages to integrate real-time observations for parameter adjustment, leading to more accurate future predictions.
-
Conference paperGrillotti L, Cully A, 2022,
Relevance-guided unsupervised discovery of abilities with quality-diversity algorithms
, Genetic and Evolutionary Computation Conference (GECCO), Publisher: ACM, Pages: 77-85Quality-Diversity algorithms provide efficient mechanisms to generate large collections of diverse and high-performing solutions, which have shown to be instrumental for solving downstream tasks. However, most of those algorithms rely on a behavioural descriptor to characterise the diversity that is hand-coded, hence requiring prior knowledge about the considered tasks. In this work, we introduce Relevance-guided Unsupervised Discovery of Abilities; a Quality-Diversity algorithm that autonomously finds a behavioural characterisation tailored to the task at hand. In particular, our method introduces a custom diversity metric that leads to higher densities of solutions near the areas of interest in the learnt behavioural descriptor space. We evaluate our approach on a simulated robotic environment, where the robot has to autonomously discover its abilities based on its full sensory data. We evaluated the algorithms on three tasks: navigation to random targets, moving forward with a high velocity, and performing half-rolls. The experimental results show that our method manages to discover collections of solutions that are not only diverse, but also well-adapted to the considered downstream task.
-
Book chapterLever J, Arcucci R, 2022,
Towards Social Machine Learning for Natural Disasters
, Computational Science – ICCS 2022 22nd International Conference, London, UK, June 21–23, 2022, Proceedings, Part III, Publisher: Springer, Pages: 756-769, ISBN: 9783031087561The four-volume set LNCS 13350, 13351, 13352, and 13353 constitutes the proceedings of the 22ndt International Conference on Computational Science, ICCS 2022, held in London, UK, in June 2022.* The total of 175 full papers and 78 short ...
-
Journal articleSchneider R, Bonavita M, Geer A, et al., 2022,
ESA-ECMWF Report on recent progress and research directions in machine learning for Earth System observation and prediction
, NPJ CLIMATE AND ATMOSPHERIC SCIENCE, Vol: 5, ISSN: 2397-3722- Cite
- Citations: 8
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.
Contact us
Artificial Intelligence Network
South Kensington Campus
Imperial College London
SW7 2AZ
To reach the elected speaker of the network, Dr Rossella Arcucci, please contact:
To reach the network manager, Diana O'Malley - including to join the network - please contact: