Oceania
Alexa, Can You Hear Me?
By exploring the various facets of gendering at play in the design of VPAs, specifically Alexa, I argue that gendering Alexa as female poses societal harm insofar as she reproduces normative assumptions about the role of women as submissive, inferior, and secondary to men. The prevalence of AI-driven virtual personal assistants (VPAs) is proliferating, with Amazon Echo being one of the most highly sought-after smart speakers globally. However, not until recently has there been much research or attention focused on the gender bias noticeably programmed into this technology, specifically Alexa, intentionally designed, coded, and programmed by men and gendered to be distinctly female. Big Tech's decision to gender VPAs is seen most evident through their assigned female names and their female voices that users find more pleasant to give orders to than a male voice, as seen through witty flirtatious programmed responses. Through these interactions, Alexa performs gender as a feminized and sexualized entity imposed upon her by her Silicon Valley creators, that has the potential to unravel decades of social and political progress, as well as reinstate the gender bias of the past that women strived to eradicate. In the not-so-distant future, TechCrunch forecasts that the use of voice assistants is set to triple over the next few years and estimates there will be ten billion digital voice assistants by 2023, up from the 2.5 billion assistants in use at the end of 2018. This growth is attributed to Amazon Echo being one of the most highly sought-after smart speakers in the world.
Tracking Multiple Fast Targets With Swarms: Interplay Between Social Interaction and Agent Memory
Kwa, Hian Lee, Kit, Jabez Leong, Bouffanais, Roland
The task of searching for and tracking of multiple targets is a challenging one. However, most works in this area do not consider evasive targets that move faster than the agents comprising the multi-robot system. This is due to the assumption that the movement patterns of such targets, combined with their excessive speed, would make the task nearly impossible to accomplish. In this work, we show that this is not the case and we propose a decentralized search and tracking strategy in which the level of exploration and exploitation carried out by the swarm is adjustable. By tuning a swarm's exploration and exploitation dynamics, we demonstrate that there exists an optimal balance between the level of exploration and exploitation performed. This optimum maximizes its tracking performance and changes depending on the number of targets and the targets' movement profiles. We also show that the use of agent-based memory is critical in enabling the tracking of an evasive target. The obtained simulation results are validated through experimental tests with a decentralized swarm of six robots tracking a virtual fast-moving target.
Non-Local Feature Aggregation on Graphs via Latent Fixed Data Structures
Rahmani, Mostafa, Shafipour, Rasoul, Li, Ping
In contrast to image/text data whose order can be used to perform non-local feature aggregation in a straightforward way using the pooling layers, graphs lack the tensor representation and mostly the element-wise max/mean function is utilized to aggregate the locally extracted feature vectors. In this paper, we present a novel approach for global feature aggregation in Graph Neural Networks (GNNs) which utilizes a Latent Fixed Data Structure (LFDS) to aggregate the extracted feature vectors. The locally extracted feature vectors are sorted/distributed on the LFDS and a latent neural network (CNN/GNN) is utilized to perform feature aggregation on the LFDS. The proposed approach is used to design several novel global feature aggregation methods based on the choice of the LFDS. We introduce multiple LFDSs including loop, 3D tensor (image), sequence, data driven graphs and an algorithm which sorts/distributes the extracted local feature vectors on the LFDS. While the computational complexity of the proposed methods are linear with the order of input graphs, they achieve competitive or better results.
Generative Relation Linking for Question Answering over Knowledge Bases
Rossiello, Gaetano, Mihindukulasooriya, Nandana, Abdelaziz, Ibrahim, Bornea, Mihaela, Gliozzo, Alfio, Naseem, Tahira, Kapanipathi, Pavan
Relation linking is essential to enable question answering over knowledge bases. Although there are various efforts to improve relation linking performance, the current state-of-the-art methods do not achieve optimal results, therefore, negatively impacting the overall end-to-end question answering performance. In this work, we propose a novel approach for relation linking framing it as a generative problem facilitating the use of pre-trained sequence-to-sequence models. We extend such sequence-to-sequence models with the idea of infusing structured data from the target knowledge base, primarily to enable these models to handle the nuances of the knowledge base. Moreover, we train the model with the aim to generate a structured output consisting of a list of argument-relation pairs, enabling a knowledge validation step. We compared our method against the existing relation linking systems on four different datasets derived from DBpedia and Wikidata. Our method reports large improvements over the state-of-the-art while using a much simpler model that can be easily adapted to different knowledge bases.
An Effective Non-Autoregressive Model for Spoken Language Understanding
Cheng, Lizhi, Jia, Weijia, Yang, Wenmian
Spoken Language Understanding (SLU), a core component of the task-oriented dialogue system, expects a shorter inference latency due to the impatience of humans. Non-autoregressive SLU models clearly increase the inference speed but suffer uncoordinated-slot problems caused by the lack of sequential dependency information among each slot chunk. To gap this shortcoming, in this paper, we propose a novel non-autoregressive SLU model named Layered-Refine Transformer, which contains a Slot Label Generation (SLG) task and a Layered Refine Mechanism (LRM). SLG is defined as generating the next slot label with the token sequence and generated slot labels. With SLG, the non-autoregressive model can efficiently obtain dependency information during training and spend no extra time in inference. LRM predicts the preliminary SLU results from Transformer's middle states and utilizes them to guide the final prediction. Experiments on two public datasets indicate that our model significantly improves SLU performance (1.5\% on Overall accuracy) while substantially speed up (more than 10 times) the inference process over the state-of-the-art baseline.
An Effective System for Multi-format Information Extraction
Liu, Yaduo, Zhang, Longhui, Yin, Shujuan, Zhao, Xiaofeng, Ren, Feiliang
The multi-format information extraction task in the 2021 Language and Intelligence Challenge is designed to comprehensively evaluate information extraction from different dimensions. It consists of an multiple slots relation extraction subtask and two event extraction subtasks that extract events from both sentence-level and document-level. Here we describe our system for this multi-format information extraction competition task. Specifically, for the relation extraction subtask, we convert it to a traditional triple extraction task and design a voting based method that makes full use of existing models. For the sentence-level event extraction subtask, we convert it to a NER task and use a pointer labeling based method for extraction. Furthermore, considering the annotated trigger information may be helpful for event extraction, we design an auxiliary trigger recognition model and use the multi-task learning mechanism to integrate the trigger features into the event extraction model. For the document-level event extraction subtask, we design an Encoder-Decoder based method and propose a Transformer-alike decoder. Finally,our system ranks No.4 on the test set leader-board of this multi-format information extraction task, and its F1 scores for the subtasks of relation extraction, event extractions of sentence-level and document-level are 79.887%, 85.179%, and 70.828% respectively. The codes of our model are available at {https://github.com/neukg/MultiIE}.
Blockchain-based Trustworthy Federated Learning Architecture
Lo, Sin Kit, Liu, Yue, Lu, Qinghua, Wang, Chen, Xu, Xiwei, Paik, Hye-Young, Zhu, Liming
Federated learning is an emerging privacy-preserving AI technique where clients (i.e., organisations or devices) train models locally and formulate a global model based on the local model updates without transferring local data externally. However, federated learning systems struggle to achieve trustworthiness and embody responsible AI principles. In particular, federated learning systems face accountability and fairness challenges due to multi-stakeholder involvement and heterogeneity in client data distribution. To enhance the accountability and fairness of federated learning systems, we present a blockchain-based trustworthy federated learning architecture. We first design a smart contract-based data-model provenance registry to enable accountability. Additionally, we propose a weighted fair data sampler algorithm to enhance fairness in training data. We evaluate the proposed approach using a COVID-19 X-ray detection use case. The evaluation results show that the approach is feasible to enable accountability and improve fairness. The proposed algorithm can achieve better performance than the default federated learning setting in terms of the model's generalisation and accuracy.
Responsible AI Programs To Follow And Implement-- Breakout Year 2021
Responsible usage of AI is growing extensively since 2017 and 2021 will see expansion fully into the operationalization of AI ethical principles, frameworks, and policies. Operationalization defined as taking principles into useful practice and thus requiring prioritization for businesses. The challenge is focusing on the top initiatives which I will identify in this article. In my pro bono contributions across 100 global programs with non-profits, I am seeing businesses are still challenged in moving from proof-of-concept responsible AI applications, within one business unit, to scaling across the enterprise. With more than 300 AI principles, frameworks, policy, and regulatory initiatives--businesses must keep current of the top contenders as AI usage grows.
Grant success for research on Artificial Intelligence in IVF
Congratulations to Dr Fabrizzio Horta on receiving the 2021 Monash Data Futures Institute Seed Grant - AI and Data Science for Monash Global Challenges. This $50,000 grant will help in the research collaboration between the Department of Obstetrics and Gynaecology (Dr Fabrizzio Horta, Prof Beverley Vollenhoven) and the Department of Data Science and AI (A/Prof Hamid Rezatofhigi, Prof Jianfei Cai). "This grant will help us to support our current research, aiming to develop a clinical decision support system in IVF through deep learning algorithms. Particularly this grant aims to target one of the global challenges we are facing by introducing Artificial Intelligence technology into clinical practice. Thus, it will not just have a local impact, but a global impact in the IVF field through strong international research collaboration".
Neural Architecture Dilation for Adversarial Robustness
Li, Yanxi, Yang, Zhaohui, Wang, Yunhe, Xu, Chang
With the tremendous advances in the architecture and scale of convolutional neural networks (CNNs) over the past few decades, they can easily reach or even exceed the performance of humans in certain tasks. However, a recently discovered shortcoming of CNNs is that they are vulnerable to adversarial attacks. Although the adversarial robustness of CNNs can be improved by adversarial training, there is a trade-off between standard accuracy and adversarial robustness. From the neural architecture perspective, this paper aims to improve the adversarial robustness of the backbone CNNs that have a satisfactory accuracy. Under a minimal computational overhead, the introduction of a dilation architecture is expected to be friendly with the standard performance of the backbone CNN while pursuing adversarial robustness. Theoretical analyses on the standard and adversarial error bounds naturally motivate the proposed neural architecture dilation algorithm. Experimental results on real-world datasets and benchmark neural networks demonstrate the effectiveness of the proposed algorithm to balance the accuracy and adversarial robustness.