Oceania
Pay Better Attention to Attention: Head Selection in Multilingual and Multi-Domain Sequence Modeling
Gong, Hongyu, Tang, Yun, Pino, Juan, Li, Xian
Multi-head attention has each of the attention heads collect salient information from different parts of an input sequence, making it a powerful mechanism for sequence modeling. Multilingual and multi-domain learning are common scenarios for sequence modeling, where the key challenge is to maximize positive transfer and mitigate negative transfer across languages and domains. In this paper, we find that non-selective attention sharing is sub-optimal for achieving good generalization across all languages and domains. We further propose attention sharing strategies to facilitate parameter sharing and specialization in multilingual and multi-domain sequence modeling. Our approach automatically learns shared and specialized attention heads for different languages and domains to mitigate their interference. Evaluated in various tasks including speech recognition, text-to-text and speech-to-text translation, the proposed attention sharing strategies consistently bring gains to sequence models built upon multi-head attention. For speech-to-text translation, our approach yields an average of $+2.0$ BLEU over $13$ language directions in multilingual setting and $+2.0$ BLEU over $3$ domains in multi-domain setting.
Rep. Mike Gallagher: Truth on COVID, China โ here's why world needs answers about what happened at Wuhan
Fox News correspondent Rich Edson has the latest on China's accountability on'Special Report' At the end of HBO's miniseries "Chernobyl," Soviet nuclear scientist Valery Legosov warns: "Every lie we tell incurs a debt to the truth. Sooner or later that debt is paid." We have spent the last 18 months witnessing China's Chernobyl in the form of the COVID-19 pandemic. Just like the Soviet Union during the Chernobyl nuclear meltdown, from the earliest days of the pandemic when the virus emerged in Wuhan, the Chinese Communist Party (CCP) has engaged in a concerted campaign to pile lies on top of lies about the virus and its origins. Consider that the CCP refused to allow U.S. Centers for Disease Control experts access to Wuhan, and critical data from the Wuhan Institute of Virology (WIV) that could have helped the world get ahead of the disease suddenly disappeared.
Hands-free farming just a robotic arm's length away
Robots and artificial intelligence will replace workers on Australia's first fully automated farm created at a cost of $20 million. Charles Sturt University in Wagga Wagga will create the "hands-free farm" on a 1,900-hectare property to demonstrate what robots and artificial intelligence can do without workers in the paddock. Food Agility chief executive Richard Norton said the reality of "hands-free" farming' was closer than many people realised. "Full automation is not a distant concept. We already have mines in the Pilbara operated entirely through automation", he said "It's not beyond the realms of possibility that a farmer could be sitting in a study in front of a computer driving multiple vehicles".
CAMERAS: Enhanced Resolution And Sanity preserving Class Activation Mapping for image saliency
Jalwana, Mohammad A. A. K., Akhtar, Naveed, Bennamoun, Mohammed, Mian, Ajmal
Backpropagation image saliency aims at explaining model predictions by estimating model-centric importance of individual pixels in the input. However, class-insensitivity of the earlier layers in a network only allows saliency computation with low resolution activation maps of the deeper layers, resulting in compromised image saliency. Remedifying this can lead to sanity failures. We propose CAMERAS, a technique to compute high-fidelity backpropagation saliency maps without requiring any external priors and preserving the map sanity. Our method systematically performs multi-scale accumulation and fusion of the activation maps and backpropagated gradients to compute precise saliency maps. From accurate image saliency to articulation of relative importance of input features for different models, and precise discrimination between model perception of visually similar objects, our high-resolution mapping offers multiple novel insights into the black-box deep visual models, which are presented in the paper. We also demonstrate the utility of our saliency maps in adversarial setup by drastically reducing the norm of attack signals by focusing them on the precise regions identified by our maps. Our method also inspires new evaluation metrics and a sanity check for this developing research direction. Code is available here https://github.com/VisMIL/CAMERAS
Attack to Fool and Explain Deep Networks
Akhtar, Naveed, Jalwana, Muhammad A. A. K., Bennamoun, Mohammed, Mian, Ajmal
Deep visual models are susceptible to adversarial perturbations to inputs. Although these signals are carefully crafted, they still appear noise-like patterns to humans. This observation has led to the argument that deep visual representation is misaligned with human perception. We counter-argue by providing evidence of human-meaningful patterns in adversarial perturbations. We first propose an attack that fools a network to confuse a whole category of objects (source class) with a target label. Our attack also limits the unintended fooling by samples from non-sources classes, thereby circumscribing human-defined semantic notions for network fooling. We show that the proposed attack not only leads to the emergence of regular geometric patterns in the perturbations, but also reveals insightful information about the decision boundaries of deep models. Exploring this phenomenon further, we alter the `adversarial' objective of our attack to use it as a tool to `explain' deep visual representation. We show that by careful channeling and projection of the perturbations computed by our method, we can visualize a model's understanding of human-defined semantic notions. Finally, we exploit the explanability properties of our perturbations to perform image generation, inpainting and interactive image manipulation by attacking adversarialy robust `classifiers'.In all, our major contribution is a novel pragmatic adversarial attack that is subsequently transformed into a tool to interpret the visual models. The article also makes secondary contributions in terms of establishing the utility of our attack beyond the adversarial objective with multiple interesting applications.
TGRNet: A Table Graph Reconstruction Network for Table Structure Recognition
Xue, Wenyuan, Yu, Baosheng, Wang, Wen, Tao, Dacheng, Li, Qingyong
A table arranging data in rows and columns is a very effective data structure, which has been widely used in business and scientific research. Considering large-scale tabular data in online and offline documents, automatic table recognition has attracted increasing attention from the document analysis community. Though human can easily understand the structure of tables, it remains a challenge for machines to understand that, especially due to a variety of different table layouts and styles. Existing methods usually model a table as either the markup sequence or the adjacency matrix between different table cells, failing to address the importance of the logical location of table cells, e.g., a cell is located in the first row and the second column of the table. In this paper, we reformulate the problem of table structure recognition as the table graph reconstruction, and propose an end-to-end trainable table graph reconstruction network (TGRNet) for table structure recognition. Specifically, the proposed method has two main branches, a cell detection branch and a cell logical location branch, to jointly predict the spatial location and the logical location of different cells. Experimental results on three popular table recognition datasets and a new dataset with table graph annotations (TableGraph-350K) demonstrate the effectiveness of the proposed TGRNet for table structure recognition. Code and annotations will be made publicly available.
AI Weekly: The promise and limitations of machine programming tools
Machine programming, which automates the development and maintenance of software, is becoming supercharged by AI. During its Build developer conference in May, Microsoft detailed a new feature in Power Apps that taps OpenAI's GPT-3 language model to assist people in choosing formulas. Intel's ControlFlag can autonomously detect errors in code. And Facebook's TransCoder converts code from one programming language into another. The applications of computer programming are vast in scope.
Top PMs and Presidents Who Support Artificial Intelligence
The importance of artificial intelligence is known around the world and every nation is on its way to win the AI race as they realize that acquiring excellence in AI technology would make them the biggest superpower. Tesla king, Elon Musk has recently tweeted that "Competition for AI superiority at national level most likely cause of WW3". Recently India along with Australia, the United States, the United Kingdom, Canada, France, Germany, New Zealand, and others have come together to establish the Global Partnership on Artificial Intelligence (GPAI) for responsible evolution and use of AI. The PMs and presidents of the nations are supporting artificial intelligence in their speeches as well as their establishment of various policies regarding AI and it is demonstrated in the following. In 2020, Prime Minister Narendra Modi inaugurated a virtual summit on artificial intelligence called'RAISE 2020'.
Residual Error: a New Performance Measure for Adversarial Robustness
Aboutalebi, Hossein, Shafiee, Mohammad Javad, Karg, Michelle, Scharfenberger, Christian, Wong, Alexander
Despite the significant advances in deep learning over the past decade, a major challenge that limits the wide-spread adoption of deep learning has been their fragility to adversarial attacks. This sensitivity to making erroneous predictions in the presence of adversarially perturbed data makes deep neural networks difficult to adopt for certain real-world, mission-critical applications. While much of the research focus has revolved around adversarial example creation and adversarial hardening, the area of performance measures for assessing adversarial robustness is not well explored. Motivated by this, this study presents the concept of residual error, a new performance measure for not only assessing the adversarial robustness of a deep neural network at the individual sample level, but also can be used to differentiate between adversarial and non-adversarial examples to facilitate for adversarial example detection. Furthermore, we introduce a hybrid model for approximating the residual error in a tractable manner. Experimental results using the case of image classification demonstrates the effectiveness and efficacy of the proposed residual error metric for assessing several well-known deep neural network architectures. These results thus illustrate that the proposed measure could be a useful tool for not only assessing the robustness of deep neural networks used in mission-critical scenarios, but also in the design of adversarially robust models.
Message Passing in Graph Convolution Networks via Adaptive Filter Banks
Gao, Xing, Dai, Wenrui, Li, Chenglin, Zou, Junni, Xiong, Hongkai, Frossard, Pascal
Graph convolution networks, like message passing graph convolution networks (MPGCNs), have been a powerful tool in representation learning of networked data. However, when data is heterogeneous, most architectures are limited as they employ a single strategy to handle multi-channel graph signals and they typically focus on low-frequency information. In this paper, we present a novel graph convolution operator, termed BankGCN, which keeps benefits of message passing models, but extends their capabilities beyond `low-pass' features. It decomposes multi-channel signals on graphs into subspaces and handles particular information in each subspace with an adapted filter. The filters of all subspaces have different frequency responses and together form a filter bank. Furthermore, each filter in the spectral domain corresponds to a message passing scheme, and diverse schemes are implemented via the filter bank. Importantly, the filter bank and the signal decomposition are jointly learned to adapt to the spectral characteristics of data and to target applications. Furthermore, this is implemented almost without extra parameters in comparison with most existing MPGCNs. Experimental results show that the proposed convolution operator permits to achieve excellent performance in graph classification on a collection of benchmark graph datasets.