Goto

Collaborating Authors

 Oceania


Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with Lazy Clients

arXiv.org Artificial Intelligence

Federated learning (FL), as a distributed machine learning approach, has drawn a great amount of attention in recent years. FL shows an inherent advantage in privacy preservation, since users' raw data are processed locally. However, it relies on a centralized server to perform model aggregation. Therefore, FL is vulnerable to server malfunctions and external attacks. In this paper, we propose a novel framework by integrating blockchain into FL, namely, blockchain assisted decentralized federated learning (BLADE-FL), to enhance the security of FL. The proposed BLADE-FL has a good performance in terms of privacy preservation, tamper resistance, and effective cooperation of learning. However, it gives rise to a new problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to conceal their cheating behaviors. To be specific, we first develop a convergence bound of the loss function with the presence of lazy clients and prove that it is convex with respect to the total number of generated blocks $K$. Then, we solve the convex problem by optimizing $K$ to minimize the loss function. Furthermore, we discover the relationship between the optimal $K$, the number of lazy clients, and the power of artificial noises used by lazy clients. We conduct extensive experiments to evaluate the performance of the proposed framework using the MNIST and Fashion-MNIST datasets. Our analytical results are shown to be consistent with the experimental results. In addition, the derived optimal $K$ achieves the minimum value of loss function, and in turn the optimal accuracy performance.


Explainable AI for Software Engineering

arXiv.org Artificial Intelligence

Abstract--Artificial Intelligence/Machine Learning techniques have been widely used in software engineering to improve developer productivity, the quality of software systems, and decision-making. However, such AI/ML models for software engineering are still impractical, not explainable, and not actionable. These concerns often hinder the adoption of AI/ML models in software engineering practices. Then, we summarize three successful case studies on how explainable AI techniques can be used to address the aforementioned challenges by making software defect prediction models more practical, explainable, and actionable. Who should perform this task?


A Self-Supervised Feature Map Augmentation (FMA) Loss and Combined Augmentations Finetuning to Efficiently Improve the Robustness of CNNs

arXiv.org Artificial Intelligence

Deep neural networks are often not robust to semantically-irrelevant changes in the input. In this work we address the issue of robustness of state-of-the-art deep convolutional neural networks (CNNs) against commonly occurring distortions in the input such as photometric changes, or the addition of blur and noise. These changes in the input are often accounted for during training in the form of data augmentation. We have two major contributions: First, we propose a new regularization loss called feature-map augmentation (FMA) loss which can be used during finetuning to make a model robust to several distortions in the input. Second, we propose a new combined augmentations (CA) finetuning strategy, that results in a single model that is robust to several augmentation types at the same time in a data-efficient manner. We use the CA strategy to improve an existing state-of-the-art method called stability training (ST). Using CA, on an image classification task with distorted images, we achieve an accuracy improvement of on average 8.94% with FMA and 8.86% with ST absolute on CIFAR-10 and 8.04% with FMA and 8.27% with ST absolute on ImageNet, compared to 1.98% and 2.12%, respectively, with the well known data augmentation method, while keeping the clean baseline performance.


The Model Counting Competition 2020

arXiv.org Artificial Intelligence

Many computational problems in modern society account to probabilistic reasoning, statistics, and combinatorics. A variety of these real-world questions can be solved by representing the question in (Boolean) formulas and associating the number of models of the formula directly with the answer to the question. Since there has been an increasing interest in practical problem solving for model counting over the last years, the Model Counting (MC) Competition was conceived in fall 2019. The competition aims to foster applications, identify new challenging benchmarks, and to promote new solvers and improve established solvers for the model counting problem and versions thereof. We hope that the results can be a good indicator of the current feasibility of model counting and spark many new applications. In this paper, we report on details of the Model Counting Competition 2020, about carrying out the competition, and the results. The competition encompassed three versions of the model counting problem, which we evaluated in separate tracks. The first track featured the model counting problem (MC), which asks for the number of models of a given Boolean formula. On the second track, we challenged developers to submit programs that solve the weighted model counting problem (WMC). The last track was dedicated to projected model counting (PMC). In total, we received a surprising number of 9 solvers in 34 versions from 8 groups.


Attention-gating for improved radio galaxy classification

arXiv.org Artificial Intelligence

In this work we introduce attention as a state of the art mechanism for classification of radio galaxies using convolutional neural networks. We present an attention-based model that performs on par with previous classifiers while using more than 50\% fewer parameters than the next smallest classic CNN application in this field. We demonstrate quantitatively how the selection of normalisation and aggregation methods used in attention-gating can affect the output of individual models, and show that the resulting attention maps can be used to interpret the classification choices made by the model. We observe that the salient regions identified by the our model align well with the regions an expert human classifier would attend to make equivalent classifications. We show that while the selection of normalisation and aggregation may only minimally affect the performance of individual models, it can significantly affect the interpretability of the respective attention maps and by selecting a model which aligns well with how astronomers classify radio sources by eye, a user can employ the model in a more effective manner.


Biomedical Knowledge Graph Refinement with Embedding and Logic Rules

arXiv.org Artificial Intelligence

Currently, there is a rapidly increasing need for high-quality biomedical knowledge graphs (BioKG) that provide direct and precise biomedical knowledge. In the context of COVID-19, this issue is even more necessary to be highlighted. However, most BioKG construction inevitably includes numerous conflicts and noises deriving from incorrect knowledge descriptions in literature and defective information extraction techniques. Many studies have demonstrated that reasoning upon the knowledge graph is effective in eliminating such conflicts and noises. This paper proposes a method BioGRER to improve the BioKG's quality, which comprehensively combines the knowledge graph embedding and logic rules that support and negate triplets in the BioKG. In the proposed model, the BioKG refinement problem is formulated as the probability estimation for triplets in the BioKG. We employ the variational EM algorithm to optimize knowledge graph embedding and logic rule inference alternately. In this way, our model could combine efforts from both the knowledge graph embedding and logic rules, leading to better results than using them alone. We evaluate our model over a COVID-19 knowledge graph and obtain competitive results.


Tencent robot dog navigates plum blossom pile like Kung Fu master

Daily Mail - Science & tech

A four-legged robot dog created by Chinese technology company Tencent has the balance of a King Fu master, new video footage shows. Jamoca, which has been created by Tencent's Robotics X Lab, can walk across a set of uneven poles spaced randomly apart, like'plum blossom piles' used in Kung Fu to teach better balance. It uses a front-facing camera and visual modelling to accurately perceive its environment and achieve'robust eye and foot calibration'. The robot, which is more than three feet in length and weighs 70kg, can walk, run, trot diagonally and jump just like a real dog. Compared with other four-legged robots, including those developed by US firm Boston Dynamics, Jamoca can navigate a course where there are hazardous gaps that can lead to a fall and operate at a higher altitude. According to Beijing-based technology media platform Jiqizhixin, the dog is still in its experimental stages.


Which optical illusions can animals see?

National Geographic

Male bowerbirds in Australia use a technique called forced perspective to make themselves look bigger to potential mates who visit their carefully constructed bowers. Visual illusions remind us that we are not passive decoders of reality but active interpreters. Our eyes capture information from the environment, but our brain can play tricks on us. Perception doesn't always match reality. Scientists have used illusions for decades to explore the psychological and cognitive processes that underlie human visual perception.


Artificial Intelligence Will Revolutionize Energy, Earning Billions For Investors

#artificialintelligence

As the world is anticipating the end of the COVID-19 pandemic, energy consumption in industry and services is likely to grow. In the longer term, the developing world will increase its energy utilization, leading to growth of global primary energy demand by of 0.4% - 0.6% per year, or a 25% increase by 2050. According to scenarios calculated by energy giant Total SE, massive electrification of transportation will lead to decarbonization, and will require a rapid growth in renewables as a source of electricity. This energy transformation will see an explosion of growth in Artificial Intelligence (AI) utilization in the sector โ€“ up 50% between 2020 and 2024 โ€“ to allow smart, 21st century grids to become the gold standard, gradually replacing the "dumb" grids laid down in the late 19th โ€“ early 20th century in Europe, North America, Japan, China and beyond. The grid is a meta-system of generation facilities, be it nuclear, gas, coal, solar, wind, and hydro, connected by high voltage wire networks to transformers, and then to sub-stations and individual buildings, households, and apartments.


A Multi-intersection Vehicular Cooperative Control based on End-Edge-Cloud Computing

arXiv.org Artificial Intelligence

Cooperative Intelligent Transportation Systems (C-ITS) will change the modes of road safety and traffic management, especially at intersections without traffic lights, namely unsignalized intersections. Existing researches focus on vehicle control within a small area around an unsignalized intersection. In this paper, we expand the control domain to a large area with multiple intersections. In particular, we propose a Multi-intersection Vehicular Cooperative Control (MiVeCC) to enable cooperation among vehicles in a large area with multiple unsignalized intersections. Firstly, a vehicular end-edge-cloud computing framework is proposed to facilitate end-edge-cloud vertical cooperation and horizontal cooperation among vehicles. Then, the vehicular cooperative control problems in the cloud and edge layers are formulated as Markov Decision Process (MDP) and solved by two-stage reinforcement learning. Furthermore, to deal with high-density traffic, vehicle selection methods are proposed to reduce the state space and accelerate algorithm convergence without performance degradation. A multi-intersection simulation platform is developed to evaluate the proposed scheme. Simulation results show that the proposed MiVeCC can improve travel efficiency at multiple intersections by up to 4.59 times without collision compared with existing methods.