Oceania
The Short Anthropological Guide to the Study of Ethical AI
Over the next few years, society as a whole will need to address what core values it wishes to protect when dealing with technology. Anthropology, a field dedicated to the very notion of what it means to be human, can provide some interesting insights into how to cope and tackle these changes in our Western society and other areas of the world. It can be challenging for social science practitioners to grasp and keep up with the pace of technological innovation, with many being unfamiliar with the jargon of AI. This short guide serves as both an introduction to AI ethics and social science and anthropological perspectives on the development of AI. It intends to provide those unfamiliar with the field with an insight into the societal impact of AI systems and how, in turn, these systems can lead us to rethink how our world operates.
Unsupervised Evaluation for Question Answering with Transformers
Muttenthaler, Lukas, Augenstein, Isabelle, Bjerva, Johannes
It is challenging to automatically evaluate the answer of a QA model at inference time. Although many models provide confidence scores, and simple heuristics can go a long way towards indicating answer correctness, such measures are heavily dataset-dependent and are unlikely to generalize. In this work, we begin by investigating the hidden representations of questions, answers, and contexts in transformer-based QA architectures. We observe a consistent pattern in the answer representations, which we show can be used to automatically evaluate whether or not a predicted answer span is correct. Our method does not require any labeled data and outperforms strong heuristic baselines, across 2 datasets and 7 domains. We are able to predict whether or not a model's answer is correct with 91.37% accuracy on SQuAD, and 80.7% accuracy on SubjQA. We expect that this method will have broad applications, e.g., in the semi-automatic development of QA datasets
Rockwell Automation and Microsoft Expand Partnership
Rockwell Automation, Inc. and Microsoft Corp. announced a five-year partnership expansion to develop integrated, market-ready solutions that help industrial customers improve digital agility through cloud technology. By combining each company's expertise in the industrial and IT markets, respectively, teams can work together more seamlessly, enabling industrial organizations to save on infrastructure costs, speed time-to-value, and increase productivity. Microsoft and Rockwell are working to deliver innovative edge-to-cloud-based solutions that connect information between development, operations and maintenance teams through a singular, trusted data environment. This will allow development teams to digitally prototype, configure and collaborate without investing in costly physical equipment. This unified information environment also enables IT and OT teams to not only securely access and share data models across the organization, but with their ecosystem of partners as well.
Artificial Intelligence Research in Australia -- A Profile
Does the United States have a 51st state called Australia? A superficial look at the artificial intelligence (AI) research being done here could give that impression. A look beneath the surface, though, indicates some fundamental differences and reveals a dynamic and rapidly expanding AI community. General awareness of the Australian AI research community has been growing slowly for some time. AI was once considered a bit esoteric -- the domain of an almost lunatic fringe- but the large government -backed programs overseas, as well as an appreciation of the significance of AI products and potential impact on the community, have led to a reassessment of this image and to concerted attempt to discover how Australia is to contribute to the world AI research effort and hoe the country is to benefit from it.
RoboCup-97: The First Robot World Cup Soccer Games and Conferences
RoboCup-97, The First Robot World Cup Soccer Games and Conferences, was held at the Fifteenth International Joint Conference on Artificial Intelligence. There were two leagues: (1) real robot and (2) simulation. Ten teams participated in the real-robot league and 29 teams in the simulation league. Over 150 researchers attended the technical workshop. The world champions are CMUNITED (Carnegie Mellon University) for the small-size league, DREAMTEAM (University of Southern California) and TRACKIES (Osaka University, Japan) for the middle-size league, and AT-HUMBOLDT (Humboldt University) for the simulation league.
Reports of the 2016 AAAI Workshop Program
The Workshop Program of the Association for the Advancement of Artificial Intelligence's Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) was held at the beginning of the conference, February 12-13, 2016. Workshop participants met and discussed issues with a selected focus -- providing an informal setting for active exchange among researchers, developers and users on topics of current interest. To foster interaction and exchange of ideas, the workshops were kept small, with 25-65 participants. Attendance was sometimes limited to active participants only, but most workshops also allowed general registration by other interested individuals. The AAAI-16 Workshops were an excellent forum for exploring emerging approaches and task areas, for bridging the gaps between AI and other fields or between subfields of AI, for elucidating the results of exploratory research, or for critiquing existing approaches.
Neural Mask Generator: Learning to Generate Adaptive Word Maskings for Language Model Adaptation
Kang, Minki, Han, Moonsu, Hwang, Sung Ju
We propose a method to automatically generate a domain- and task-adaptive maskings of the given text for self-supervised pre-training, such that we can effectively adapt the language model to a particular target task (e.g. question answering). Specifically, we present a novel reinforcement learning-based framework which learns the masking policy, such that using the generated masks for further pre-training of the target language model helps improve task performance on unseen texts. We use off-policy actor-critic with entropy regularization and experience replay for reinforcement learning, and propose a Transformer-based policy network that can consider the relative importance of words in a given text. We validate our Neural Mask Generator (NMG) on several question answering and text classification datasets using BERT and DistilBERT as the language models, on which it outperforms rule-based masking strategies, by automatically learning optimal adaptive maskings.
Unsupervised Hierarchical Concept Learning
Roychowdhury, Sumegh, Sontakke, Sumedh A., Puri, Nikaash, Sarkar, Mausoom, Aggarwal, Milan, Badjatiya, Pinkesh, Krishnamurthy, Balaji, Itti, Laurent
Discovering concepts (or temporal abstractions) in an unsupervised manner from demonstration data in the absence of an environment is an important problem. Organizing these discovered concepts hierarchically at different levels of abstraction is useful in discovering patterns, building ontologies, and generating tutorials from demonstration data. However, recent work to discover such concepts without access to any environment does not discover relationships (or a hierarchy) between these discovered concepts. In this paper, we present a Transformer-based concept abstraction architecture UNHCLE (pronounced uncle) that extracts a hierarchy of concepts in an unsupervised way from demonstration data. We empirically demonstrate how UNHCLE discovers meaningful hierarchies using datasets from Chess and Cooking domains. Finally, we show how UNHCLE learns meaningful language labels for concepts by using demonstration data augmented with natural language for cooking and chess. All of our code is available at https://github.com/UNHCLE/UNHCLE
Dif-MAML: Decentralized Multi-Agent Meta-Learning
Kayaalp, Mert, Vlaski, Stefan, Sayed, Ali H.
The objective of meta-learning is to exploit the knowledge obtained from observed tasks to improve adaptation to unseen tasks. As such, meta-learners are able to generalize better when they are trained with a larger number of observed tasks and with a larger amount of data per task. Given the amount of resources that are needed, it is generally difficult to expect the tasks, their respective data, and the necessary computational capacity to be available at a single central location. It is more natural to encounter situations where these resources are spread across several agents connected by some graph topology. The formalism of meta-learning is actually well-suited to this decentralized setting, where the learner would be able to benefit from information and computational power spread across the agents. Motivated by this observation, in this work, we propose a cooperative fully-decentralized multi-agent meta-learning algorithm, referred to as Diffusion-based MAML or Dif-MAML. Decentralized optimization algorithms are superior to centralized implementations in terms of scalability, avoidance of communication bottlenecks, and privacy guarantees. The work provides a detailed theoretical analysis to show that the proposed strategy allows a collection of agents to attain agreement at a linear rate and to converge to a stationary point of the aggregate MAML objective even in non-convex environments. Simulation results illustrate the theoretical findings and the superior performance relative to the traditional non-cooperative setting.
Generalized Matrix Factorization
Kidziński, Łukasz, Hui, Francis K. C., Warton, David I., Hastie, Trevor
Unmeasured or latent variables are often the cause of correlations between multivariate measurements and are studied in a variety of fields such as psychology, ecology, and medicine. For Gaussian measurements, there are classical tools such as factor analysis or principal component analysis with a well-established theory and fast algorithms. Generalized Linear Latent Variable models (GLLVM) generalize such factor models to non-Gaussian responses. However, current algorithms for estimating model parameters in GLLVMs require intensive computation and do not scale to large datasets with thousands of observational units or responses. In this article, we propose a new approach for fitting GLLVMs to such high-volume, high-dimensional datasets. We approximate the likelihood using penalized quasi-likelihood and use a Newton method and Fisher scoring to learn the model parameters. Our method greatly reduces the computation time and can be easily parallelized, enabling factorization at unprecedented scale using commodity hardware. We illustrate application of our method on a dataset of 48,000 observational units with over 2,000 observed species in each unit, finding that most of the variability can be explained with a handful of factors.